./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound10.i --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound10.i -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d7b32f819b918e072cd2f6b8ef11cf08c33c51198307cb8de75af009db97bd7b --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-11 19:44:57,878 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 19:44:57,939 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 19:44:57,943 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 19:44:57,945 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 19:44:57,976 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 19:44:57,976 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 19:44:57,977 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 19:44:57,977 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 19:44:57,979 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 19:44:57,979 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 19:44:57,979 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 19:44:57,980 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 19:44:57,980 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 19:44:57,983 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 19:44:57,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 19:44:57,984 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 19:44:57,984 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 19:44:57,984 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 19:44:57,984 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 19:44:57,984 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 19:44:57,986 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 19:44:57,986 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 19:44:57,987 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 19:44:57,987 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 19:44:57,987 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 19:44:57,987 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 19:44:57,988 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 19:44:57,988 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 19:44:57,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 19:44:57,989 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 19:44:57,989 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 19:44:57,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:44:57,990 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 19:44:57,990 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 19:44:57,990 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 19:44:57,990 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 19:44:57,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 19:44:57,991 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 19:44:57,991 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 19:44:57,991 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 19:44:57,991 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 19:44:57,992 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/certificate-witnesses-artifact/automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d7b32f819b918e072cd2f6b8ef11cf08c33c51198307cb8de75af009db97bd7b Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-11 19:44:58,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 19:44:58,299 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 19:44:58,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 19:44:58,303 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 19:44:58,304 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 19:44:58,305 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound10.i [2024-09-11 19:44:59,667 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 19:44:59,841 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 19:44:59,842 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound10.i [2024-09-11 19:44:59,851 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/c09292273/df77991e323d4f8283489766aae168f0/FLAG464cc9425 [2024-09-11 19:45:00,241 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/c09292273/df77991e323d4f8283489766aae168f0 [2024-09-11 19:45:00,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 19:45:00,246 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 19:45:00,249 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 19:45:00,249 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 19:45:00,255 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 19:45:00,257 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:45:00" (1/1) ... [2024-09-11 19:45:00,258 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ae4caf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:45:00, skipping insertion in model container [2024-09-11 19:45:00,258 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:45:00" (1/1) ... [2024-09-11 19:45:00,277 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 19:45:00,433 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound10.i[951,964] [2024-09-11 19:45:00,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:45:00,454 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 19:45:00,465 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound10.i[951,964] [2024-09-11 19:45:00,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:45:00,484 INFO L204 MainTranslator]: Completed translation [2024-09-11 19:45:00,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:45:00 WrapperNode [2024-09-11 19:45:00,485 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 19:45:00,486 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 19:45:00,486 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 19:45:00,486 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 19:45:00,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:45:00" (1/1) ... [2024-09-11 19:45:00,496 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:45:00" (1/1) ... [2024-09-11 19:45:00,513 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 51 [2024-09-11 19:45:00,514 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 19:45:00,514 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 19:45:00,514 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 19:45:00,514 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 19:45:00,522 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:45:00" (1/1) ... [2024-09-11 19:45:00,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:45:00" (1/1) ... [2024-09-11 19:45:00,523 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:45:00" (1/1) ... [2024-09-11 19:45:00,535 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-11 19:45:00,535 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:45:00" (1/1) ... [2024-09-11 19:45:00,535 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:45:00" (1/1) ... [2024-09-11 19:45:00,538 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:45:00" (1/1) ... [2024-09-11 19:45:00,540 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:45:00" (1/1) ... [2024-09-11 19:45:00,541 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:45:00" (1/1) ... [2024-09-11 19:45:00,542 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:45:00" (1/1) ... [2024-09-11 19:45:00,543 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 19:45:00,544 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 19:45:00,544 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 19:45:00,544 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 19:45:00,545 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:45:00" (1/1) ... [2024-09-11 19:45:00,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:45:00,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:45:00,572 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-11 19:45:00,575 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-11 19:45:00,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 19:45:00,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 19:45:00,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 19:45:00,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 19:45:00,624 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-11 19:45:00,624 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-11 19:45:00,677 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 19:45:00,678 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 19:45:00,786 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-11 19:45:00,786 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 19:45:00,811 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 19:45:00,812 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-11 19:45:00,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:45:00 BoogieIcfgContainer [2024-09-11 19:45:00,812 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 19:45:00,814 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 19:45:00,814 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 19:45:00,826 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 19:45:00,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 07:45:00" (1/3) ... [2024-09-11 19:45:00,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b0bad5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:45:00, skipping insertion in model container [2024-09-11 19:45:00,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:45:00" (2/3) ... [2024-09-11 19:45:00,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b0bad5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:45:00, skipping insertion in model container [2024-09-11 19:45:00,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:45:00" (3/3) ... [2024-09-11 19:45:00,831 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin2_unwindbound10.i [2024-09-11 19:45:00,846 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 19:45:00,846 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 19:45:00,928 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 19:45:00,936 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@20323565, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 19:45:00,936 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 19:45:00,940 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 14 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-11 19:45:00,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-09-11 19:45:00,950 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:45:00,951 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:45:00,951 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:45:00,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:45:00,956 INFO L85 PathProgramCache]: Analyzing trace with hash 774102990, now seen corresponding path program 1 times [2024-09-11 19:45:00,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:45:00,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283152744] [2024-09-11 19:45:00,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:45:00,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:45:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:45:01,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:45:01,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:45:01,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283152744] [2024-09-11 19:45:01,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283152744] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:45:01,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:45:01,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-11 19:45:01,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927241844] [2024-09-11 19:45:01,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:45:01,094 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-11 19:45:01,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:45:01,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-11 19:45:01,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 19:45:01,112 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 14 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:45:01,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:45:01,134 INFO L93 Difference]: Finished difference Result 32 states and 47 transitions. [2024-09-11 19:45:01,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-11 19:45:01,136 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-09-11 19:45:01,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:45:01,141 INFO L225 Difference]: With dead ends: 32 [2024-09-11 19:45:01,141 INFO L226 Difference]: Without dead ends: 16 [2024-09-11 19:45:01,143 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 19:45:01,146 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:45:01,146 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:45:01,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-09-11 19:45:01,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-09-11 19:45:01,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 19:45:01,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2024-09-11 19:45:01,173 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 7 [2024-09-11 19:45:01,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:45:01,174 INFO L474 AbstractCegarLoop]: Abstraction has 16 states and 21 transitions. [2024-09-11 19:45:01,174 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:45:01,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:45:01,175 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2024-09-11 19:45:01,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-09-11 19:45:01,175 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:45:01,175 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:45:01,176 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 19:45:01,176 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:45:01,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:45:01,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1084410172, now seen corresponding path program 1 times [2024-09-11 19:45:01,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:45:01,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322393465] [2024-09-11 19:45:01,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:45:01,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:45:01,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:45:01,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:45:01,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:45:01,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322393465] [2024-09-11 19:45:01,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322393465] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:45:01,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:45:01,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-11 19:45:01,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125543350] [2024-09-11 19:45:01,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:45:01,301 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-11 19:45:01,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:45:01,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-11 19:45:01,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-11 19:45:01,304 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:45:01,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:45:01,323 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2024-09-11 19:45:01,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-11 19:45:01,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-09-11 19:45:01,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:45:01,324 INFO L225 Difference]: With dead ends: 30 [2024-09-11 19:45:01,324 INFO L226 Difference]: Without dead ends: 18 [2024-09-11 19:45:01,325 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-11 19:45:01,326 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:45:01,326 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:45:01,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-09-11 19:45:01,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-09-11 19:45:01,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 19:45:01,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2024-09-11 19:45:01,339 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 9 [2024-09-11 19:45:01,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:45:01,340 INFO L474 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2024-09-11 19:45:01,340 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:45:01,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:45:01,342 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2024-09-11 19:45:01,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-11 19:45:01,343 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:45:01,343 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:45:01,343 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 19:45:01,343 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:45:01,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:45:01,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1068718015, now seen corresponding path program 1 times [2024-09-11 19:45:01,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:45:01,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234734311] [2024-09-11 19:45:01,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:45:01,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:45:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:45:01,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:45:01,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:45:01,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234734311] [2024-09-11 19:45:01,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234734311] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:45:01,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:45:01,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 19:45:01,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510484863] [2024-09-11 19:45:01,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:45:01,512 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 19:45:01,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:45:01,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 19:45:01,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:45:01,513 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:45:01,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:45:01,555 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2024-09-11 19:45:01,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 19:45:01,556 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-09-11 19:45:01,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:45:01,557 INFO L225 Difference]: With dead ends: 29 [2024-09-11 19:45:01,557 INFO L226 Difference]: Without dead ends: 22 [2024-09-11 19:45:01,557 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:45:01,558 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:45:01,559 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 66 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:45:01,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-11 19:45:01,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2024-09-11 19:45:01,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 19:45:01,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2024-09-11 19:45:01,566 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 10 [2024-09-11 19:45:01,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:45:01,566 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-09-11 19:45:01,566 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:45:01,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:45:01,567 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2024-09-11 19:45:01,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-11 19:45:01,567 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:45:01,567 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:45:01,567 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-11 19:45:01,568 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:45:01,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:45:01,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1066930555, now seen corresponding path program 1 times [2024-09-11 19:45:01,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:45:01,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080126438] [2024-09-11 19:45:01,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:45:01,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:45:01,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 19:45:01,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1417781521] [2024-09-11 19:45:01,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:45:01,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:45:01,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:45:01,597 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:45:01,598 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-11 19:45:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:45:01,645 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-11 19:45:01,651 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:45:01,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:45:01,768 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 19:45:01,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:45:01,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080126438] [2024-09-11 19:45:01,769 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 19:45:01,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417781521] [2024-09-11 19:45:01,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417781521] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:45:01,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:45:01,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-11 19:45:01,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124592122] [2024-09-11 19:45:01,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:45:01,771 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:45:01,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:45:01,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:45:01,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:45:01,772 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:45:01,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:45:01,880 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2024-09-11 19:45:01,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:45:01,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-09-11 19:45:01,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:45:01,882 INFO L225 Difference]: With dead ends: 33 [2024-09-11 19:45:01,882 INFO L226 Difference]: Without dead ends: 30 [2024-09-11 19:45:01,882 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:45:01,883 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:45:01,884 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 44 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:45:01,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-11 19:45:01,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2024-09-11 19:45:01,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-11 19:45:01,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-09-11 19:45:01,891 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 10 [2024-09-11 19:45:01,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:45:01,891 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-09-11 19:45:01,891 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:45:01,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:45:01,892 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-09-11 19:45:01,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-11 19:45:01,893 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:45:01,893 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:45:01,910 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-11 19:45:02,097 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:45:02,098 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:45:02,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:45:02,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1010218476, now seen corresponding path program 1 times [2024-09-11 19:45:02,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:45:02,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574204348] [2024-09-11 19:45:02,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:45:02,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:45:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:45:02,249 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:45:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:45:02,262 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:45:02,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:45:02,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574204348] [2024-09-11 19:45:02,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574204348] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:45:02,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408250909] [2024-09-11 19:45:02,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:45:02,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:45:02,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:45:02,268 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:45:02,269 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-11 19:45:02,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:45:02,318 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-11 19:45:02,320 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:45:02,364 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:45:02,364 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:45:02,448 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:45:02,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408250909] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:45:02,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:45:02,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 12 [2024-09-11 19:45:02,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588653514] [2024-09-11 19:45:02,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:45:02,450 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-11 19:45:02,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:45:02,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-11 19:45:02,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-09-11 19:45:02,454 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-11 19:45:02,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:45:02,617 INFO L93 Difference]: Finished difference Result 124 states and 152 transitions. [2024-09-11 19:45:02,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-11 19:45:02,618 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2024-09-11 19:45:02,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:45:02,619 INFO L225 Difference]: With dead ends: 124 [2024-09-11 19:45:02,620 INFO L226 Difference]: Without dead ends: 117 [2024-09-11 19:45:02,622 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-09-11 19:45:02,623 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 77 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:45:02,624 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 116 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:45:02,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-09-11 19:45:02,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 105. [2024-09-11 19:45:02,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 82 states have (on average 1.329268292682927) internal successors, (109), 86 states have internal predecessors, (109), 13 states have call successors, (13), 9 states have call predecessors, (13), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-11 19:45:02,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 131 transitions. [2024-09-11 19:45:02,657 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 131 transitions. Word has length 19 [2024-09-11 19:45:02,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:45:02,658 INFO L474 AbstractCegarLoop]: Abstraction has 105 states and 131 transitions. [2024-09-11 19:45:02,658 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-11 19:45:02,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:45:02,658 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 131 transitions. [2024-09-11 19:45:02,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-11 19:45:02,659 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:45:02,659 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:45:02,678 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-11 19:45:02,859 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:45:02,860 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:45:02,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:45:02,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1008431016, now seen corresponding path program 1 times [2024-09-11 19:45:02,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:45:02,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503445717] [2024-09-11 19:45:02,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:45:02,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:45:02,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:45:03,029 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:45:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:45:03,041 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:45:03,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:45:03,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503445717] [2024-09-11 19:45:03,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503445717] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:45:03,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:45:03,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-11 19:45:03,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510727771] [2024-09-11 19:45:03,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:45:03,043 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-11 19:45:03,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:45:03,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-11 19:45:03,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:45:03,044 INFO L87 Difference]: Start difference. First operand 105 states and 131 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 19:45:03,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:45:03,084 INFO L93 Difference]: Finished difference Result 175 states and 214 transitions. [2024-09-11 19:45:03,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-11 19:45:03,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-09-11 19:45:03,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:45:03,086 INFO L225 Difference]: With dead ends: 175 [2024-09-11 19:45:03,087 INFO L226 Difference]: Without dead ends: 86 [2024-09-11 19:45:03,087 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:45:03,091 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:45:03,091 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:45:03,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-09-11 19:45:03,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-09-11 19:45:03,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 71 states have internal predecessors, (90), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-11 19:45:03,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 107 transitions. [2024-09-11 19:45:03,118 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 107 transitions. Word has length 19 [2024-09-11 19:45:03,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:45:03,119 INFO L474 AbstractCegarLoop]: Abstraction has 86 states and 107 transitions. [2024-09-11 19:45:03,119 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 19:45:03,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:45:03,120 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 107 transitions. [2024-09-11 19:45:03,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-11 19:45:03,121 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:45:03,121 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:45:03,121 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-11 19:45:03,122 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:45:03,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:45:03,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1211901843, now seen corresponding path program 1 times [2024-09-11 19:45:03,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:45:03,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089384698] [2024-09-11 19:45:03,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:45:03,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:45:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:45:03,209 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-11 19:45:03,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:45:03,213 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-11 19:45:03,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:45:03,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089384698] [2024-09-11 19:45:03,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089384698] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:45:03,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711581186] [2024-09-11 19:45:03,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:45:03,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:45:03,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:45:03,218 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:45:03,220 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-11 19:45:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:45:03,263 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-11 19:45:03,264 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:45:03,283 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-11 19:45:03,284 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:45:03,327 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-11 19:45:03,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711581186] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:45:03,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:45:03,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 10 [2024-09-11 19:45:03,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115860624] [2024-09-11 19:45:03,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:45:03,328 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-11 19:45:03,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:45:03,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-11 19:45:03,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-09-11 19:45:03,329 INFO L87 Difference]: Start difference. First operand 86 states and 107 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 19:45:03,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:45:03,393 INFO L93 Difference]: Finished difference Result 156 states and 190 transitions. [2024-09-11 19:45:03,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-11 19:45:03,397 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-09-11 19:45:03,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:45:03,398 INFO L225 Difference]: With dead ends: 156 [2024-09-11 19:45:03,399 INFO L226 Difference]: Without dead ends: 86 [2024-09-11 19:45:03,399 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-09-11 19:45:03,400 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 13 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:45:03,400 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 97 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:45:03,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-09-11 19:45:03,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-09-11 19:45:03,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 71 states have internal predecessors, (87), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-11 19:45:03,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 104 transitions. [2024-09-11 19:45:03,427 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 104 transitions. Word has length 21 [2024-09-11 19:45:03,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:45:03,427 INFO L474 AbstractCegarLoop]: Abstraction has 86 states and 104 transitions. [2024-09-11 19:45:03,429 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 19:45:03,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:45:03,430 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2024-09-11 19:45:03,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-11 19:45:03,430 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:45:03,430 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:45:03,448 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-11 19:45:03,631 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-11 19:45:03,632 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:45:03,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:45:03,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1424589502, now seen corresponding path program 1 times [2024-09-11 19:45:03,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:45:03,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668484077] [2024-09-11 19:45:03,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:45:03,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:45:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 19:45:03,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1864731512] [2024-09-11 19:45:03,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:45:03,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:45:03,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:45:03,667 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:45:03,668 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-11 19:45:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:45:03,766 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-11 19:45:03,768 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:45:03,935 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-11 19:45:03,935 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:45:14,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:45:14,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668484077] [2024-09-11 19:45:14,869 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 19:45:14,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864731512] [2024-09-11 19:45:14,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864731512] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:45:14,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-11 19:45:14,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-09-11 19:45:14,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112814516] [2024-09-11 19:45:14,872 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-11 19:45:14,872 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-11 19:45:14,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:45:14,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-11 19:45:14,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=145, Unknown=2, NotChecked=0, Total=182 [2024-09-11 19:45:14,873 INFO L87 Difference]: Start difference. First operand 86 states and 104 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 19:45:14,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:45:14,981 INFO L93 Difference]: Finished difference Result 108 states and 130 transitions. [2024-09-11 19:45:14,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-11 19:45:14,981 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-09-11 19:45:14,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:45:14,983 INFO L225 Difference]: With dead ends: 108 [2024-09-11 19:45:14,983 INFO L226 Difference]: Without dead ends: 103 [2024-09-11 19:45:14,983 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=42, Invalid=166, Unknown=2, NotChecked=0, Total=210 [2024-09-11 19:45:14,985 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 13 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:45:14,985 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 83 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:45:14,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-09-11 19:45:15,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 91. [2024-09-11 19:45:15,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 72 states have (on average 1.2083333333333333) internal successors, (87), 74 states have internal predecessors, (87), 10 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-11 19:45:15,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 105 transitions. [2024-09-11 19:45:15,008 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 105 transitions. Word has length 22 [2024-09-11 19:45:15,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:45:15,008 INFO L474 AbstractCegarLoop]: Abstraction has 91 states and 105 transitions. [2024-09-11 19:45:15,008 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 19:45:15,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:45:15,009 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 105 transitions. [2024-09-11 19:45:15,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-11 19:45:15,010 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:45:15,010 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-09-11 19:45:15,017 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-11 19:45:15,210 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:45:15,211 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:45:15,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:45:15,212 INFO L85 PathProgramCache]: Analyzing trace with hash 334382651, now seen corresponding path program 2 times [2024-09-11 19:45:15,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:45:15,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189666402] [2024-09-11 19:45:15,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:45:15,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:45:15,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:45:15,568 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-11 19:45:15,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:45:15,576 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-11 19:45:15,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:45:15,581 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:45:15,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:45:15,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189666402] [2024-09-11 19:45:15,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189666402] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:45:15,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467743233] [2024-09-11 19:45:15,582 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 19:45:15,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:45:15,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:45:15,584 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:45:15,586 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-11 19:45:15,654 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 19:45:15,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:45:15,657 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-11 19:45:15,659 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:45:15,800 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:45:15,801 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:45:16,027 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:45:16,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467743233] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:45:16,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:45:16,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 15 [2024-09-11 19:45:16,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67273326] [2024-09-11 19:45:16,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:45:16,028 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-11 19:45:16,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:45:16,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-11 19:45:16,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-09-11 19:45:16,029 INFO L87 Difference]: Start difference. First operand 91 states and 105 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-11 19:45:16,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:45:16,176 INFO L93 Difference]: Finished difference Result 151 states and 175 transitions. [2024-09-11 19:45:16,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-11 19:45:16,176 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 31 [2024-09-11 19:45:16,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:45:16,177 INFO L225 Difference]: With dead ends: 151 [2024-09-11 19:45:16,177 INFO L226 Difference]: Without dead ends: 75 [2024-09-11 19:45:16,178 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-09-11 19:45:16,178 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:45:16,179 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 155 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:45:16,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-09-11 19:45:16,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 64. [2024-09-11 19:45:16,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 53 states have internal predecessors, (62), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-11 19:45:16,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2024-09-11 19:45:16,192 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 31 [2024-09-11 19:45:16,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:45:16,192 INFO L474 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2024-09-11 19:45:16,192 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-11 19:45:16,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:45:16,192 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2024-09-11 19:45:16,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-11 19:45:16,193 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:45:16,193 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-09-11 19:45:16,209 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-11 19:45:16,397 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:45:16,398 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:45:16,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:45:16,399 INFO L85 PathProgramCache]: Analyzing trace with hash -2023611355, now seen corresponding path program 3 times [2024-09-11 19:45:16,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:45:16,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728646462] [2024-09-11 19:45:16,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:45:16,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:45:16,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 19:45:16,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1909498528] [2024-09-11 19:45:16,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-11 19:45:16,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:45:16,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:45:16,449 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:45:16,450 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-11 19:45:17,818 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-11 19:45:17,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:45:17,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-09-11 19:45:17,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:45:18,337 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:45:18,337 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:46:18,900 WARN L293 SmtUtils]: Spent 9.10s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 19:46:39,967 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:46:39,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:46:39,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728646462] [2024-09-11 19:46:39,968 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 19:46:39,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909498528] [2024-09-11 19:46:39,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909498528] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:46:39,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 19:46:39,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2024-09-11 19:46:39,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004199794] [2024-09-11 19:46:39,968 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 19:46:39,968 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-11 19:46:39,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:46:39,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-11 19:46:39,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2024-09-11 19:46:39,970 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 21 states have internal predecessors, (50), 6 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-11 19:46:49,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:46:53,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:46:57,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:47:01,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:47:19,758 WARN L293 SmtUtils]: Spent 12.80s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 19:47:25,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:47:29,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:48:00,902 WARN L293 SmtUtils]: Spent 26.88s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 19:48:04,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:48:11,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:48:44,968 WARN L293 SmtUtils]: Spent 23.54s on a formula simplification. DAG size of input: 55 DAG size of output: 27 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)