./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.toy_lock_4.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.toy_lock_4.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 64bit --witnessprinter.graph.data.programhash dc77f8e7fc201c8766f52fe3e014d6c5c37e220387f85127552a419acc9259b5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 00:49:21,511 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 00:49:21,595 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-12 00:49:21,600 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 00:49:21,602 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 00:49:21,633 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 00:49:21,635 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 00:49:21,635 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 00:49:21,636 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 00:49:21,637 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 00:49:21,638 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 00:49:21,638 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 00:49:21,639 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 00:49:21,639 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 00:49:21,640 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 00:49:21,641 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 00:49:21,642 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 00:49:21,642 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 00:49:21,642 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 00:49:21,643 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 00:49:21,643 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 00:49:21,648 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 00:49:21,648 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 00:49:21,649 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 00:49:21,649 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 00:49:21,649 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 00:49:21,649 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 00:49:21,650 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 00:49:21,650 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 00:49:21,650 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:49:21,650 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 00:49:21,650 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 00:49:21,650 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 00:49:21,651 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 00:49:21,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 00:49:21,651 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 00:49:21,651 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 00:49:21,651 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 00:49:21,652 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 00:49:21,665 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/ultimate/releaseScripts/default/UAutomizer-linux/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/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dc77f8e7fc201c8766f52fe3e014d6c5c37e220387f85127552a419acc9259b5 [2024-11-12 00:49:21,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 00:49:21,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 00:49:21,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 00:49:21,908 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 00:49:21,909 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 00:49:21,910 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.toy_lock_4.c [2024-11-12 00:49:23,300 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 00:49:23,500 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 00:49:23,501 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.toy_lock_4.c [2024-11-12 00:49:23,521 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99b1cd438/a9fb0497bb9343be89f62fef0f51d282/FLAG8e59764e1 [2024-11-12 00:49:23,542 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99b1cd438/a9fb0497bb9343be89f62fef0f51d282 [2024-11-12 00:49:23,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 00:49:23,545 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 00:49:23,546 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 00:49:23,546 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 00:49:23,558 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 00:49:23,558 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:49:23" (1/1) ... [2024-11-12 00:49:23,559 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@432984b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:23, skipping insertion in model container [2024-11-12 00:49:23,559 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:49:23" (1/1) ... [2024-11-12 00:49:23,597 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 00:49:23,761 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.toy_lock_4.c[1250,1263] [2024-11-12 00:49:23,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:49:23,958 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 00:49:23,970 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.toy_lock_4.c[1250,1263] [2024-11-12 00:49:24,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:49:24,060 INFO L204 MainTranslator]: Completed translation [2024-11-12 00:49:24,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:24 WrapperNode [2024-11-12 00:49:24,060 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 00:49:24,061 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 00:49:24,061 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 00:49:24,061 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 00:49:24,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:24" (1/1) ... [2024-11-12 00:49:24,093 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:24" (1/1) ... [2024-11-12 00:49:24,189 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1372 [2024-11-12 00:49:24,189 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 00:49:24,190 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 00:49:24,190 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 00:49:24,190 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 00:49:24,202 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:24" (1/1) ... [2024-11-12 00:49:24,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:24" (1/1) ... [2024-11-12 00:49:24,287 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:24" (1/1) ... [2024-11-12 00:49:24,369 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-11-12 00:49:24,370 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:24" (1/1) ... [2024-11-12 00:49:24,370 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:24" (1/1) ... [2024-11-12 00:49:24,407 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:24" (1/1) ... [2024-11-12 00:49:24,421 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:24" (1/1) ... [2024-11-12 00:49:24,433 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:24" (1/1) ... [2024-11-12 00:49:24,444 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:24" (1/1) ... [2024-11-12 00:49:24,462 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 00:49:24,463 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 00:49:24,464 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 00:49:24,464 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 00:49:24,464 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:24" (1/1) ... [2024-11-12 00:49:24,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:49:24,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:49:24,492 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 00:49:24,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 00:49:24,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 00:49:24,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 00:49:24,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 00:49:24,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 00:49:24,714 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 00:49:24,716 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 00:49:26,352 INFO L? ?]: Removed 948 outVars from TransFormulas that were not future-live. [2024-11-12 00:49:26,353 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 00:49:26,378 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 00:49:26,382 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 00:49:26,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:49:26 BoogieIcfgContainer [2024-11-12 00:49:26,383 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 00:49:26,385 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 00:49:26,385 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 00:49:26,388 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 00:49:26,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:49:23" (1/3) ... [2024-11-12 00:49:26,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5537e1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:49:26, skipping insertion in model container [2024-11-12 00:49:26,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:49:24" (2/3) ... [2024-11-12 00:49:26,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5537e1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:49:26, skipping insertion in model container [2024-11-12 00:49:26,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:49:26" (3/3) ... [2024-11-12 00:49:26,394 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.toy_lock_4.c [2024-11-12 00:49:26,415 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 00:49:26,415 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 00:49:26,473 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 00:49:26,480 INFO L333 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=LoopHeads, 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;@3ae600d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 00:49:26,480 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 00:49:26,486 INFO L276 IsEmpty]: Start isEmpty. Operand has 246 states, 244 states have (on average 1.4959016393442623) internal successors, (365), 245 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:26,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-12 00:49:26,495 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:49:26,496 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:49:26,497 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:49:26,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:49:26,504 INFO L85 PathProgramCache]: Analyzing trace with hash 162291155, now seen corresponding path program 1 times [2024-11-12 00:49:26,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:49:26,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471738886] [2024-11-12 00:49:26,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:49:26,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:49:26,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:49:27,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:49:27,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:49:27,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471738886] [2024-11-12 00:49:27,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471738886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:49:27,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:49:27,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:49:27,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892487037] [2024-11-12 00:49:27,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:49:27,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:49:27,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:49:27,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:49:27,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:49:27,338 INFO L87 Difference]: Start difference. First operand has 246 states, 244 states have (on average 1.4959016393442623) internal successors, (365), 245 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:27,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:49:27,414 INFO L93 Difference]: Finished difference Result 425 states and 633 transitions. [2024-11-12 00:49:27,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:49:27,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-11-12 00:49:27,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:49:27,428 INFO L225 Difference]: With dead ends: 425 [2024-11-12 00:49:27,428 INFO L226 Difference]: Without dead ends: 245 [2024-11-12 00:49:27,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-11-12 00:49:27,434 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 0 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:49:27,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1071 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:49:27,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-12 00:49:27,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2024-11-12 00:49:27,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 1.4877049180327868) internal successors, (363), 244 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:27,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 363 transitions. [2024-11-12 00:49:27,479 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 363 transitions. Word has length 75 [2024-11-12 00:49:27,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:49:27,480 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 363 transitions. [2024-11-12 00:49:27,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:27,481 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 363 transitions. [2024-11-12 00:49:27,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-12 00:49:27,482 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:49:27,483 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:49:27,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 00:49:27,483 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:49:27,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:49:27,484 INFO L85 PathProgramCache]: Analyzing trace with hash 737754117, now seen corresponding path program 1 times [2024-11-12 00:49:27,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:49:27,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922139126] [2024-11-12 00:49:27,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:49:27,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:49:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:49:27,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:49:27,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:49:27,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922139126] [2024-11-12 00:49:27,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922139126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:49:27,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:49:27,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:49:27,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786088871] [2024-11-12 00:49:27,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:49:27,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:49:27,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:49:27,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:49:27,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:49:27,770 INFO L87 Difference]: Start difference. First operand 245 states and 363 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:27,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:49:27,807 INFO L93 Difference]: Finished difference Result 426 states and 631 transitions. [2024-11-12 00:49:27,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:49:27,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-12 00:49:27,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:49:27,810 INFO L225 Difference]: With dead ends: 426 [2024-11-12 00:49:27,812 INFO L226 Difference]: Without dead ends: 247 [2024-11-12 00:49:27,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-11-12 00:49:27,813 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 0 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:49:27,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1067 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:49:27,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-12 00:49:27,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2024-11-12 00:49:27,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 1.483739837398374) internal successors, (365), 246 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:27,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 365 transitions. [2024-11-12 00:49:27,831 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 365 transitions. Word has length 76 [2024-11-12 00:49:27,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:49:27,832 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 365 transitions. [2024-11-12 00:49:27,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:27,832 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 365 transitions. [2024-11-12 00:49:27,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-12 00:49:27,833 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:49:27,834 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:49:27,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 00:49:27,834 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:49:27,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:49:27,834 INFO L85 PathProgramCache]: Analyzing trace with hash 297575660, now seen corresponding path program 1 times [2024-11-12 00:49:27,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:49:27,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704488677] [2024-11-12 00:49:27,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:49:27,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:49:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:49:28,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:49:28,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:49:28,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704488677] [2024-11-12 00:49:28,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704488677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:49:28,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:49:28,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:49:28,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423540002] [2024-11-12 00:49:28,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:49:28,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:49:28,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:49:28,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:49:28,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:49:28,202 INFO L87 Difference]: Start difference. First operand 247 states and 365 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:28,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:49:28,266 INFO L93 Difference]: Finished difference Result 432 states and 638 transitions. [2024-11-12 00:49:28,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:49:28,267 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-12 00:49:28,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:49:28,268 INFO L225 Difference]: With dead ends: 432 [2024-11-12 00:49:28,268 INFO L226 Difference]: Without dead ends: 251 [2024-11-12 00:49:28,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-12 00:49:28,270 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 298 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:49:28,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 1048 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:49:28,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-12 00:49:28,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2024-11-12 00:49:28,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 1.4779116465863453) internal successors, (368), 249 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:28,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 368 transitions. [2024-11-12 00:49:28,281 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 368 transitions. Word has length 77 [2024-11-12 00:49:28,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:49:28,281 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 368 transitions. [2024-11-12 00:49:28,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:28,282 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 368 transitions. [2024-11-12 00:49:28,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-12 00:49:28,283 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:49:28,283 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:49:28,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 00:49:28,283 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:49:28,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:49:28,284 INFO L85 PathProgramCache]: Analyzing trace with hash -2095510872, now seen corresponding path program 1 times [2024-11-12 00:49:28,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:49:28,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742387303] [2024-11-12 00:49:28,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:49:28,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:49:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:49:29,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:49:29,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:49:29,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742387303] [2024-11-12 00:49:29,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742387303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:49:29,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:49:29,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 00:49:29,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336054951] [2024-11-12 00:49:29,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:49:29,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 00:49:29,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:49:29,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 00:49:29,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-12 00:49:29,563 INFO L87 Difference]: Start difference. First operand 250 states and 368 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:31,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 00:49:32,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:49:32,882 INFO L93 Difference]: Finished difference Result 534 states and 782 transitions. [2024-11-12 00:49:32,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 00:49:32,883 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-12 00:49:32,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:49:32,885 INFO L225 Difference]: With dead ends: 534 [2024-11-12 00:49:32,886 INFO L226 Difference]: Without dead ends: 350 [2024-11-12 00:49:32,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-12 00:49:32,887 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 455 mSDsluCounter, 1558 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 1894 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-12 00:49:32,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 1894 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-12 00:49:32,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-12 00:49:32,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 282. [2024-11-12 00:49:32,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.480427046263345) internal successors, (416), 281 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:32,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 416 transitions. [2024-11-12 00:49:32,895 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 416 transitions. Word has length 78 [2024-11-12 00:49:32,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:49:32,896 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 416 transitions. [2024-11-12 00:49:32,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:32,896 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 416 transitions. [2024-11-12 00:49:32,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-12 00:49:32,897 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:49:32,897 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:49:32,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 00:49:32,897 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:49:32,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:49:32,898 INFO L85 PathProgramCache]: Analyzing trace with hash -921316368, now seen corresponding path program 1 times [2024-11-12 00:49:32,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:49:32,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755362863] [2024-11-12 00:49:32,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:49:32,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:49:32,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:49:33,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:49:33,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:49:33,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755362863] [2024-11-12 00:49:33,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755362863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:49:33,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:49:33,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 00:49:33,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958907627] [2024-11-12 00:49:33,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:49:33,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 00:49:33,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:49:33,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 00:49:33,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:49:33,408 INFO L87 Difference]: Start difference. First operand 282 states and 416 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:34,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:49:34,657 INFO L93 Difference]: Finished difference Result 535 states and 782 transitions. [2024-11-12 00:49:34,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 00:49:34,658 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-12 00:49:34,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:49:34,659 INFO L225 Difference]: With dead ends: 535 [2024-11-12 00:49:34,659 INFO L226 Difference]: Without dead ends: 349 [2024-11-12 00:49:34,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-12 00:49:34,660 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 582 mSDsluCounter, 1709 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 2053 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-12 00:49:34,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 2053 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-12 00:49:34,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-11-12 00:49:34,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 288. [2024-11-12 00:49:34,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 1.4668989547038327) internal successors, (421), 287 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:34,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 421 transitions. [2024-11-12 00:49:34,666 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 421 transitions. Word has length 79 [2024-11-12 00:49:34,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:49:34,666 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 421 transitions. [2024-11-12 00:49:34,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:34,667 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 421 transitions. [2024-11-12 00:49:34,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-12 00:49:34,668 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:49:34,668 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:49:34,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 00:49:34,668 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:49:34,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:49:34,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1030822837, now seen corresponding path program 1 times [2024-11-12 00:49:34,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:49:34,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427763706] [2024-11-12 00:49:34,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:49:34,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:49:34,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:49:35,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:49:35,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:49:35,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427763706] [2024-11-12 00:49:35,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427763706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:49:35,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:49:35,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:49:35,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37531818] [2024-11-12 00:49:35,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:49:35,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:49:35,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:49:35,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:49:35,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:49:35,044 INFO L87 Difference]: Start difference. First operand 288 states and 421 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:35,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:49:35,061 INFO L93 Difference]: Finished difference Result 471 states and 690 transitions. [2024-11-12 00:49:35,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:49:35,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-12 00:49:35,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:49:35,063 INFO L225 Difference]: With dead ends: 471 [2024-11-12 00:49:35,063 INFO L226 Difference]: Without dead ends: 281 [2024-11-12 00:49:35,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:49:35,064 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 0 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:49:35,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1062 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:49:35,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-12 00:49:35,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2024-11-12 00:49:35,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 1.4678571428571427) internal successors, (411), 280 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:35,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 411 transitions. [2024-11-12 00:49:35,069 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 411 transitions. Word has length 80 [2024-11-12 00:49:35,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:49:35,069 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 411 transitions. [2024-11-12 00:49:35,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:35,069 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 411 transitions. [2024-11-12 00:49:35,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-12 00:49:35,070 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:49:35,070 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:49:35,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 00:49:35,070 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:49:35,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:49:35,070 INFO L85 PathProgramCache]: Analyzing trace with hash -850213898, now seen corresponding path program 1 times [2024-11-12 00:49:35,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:49:35,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787688216] [2024-11-12 00:49:35,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:49:35,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:49:35,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:49:35,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:49:35,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:49:35,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787688216] [2024-11-12 00:49:35,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787688216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:49:35,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:49:35,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 00:49:35,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982797988] [2024-11-12 00:49:35,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:49:35,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 00:49:35,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:49:35,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 00:49:35,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:49:35,486 INFO L87 Difference]: Start difference. First operand 281 states and 411 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:38,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 00:49:38,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:49:38,199 INFO L93 Difference]: Finished difference Result 524 states and 762 transitions. [2024-11-12 00:49:38,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 00:49:38,200 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-12 00:49:38,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:49:38,201 INFO L225 Difference]: With dead ends: 524 [2024-11-12 00:49:38,201 INFO L226 Difference]: Without dead ends: 339 [2024-11-12 00:49:38,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-12 00:49:38,202 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 551 mSDsluCounter, 1700 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 2043 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-12 00:49:38,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 2043 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-12 00:49:38,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-11-12 00:49:38,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 281. [2024-11-12 00:49:38,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 1.4642857142857142) internal successors, (410), 280 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:38,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 410 transitions. [2024-11-12 00:49:38,207 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 410 transitions. Word has length 80 [2024-11-12 00:49:38,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:49:38,207 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 410 transitions. [2024-11-12 00:49:38,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:38,208 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 410 transitions. [2024-11-12 00:49:38,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-12 00:49:38,208 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:49:38,209 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:49:38,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 00:49:38,209 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:49:38,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:49:38,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1776344937, now seen corresponding path program 1 times [2024-11-12 00:49:38,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:49:38,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223501143] [2024-11-12 00:49:38,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:49:38,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:49:38,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:49:38,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:49:38,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:49:38,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223501143] [2024-11-12 00:49:38,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223501143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:49:38,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:49:38,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:49:38,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185348025] [2024-11-12 00:49:38,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:49:38,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:49:38,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:49:38,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:49:38,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:49:38,808 INFO L87 Difference]: Start difference. First operand 281 states and 410 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:41,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 00:49:42,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:49:42,387 INFO L93 Difference]: Finished difference Result 530 states and 771 transitions. [2024-11-12 00:49:42,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:49:42,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-12 00:49:42,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:49:42,388 INFO L225 Difference]: With dead ends: 530 [2024-11-12 00:49:42,389 INFO L226 Difference]: Without dead ends: 347 [2024-11-12 00:49:42,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 00:49:42,390 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 431 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-12 00:49:42,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 1028 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-12 00:49:42,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-12 00:49:42,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 293. [2024-11-12 00:49:42,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 292 states have (on average 1.4623287671232876) internal successors, (427), 292 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:42,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 427 transitions. [2024-11-12 00:49:42,394 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 427 transitions. Word has length 81 [2024-11-12 00:49:42,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:49:42,395 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 427 transitions. [2024-11-12 00:49:42,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:42,395 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 427 transitions. [2024-11-12 00:49:42,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-12 00:49:42,396 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:49:42,396 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:49:42,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 00:49:42,396 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:49:42,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:49:42,396 INFO L85 PathProgramCache]: Analyzing trace with hash -516361852, now seen corresponding path program 1 times [2024-11-12 00:49:42,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:49:42,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63954503] [2024-11-12 00:49:42,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:49:42,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:49:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:49:43,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:49:43,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:49:43,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63954503] [2024-11-12 00:49:43,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63954503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:49:43,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:49:43,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 00:49:43,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621828958] [2024-11-12 00:49:43,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:49:43,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 00:49:43,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:49:43,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 00:49:43,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-12 00:49:43,194 INFO L87 Difference]: Start difference. First operand 293 states and 427 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:44,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 00:49:45,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 00:49:45,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:49:45,925 INFO L93 Difference]: Finished difference Result 532 states and 772 transitions. [2024-11-12 00:49:45,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 00:49:45,926 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-12 00:49:45,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:49:45,927 INFO L225 Difference]: With dead ends: 532 [2024-11-12 00:49:45,927 INFO L226 Difference]: Without dead ends: 347 [2024-11-12 00:49:45,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-12 00:49:45,929 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 437 mSDsluCounter, 1533 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1867 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-12 00:49:45,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 1867 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-12 00:49:45,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-12 00:49:45,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 297. [2024-11-12 00:49:45,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 1.4594594594594594) internal successors, (432), 296 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:45,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 432 transitions. [2024-11-12 00:49:45,935 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 432 transitions. Word has length 82 [2024-11-12 00:49:45,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:49:45,935 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 432 transitions. [2024-11-12 00:49:45,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:45,935 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 432 transitions. [2024-11-12 00:49:45,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-12 00:49:45,936 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:49:45,936 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:49:45,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 00:49:45,936 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:49:45,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:49:45,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1175553431, now seen corresponding path program 1 times [2024-11-12 00:49:45,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:49:45,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070171111] [2024-11-12 00:49:45,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:49:45,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:49:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:49:46,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:49:46,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:49:46,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070171111] [2024-11-12 00:49:46,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070171111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:49:46,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:49:46,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 00:49:46,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303901458] [2024-11-12 00:49:46,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:49:46,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 00:49:46,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:49:46,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 00:49:46,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:49:46,248 INFO L87 Difference]: Start difference. First operand 297 states and 432 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:46,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:49:46,301 INFO L93 Difference]: Finished difference Result 498 states and 725 transitions. [2024-11-12 00:49:46,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 00:49:46,302 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-12 00:49:46,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:49:46,303 INFO L225 Difference]: With dead ends: 498 [2024-11-12 00:49:46,303 INFO L226 Difference]: Without dead ends: 313 [2024-11-12 00:49:46,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:49:46,304 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 7 mSDsluCounter, 1396 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1748 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:49:46,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1748 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:49:46,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-12 00:49:46,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 303. [2024-11-12 00:49:46,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 1.4602649006622517) internal successors, (441), 302 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:46,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 441 transitions. [2024-11-12 00:49:46,311 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 441 transitions. Word has length 83 [2024-11-12 00:49:46,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:49:46,311 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 441 transitions. [2024-11-12 00:49:46,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:46,311 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 441 transitions. [2024-11-12 00:49:46,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-12 00:49:46,312 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:49:46,312 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:49:46,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 00:49:46,312 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:49:46,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:49:46,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1571245840, now seen corresponding path program 1 times [2024-11-12 00:49:46,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:49:46,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658862707] [2024-11-12 00:49:46,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:49:46,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:49:46,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:49:46,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:49:46,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:49:46,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658862707] [2024-11-12 00:49:46,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658862707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:49:46,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:49:46,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 00:49:46,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864900816] [2024-11-12 00:49:46,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:49:46,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 00:49:46,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:49:46,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 00:49:46,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:49:46,581 INFO L87 Difference]: Start difference. First operand 303 states and 441 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:46,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:49:46,646 INFO L93 Difference]: Finished difference Result 502 states and 731 transitions. [2024-11-12 00:49:46,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 00:49:46,647 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-12 00:49:46,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:49:46,648 INFO L225 Difference]: With dead ends: 502 [2024-11-12 00:49:46,648 INFO L226 Difference]: Without dead ends: 314 [2024-11-12 00:49:46,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:49:46,649 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 6 mSDsluCounter, 2074 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2423 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:49:46,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2423 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:49:46,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-11-12 00:49:46,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 310. [2024-11-12 00:49:46,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 1.4563106796116505) internal successors, (450), 309 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:46,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 450 transitions. [2024-11-12 00:49:46,653 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 450 transitions. Word has length 83 [2024-11-12 00:49:46,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:49:46,654 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 450 transitions. [2024-11-12 00:49:46,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:46,654 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 450 transitions. [2024-11-12 00:49:46,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-12 00:49:46,654 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:49:46,655 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:49:46,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 00:49:46,655 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:49:46,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:49:46,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1891939205, now seen corresponding path program 1 times [2024-11-12 00:49:46,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:49:46,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471688396] [2024-11-12 00:49:46,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:49:46,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:49:46,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:49:47,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:49:47,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:49:47,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471688396] [2024-11-12 00:49:47,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471688396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:49:47,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:49:47,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 00:49:47,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918047917] [2024-11-12 00:49:47,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:49:47,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 00:49:47,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:49:47,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 00:49:47,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-12 00:49:47,206 INFO L87 Difference]: Start difference. First operand 310 states and 450 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:47,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:49:47,280 INFO L93 Difference]: Finished difference Result 518 states and 752 transitions. [2024-11-12 00:49:47,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 00:49:47,281 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-12 00:49:47,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:49:47,283 INFO L225 Difference]: With dead ends: 518 [2024-11-12 00:49:47,283 INFO L226 Difference]: Without dead ends: 312 [2024-11-12 00:49:47,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-12 00:49:47,284 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 1 mSDsluCounter, 2075 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2424 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:49:47,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2424 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:49:47,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-12 00:49:47,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2024-11-12 00:49:47,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 311 states have (on average 1.45016077170418) internal successors, (451), 311 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:47,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 451 transitions. [2024-11-12 00:49:47,288 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 451 transitions. Word has length 83 [2024-11-12 00:49:47,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:49:47,289 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 451 transitions. [2024-11-12 00:49:47,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:47,289 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 451 transitions. [2024-11-12 00:49:47,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-12 00:49:47,289 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:49:47,290 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:49:47,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 00:49:47,290 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:49:47,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:49:47,290 INFO L85 PathProgramCache]: Analyzing trace with hash -2116588223, now seen corresponding path program 1 times [2024-11-12 00:49:47,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:49:47,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762495485] [2024-11-12 00:49:47,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:49:47,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:49:47,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:49:47,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:49:47,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:49:47,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762495485] [2024-11-12 00:49:47,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762495485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:49:47,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:49:47,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 00:49:47,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679843068] [2024-11-12 00:49:47,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:49:47,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 00:49:47,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:49:47,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 00:49:47,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:49:47,981 INFO L87 Difference]: Start difference. First operand 312 states and 451 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:48,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:49:48,084 INFO L93 Difference]: Finished difference Result 520 states and 753 transitions. [2024-11-12 00:49:48,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 00:49:48,085 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2024-11-12 00:49:48,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:49:48,086 INFO L225 Difference]: With dead ends: 520 [2024-11-12 00:49:48,086 INFO L226 Difference]: Without dead ends: 319 [2024-11-12 00:49:48,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:49:48,088 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 3 mSDsluCounter, 1729 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:49:48,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2079 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:49:48,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-12 00:49:48,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 311. [2024-11-12 00:49:48,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 310 states have (on average 1.4483870967741936) internal successors, (449), 310 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:48,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 449 transitions. [2024-11-12 00:49:48,093 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 449 transitions. Word has length 84 [2024-11-12 00:49:48,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:49:48,093 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 449 transitions. [2024-11-12 00:49:48,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:48,093 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 449 transitions. [2024-11-12 00:49:48,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-12 00:49:48,093 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:49:48,093 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:49:48,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 00:49:48,094 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:49:48,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:49:48,094 INFO L85 PathProgramCache]: Analyzing trace with hash 581887396, now seen corresponding path program 1 times [2024-11-12 00:49:48,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:49:48,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589640534] [2024-11-12 00:49:48,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:49:48,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:49:48,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:49:48,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:49:48,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:49:48,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589640534] [2024-11-12 00:49:48,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589640534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:49:48,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:49:48,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 00:49:48,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056173203] [2024-11-12 00:49:48,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:49:48,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 00:49:48,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:49:48,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 00:49:48,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:49:48,489 INFO L87 Difference]: Start difference. First operand 311 states and 449 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:49,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 00:49:51,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 00:49:52,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:49:52,542 INFO L93 Difference]: Finished difference Result 570 states and 818 transitions. [2024-11-12 00:49:52,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 00:49:52,543 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2024-11-12 00:49:52,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:49:52,544 INFO L225 Difference]: With dead ends: 570 [2024-11-12 00:49:52,544 INFO L226 Difference]: Without dead ends: 359 [2024-11-12 00:49:52,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-12 00:49:52,545 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 531 mSDsluCounter, 1361 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 1704 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:49:52,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 1704 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-12 00:49:52,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-11-12 00:49:52,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 310. [2024-11-12 00:49:52,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 1.4433656957928802) internal successors, (446), 309 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:52,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 446 transitions. [2024-11-12 00:49:52,549 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 446 transitions. Word has length 84 [2024-11-12 00:49:52,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:49:52,550 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 446 transitions. [2024-11-12 00:49:52,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:52,550 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 446 transitions. [2024-11-12 00:49:52,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-12 00:49:52,550 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:49:52,551 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:49:52,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 00:49:52,551 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:49:52,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:49:52,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1280130825, now seen corresponding path program 1 times [2024-11-12 00:49:52,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:49:52,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290232587] [2024-11-12 00:49:52,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:49:52,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:49:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:49:53,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:49:53,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:49:53,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290232587] [2024-11-12 00:49:53,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290232587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:49:53,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:49:53,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 00:49:53,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347257548] [2024-11-12 00:49:53,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:49:53,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 00:49:53,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:49:53,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 00:49:53,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-12 00:49:53,095 INFO L87 Difference]: Start difference. First operand 310 states and 446 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:54,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 00:49:54,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:49:54,901 INFO L93 Difference]: Finished difference Result 575 states and 828 transitions. [2024-11-12 00:49:54,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 00:49:54,901 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-11-12 00:49:54,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:49:54,902 INFO L225 Difference]: With dead ends: 575 [2024-11-12 00:49:54,902 INFO L226 Difference]: Without dead ends: 375 [2024-11-12 00:49:54,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-12 00:49:54,903 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 431 mSDsluCounter, 1543 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 1877 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-12 00:49:54,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 1877 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-12 00:49:54,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-11-12 00:49:54,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 322. [2024-11-12 00:49:54,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 321 states have (on average 1.442367601246106) internal successors, (463), 321 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:54,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 463 transitions. [2024-11-12 00:49:54,908 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 463 transitions. Word has length 85 [2024-11-12 00:49:54,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:49:54,908 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 463 transitions. [2024-11-12 00:49:54,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:54,909 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 463 transitions. [2024-11-12 00:49:54,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-12 00:49:54,909 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:49:54,909 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:49:54,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 00:49:54,910 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:49:54,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:49:54,910 INFO L85 PathProgramCache]: Analyzing trace with hash 487535251, now seen corresponding path program 1 times [2024-11-12 00:49:54,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:49:54,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27300061] [2024-11-12 00:49:54,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:49:54,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:49:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:49:55,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:49:55,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:49:55,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27300061] [2024-11-12 00:49:55,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27300061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:49:55,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:49:55,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 00:49:55,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682186518] [2024-11-12 00:49:55,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:49:55,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 00:49:55,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:49:55,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 00:49:55,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:49:55,357 INFO L87 Difference]: Start difference. First operand 322 states and 463 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:55,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:49:55,419 INFO L93 Difference]: Finished difference Result 531 states and 767 transitions. [2024-11-12 00:49:55,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 00:49:55,420 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-11-12 00:49:55,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:49:55,421 INFO L225 Difference]: With dead ends: 531 [2024-11-12 00:49:55,421 INFO L226 Difference]: Without dead ends: 331 [2024-11-12 00:49:55,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:49:55,422 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 3 mSDsluCounter, 1714 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2060 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:49:55,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2060 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:49:55,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-11-12 00:49:55,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 324. [2024-11-12 00:49:55,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 1.4396284829721362) internal successors, (465), 323 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:55,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 465 transitions. [2024-11-12 00:49:55,429 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 465 transitions. Word has length 85 [2024-11-12 00:49:55,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:49:55,429 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 465 transitions. [2024-11-12 00:49:55,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:55,430 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 465 transitions. [2024-11-12 00:49:55,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-12 00:49:55,430 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:49:55,431 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:49:55,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 00:49:55,431 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:49:55,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:49:55,431 INFO L85 PathProgramCache]: Analyzing trace with hash -200463628, now seen corresponding path program 1 times [2024-11-12 00:49:55,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:49:55,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230389517] [2024-11-12 00:49:55,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:49:55,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:49:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:49:55,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:49:55,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:49:55,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230389517] [2024-11-12 00:49:55,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230389517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:49:55,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:49:55,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 00:49:55,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419526442] [2024-11-12 00:49:55,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:49:55,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 00:49:55,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:49:55,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 00:49:55,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-12 00:49:55,922 INFO L87 Difference]: Start difference. First operand 324 states and 465 transitions. Second operand has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:56,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:49:56,033 INFO L93 Difference]: Finished difference Result 547 states and 789 transitions. [2024-11-12 00:49:56,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 00:49:56,034 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-11-12 00:49:56,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:49:56,035 INFO L225 Difference]: With dead ends: 547 [2024-11-12 00:49:56,035 INFO L226 Difference]: Without dead ends: 334 [2024-11-12 00:49:56,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-12 00:49:56,036 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 4 mSDsluCounter, 2727 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3071 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:49:56,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3071 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:49:56,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-12 00:49:56,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2024-11-12 00:49:56,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 1.4410876132930515) internal successors, (477), 331 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:56,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 477 transitions. [2024-11-12 00:49:56,040 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 477 transitions. Word has length 85 [2024-11-12 00:49:56,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:49:56,040 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 477 transitions. [2024-11-12 00:49:56,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:56,041 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 477 transitions. [2024-11-12 00:49:56,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-12 00:49:56,042 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:49:56,042 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:49:56,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 00:49:56,042 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:49:56,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:49:56,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1620879275, now seen corresponding path program 1 times [2024-11-12 00:49:56,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:49:56,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058570516] [2024-11-12 00:49:56,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:49:56,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:49:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:49:56,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:49:56,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:49:56,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058570516] [2024-11-12 00:49:56,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058570516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:49:56,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:49:56,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 00:49:56,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305908619] [2024-11-12 00:49:56,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:49:56,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 00:49:56,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:49:56,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 00:49:56,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:49:56,372 INFO L87 Difference]: Start difference. First operand 332 states and 477 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:49:58,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 00:50:00,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:50:00,254 INFO L93 Difference]: Finished difference Result 598 states and 860 transitions. [2024-11-12 00:50:00,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 00:50:00,255 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-11-12 00:50:00,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:50:00,256 INFO L225 Difference]: With dead ends: 598 [2024-11-12 00:50:00,256 INFO L226 Difference]: Without dead ends: 380 [2024-11-12 00:50:00,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-12 00:50:00,257 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 531 mSDsluCounter, 1361 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 1704 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-12 00:50:00,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 1704 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-12 00:50:00,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-11-12 00:50:00,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 336. [2024-11-12 00:50:00,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 1.4358208955223881) internal successors, (481), 335 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:50:00,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 481 transitions. [2024-11-12 00:50:00,261 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 481 transitions. Word has length 86 [2024-11-12 00:50:00,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:50:00,262 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 481 transitions. [2024-11-12 00:50:00,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:50:00,262 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 481 transitions. [2024-11-12 00:50:00,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-12 00:50:00,262 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:50:00,263 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:50:00,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 00:50:00,263 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:50:00,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:50:00,263 INFO L85 PathProgramCache]: Analyzing trace with hash 759999812, now seen corresponding path program 1 times [2024-11-12 00:50:00,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:50:00,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139323750] [2024-11-12 00:50:00,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:50:00,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:50:00,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:50:00,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:50:00,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:50:00,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139323750] [2024-11-12 00:50:00,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139323750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:50:00,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:50:00,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 00:50:00,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137840855] [2024-11-12 00:50:00,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:50:00,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 00:50:00,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:50:00,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 00:50:00,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:50:00,599 INFO L87 Difference]: Start difference. First operand 336 states and 481 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:50:00,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:50:00,644 INFO L93 Difference]: Finished difference Result 562 states and 809 transitions. [2024-11-12 00:50:00,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 00:50:00,645 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-11-12 00:50:00,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:50:00,646 INFO L225 Difference]: With dead ends: 562 [2024-11-12 00:50:00,646 INFO L226 Difference]: Without dead ends: 346 [2024-11-12 00:50:00,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:50:00,647 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 7 mSDsluCounter, 1393 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1744 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:50:00,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1744 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:50:00,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-11-12 00:50:00,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 342. [2024-11-12 00:50:00,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 341 states have (on average 1.434017595307918) internal successors, (489), 341 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:50:00,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 489 transitions. [2024-11-12 00:50:00,651 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 489 transitions. Word has length 86 [2024-11-12 00:50:00,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:50:00,651 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 489 transitions. [2024-11-12 00:50:00,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:50:00,651 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 489 transitions. [2024-11-12 00:50:00,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-12 00:50:00,652 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:50:00,652 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:50:00,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-12 00:50:00,652 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:50:00,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:50:00,653 INFO L85 PathProgramCache]: Analyzing trace with hash -149891616, now seen corresponding path program 1 times [2024-11-12 00:50:00,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:50:00,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821092163] [2024-11-12 00:50:00,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:50:00,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:50:00,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:50:01,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:50:01,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:50:01,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821092163] [2024-11-12 00:50:01,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821092163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:50:01,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:50:01,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-12 00:50:01,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332950862] [2024-11-12 00:50:01,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:50:01,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 00:50:01,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:50:01,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 00:50:01,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-11-12 00:50:01,222 INFO L87 Difference]: Start difference. First operand 342 states and 489 transitions. Second operand has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 15 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:50:01,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:50:01,440 INFO L93 Difference]: Finished difference Result 593 states and 850 transitions. [2024-11-12 00:50:01,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 00:50:01,441 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 15 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-11-12 00:50:01,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:50:01,442 INFO L225 Difference]: With dead ends: 593 [2024-11-12 00:50:01,443 INFO L226 Difference]: Without dead ends: 366 [2024-11-12 00:50:01,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-11-12 00:50:01,444 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 8 mSDsluCounter, 4012 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4349 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 00:50:01,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4349 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 00:50:01,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-12 00:50:01,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 364. [2024-11-12 00:50:01,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 363 states have (on average 1.4269972451790633) internal successors, (518), 363 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:50:01,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 518 transitions. [2024-11-12 00:50:01,456 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 518 transitions. Word has length 86 [2024-11-12 00:50:01,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:50:01,456 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 518 transitions. [2024-11-12 00:50:01,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 15 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:50:01,456 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 518 transitions. [2024-11-12 00:50:01,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-12 00:50:01,456 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:50:01,456 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:50:01,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-12 00:50:01,457 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:50:01,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:50:01,457 INFO L85 PathProgramCache]: Analyzing trace with hash 440419582, now seen corresponding path program 1 times [2024-11-12 00:50:01,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:50:01,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445947104] [2024-11-12 00:50:01,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:50:01,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:50:01,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:50:01,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:50:01,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:50:01,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445947104] [2024-11-12 00:50:01,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445947104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:50:01,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:50:01,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 00:50:01,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987499949] [2024-11-12 00:50:01,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:50:01,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 00:50:01,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:50:01,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 00:50:01,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-12 00:50:01,932 INFO L87 Difference]: Start difference. First operand 364 states and 518 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:50:02,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:50:02,355 INFO L93 Difference]: Finished difference Result 666 states and 951 transitions. [2024-11-12 00:50:02,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 00:50:02,355 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-11-12 00:50:02,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:50:02,357 INFO L225 Difference]: With dead ends: 666 [2024-11-12 00:50:02,357 INFO L226 Difference]: Without dead ends: 426 [2024-11-12 00:50:02,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-12 00:50:02,358 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 432 mSDsluCounter, 1562 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 1897 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 00:50:02,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 1897 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 00:50:02,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2024-11-12 00:50:02,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 374. [2024-11-12 00:50:02,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 373 states have (on average 1.4262734584450403) internal successors, (532), 373 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:50:02,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 532 transitions. [2024-11-12 00:50:02,363 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 532 transitions. Word has length 87 [2024-11-12 00:50:02,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:50:02,364 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 532 transitions. [2024-11-12 00:50:02,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:50:02,364 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 532 transitions. [2024-11-12 00:50:02,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-12 00:50:02,364 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:50:02,364 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:50:02,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-12 00:50:02,365 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:50:02,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:50:02,365 INFO L85 PathProgramCache]: Analyzing trace with hash -215238718, now seen corresponding path program 1 times [2024-11-12 00:50:02,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:50:02,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157021744] [2024-11-12 00:50:02,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:50:02,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:50:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:50:03,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:50:03,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:50:03,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157021744] [2024-11-12 00:50:03,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157021744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:50:03,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:50:03,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-12 00:50:03,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418678748] [2024-11-12 00:50:03,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:50:03,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-12 00:50:03,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:50:03,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-12 00:50:03,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2024-11-12 00:50:03,069 INFO L87 Difference]: Start difference. First operand 374 states and 532 transitions. Second operand has 21 states, 21 states have (on average 4.142857142857143) internal successors, (87), 21 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:50:03,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:50:03,590 INFO L93 Difference]: Finished difference Result 647 states and 926 transitions. [2024-11-12 00:50:03,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-12 00:50:03,591 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.142857142857143) internal successors, (87), 21 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-11-12 00:50:03,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:50:03,592 INFO L225 Difference]: With dead ends: 647 [2024-11-12 00:50:03,593 INFO L226 Difference]: Without dead ends: 407 [2024-11-12 00:50:03,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2024-11-12 00:50:03,594 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 345 mSDsluCounter, 5622 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 5937 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 00:50:03,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 5937 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 00:50:03,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-11-12 00:50:03,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 403. [2024-11-12 00:50:03,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 402 states have (on average 1.4253731343283582) internal successors, (573), 402 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:50:03,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 573 transitions. [2024-11-12 00:50:03,600 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 573 transitions. Word has length 87 [2024-11-12 00:50:03,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:50:03,600 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 573 transitions. [2024-11-12 00:50:03,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.142857142857143) internal successors, (87), 21 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:50:03,601 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 573 transitions. [2024-11-12 00:50:03,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-12 00:50:03,601 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:50:03,601 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:50:03,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-12 00:50:03,602 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:50:03,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:50:03,602 INFO L85 PathProgramCache]: Analyzing trace with hash -325692010, now seen corresponding path program 1 times [2024-11-12 00:50:03,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:50:03,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583031232] [2024-11-12 00:50:03,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:50:03,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:50:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:50:03,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:50:03,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:50:03,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583031232] [2024-11-12 00:50:03,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583031232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:50:03,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:50:03,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:50:03,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257662809] [2024-11-12 00:50:03,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:50:03,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:50:03,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:50:03,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:50:03,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:50:03,849 INFO L87 Difference]: Start difference. First operand 403 states and 573 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:50:03,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:50:03,864 INFO L93 Difference]: Finished difference Result 677 states and 969 transitions. [2024-11-12 00:50:03,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:50:03,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-11-12 00:50:03,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:50:03,866 INFO L225 Difference]: With dead ends: 677 [2024-11-12 00:50:03,866 INFO L226 Difference]: Without dead ends: 385 [2024-11-12 00:50:03,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:50:03,866 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 0 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:50:03,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 705 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:50:03,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-11-12 00:50:03,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2024-11-12 00:50:03,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 1.4244791666666667) internal successors, (547), 384 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:50:03,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 547 transitions. [2024-11-12 00:50:03,872 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 547 transitions. Word has length 87 [2024-11-12 00:50:03,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:50:03,872 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 547 transitions. [2024-11-12 00:50:03,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:50:03,873 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 547 transitions. [2024-11-12 00:50:03,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-12 00:50:03,873 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:50:03,873 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:50:03,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-12 00:50:03,873 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:50:03,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:50:03,874 INFO L85 PathProgramCache]: Analyzing trace with hash -812887406, now seen corresponding path program 1 times [2024-11-12 00:50:03,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:50:03,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649424579] [2024-11-12 00:50:03,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:50:03,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:50:03,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:50:04,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:50:04,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:50:04,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649424579] [2024-11-12 00:50:04,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649424579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:50:04,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:50:04,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-12 00:50:04,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819452375] [2024-11-12 00:50:04,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:50:04,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-12 00:50:04,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:50:04,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-12 00:50:04,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-12 00:50:04,509 INFO L87 Difference]: Start difference. First operand 385 states and 547 transitions. Second operand has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 18 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:50:06,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:50:06,511 INFO L93 Difference]: Finished difference Result 696 states and 990 transitions. [2024-11-12 00:50:06,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 00:50:06,511 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 18 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2024-11-12 00:50:06,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:50:06,513 INFO L225 Difference]: With dead ends: 696 [2024-11-12 00:50:06,513 INFO L226 Difference]: Without dead ends: 433 [2024-11-12 00:50:06,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=985, Unknown=0, NotChecked=0, Total=1122 [2024-11-12 00:50:06,514 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 549 mSDsluCounter, 4818 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 5142 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-12 00:50:06,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 5142 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-12 00:50:06,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-11-12 00:50:06,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 388. [2024-11-12 00:50:06,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 387 states have (on average 1.421188630490956) internal successors, (550), 387 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:50:06,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 550 transitions. [2024-11-12 00:50:06,520 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 550 transitions. Word has length 88 [2024-11-12 00:50:06,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:50:06,521 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 550 transitions. [2024-11-12 00:50:06,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 18 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:50:06,521 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 550 transitions. [2024-11-12 00:50:06,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-12 00:50:06,521 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:50:06,522 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:50:06,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-12 00:50:06,522 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:50:06,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:50:06,522 INFO L85 PathProgramCache]: Analyzing trace with hash -648944825, now seen corresponding path program 1 times [2024-11-12 00:50:06,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:50:06,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677137447] [2024-11-12 00:50:06,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:50:06,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:50:06,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:50:07,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:50:07,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:50:07,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677137447] [2024-11-12 00:50:07,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677137447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:50:07,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:50:07,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-12 00:50:07,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153339654] [2024-11-12 00:50:07,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:50:07,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-12 00:50:07,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:50:07,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-12 00:50:07,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2024-11-12 00:50:07,237 INFO L87 Difference]: Start difference. First operand 388 states and 550 transitions. Second operand has 17 states, 17 states have (on average 5.176470588235294) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:50:07,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:50:07,530 INFO L93 Difference]: Finished difference Result 654 states and 933 transitions. [2024-11-12 00:50:07,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 00:50:07,531 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.176470588235294) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2024-11-12 00:50:07,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:50:07,532 INFO L225 Difference]: With dead ends: 654 [2024-11-12 00:50:07,532 INFO L226 Difference]: Without dead ends: 391 [2024-11-12 00:50:07,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2024-11-12 00:50:07,533 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 10 mSDsluCounter, 4557 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 4885 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 00:50:07,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 4885 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 00:50:07,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-11-12 00:50:07,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2024-11-12 00:50:07,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 390 states have (on average 1.417948717948718) internal successors, (553), 390 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:50:07,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 553 transitions. [2024-11-12 00:50:07,546 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 553 transitions. Word has length 88 [2024-11-12 00:50:07,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:50:07,546 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 553 transitions. [2024-11-12 00:50:07,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.176470588235294) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:50:07,546 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 553 transitions. [2024-11-12 00:50:07,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-12 00:50:07,547 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:50:07,547 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:50:07,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-12 00:50:07,547 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:50:07,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:50:07,547 INFO L85 PathProgramCache]: Analyzing trace with hash -2106585151, now seen corresponding path program 1 times [2024-11-12 00:50:07,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:50:07,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221276116] [2024-11-12 00:50:07,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:50:07,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:50:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:50:07,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:50:07,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:50:07,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221276116] [2024-11-12 00:50:07,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221276116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:50:07,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:50:07,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 00:50:07,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395335469] [2024-11-12 00:50:07,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:50:07,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 00:50:07,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:50:07,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 00:50:07,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:50:07,875 INFO L87 Difference]: Start difference. First operand 391 states and 553 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:50:09,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:50:09,573 INFO L93 Difference]: Finished difference Result 694 states and 985 transitions. [2024-11-12 00:50:09,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 00:50:09,573 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2024-11-12 00:50:09,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:50:09,575 INFO L225 Difference]: With dead ends: 694 [2024-11-12 00:50:09,575 INFO L226 Difference]: Without dead ends: 425 [2024-11-12 00:50:09,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-12 00:50:09,575 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 521 mSDsluCounter, 1353 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 1694 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-12 00:50:09,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 1694 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-12 00:50:09,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-11-12 00:50:09,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 388. [2024-11-12 00:50:09,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 387 states have (on average 1.4160206718346253) internal successors, (548), 387 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:50:09,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 548 transitions. [2024-11-12 00:50:09,581 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 548 transitions. Word has length 89 [2024-11-12 00:50:09,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:50:09,581 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 548 transitions. [2024-11-12 00:50:09,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:50:09,581 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 548 transitions. [2024-11-12 00:50:09,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-12 00:50:09,582 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:50:09,582 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:50:09,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-12 00:50:09,582 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:50:09,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:50:09,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1058832517, now seen corresponding path program 1 times [2024-11-12 00:50:09,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:50:09,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689730787] [2024-11-12 00:50:09,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:50:09,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:50:09,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 00:50:09,613 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 00:50:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 00:50:09,716 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 00:50:09,716 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 00:50:09,717 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 00:50:09,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-12 00:50:09,723 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:50:09,786 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 00:50:09,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:50:09 BoogieIcfgContainer [2024-11-12 00:50:09,788 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 00:50:09,788 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 00:50:09,788 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 00:50:09,788 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 00:50:09,789 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:49:26" (3/4) ... [2024-11-12 00:50:09,791 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 00:50:09,792 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 00:50:09,792 INFO L158 Benchmark]: Toolchain (without parser) took 46247.27ms. Allocated memory was 184.5MB in the beginning and 906.0MB in the end (delta: 721.4MB). Free memory was 123.8MB in the beginning and 822.8MB in the end (delta: -699.1MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2024-11-12 00:50:09,792 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 184.5MB. Free memory is still 149.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 00:50:09,792 INFO L158 Benchmark]: CACSL2BoogieTranslator took 514.61ms. Allocated memory is still 184.5MB. Free memory was 123.8MB in the beginning and 83.9MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-12 00:50:09,793 INFO L158 Benchmark]: Boogie Procedure Inliner took 128.50ms. Allocated memory is still 184.5MB. Free memory was 83.9MB in the beginning and 55.4MB in the end (delta: 28.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-12 00:50:09,793 INFO L158 Benchmark]: Boogie Preprocessor took 272.13ms. Allocated memory was 184.5MB in the beginning and 333.4MB in the end (delta: 148.9MB). Free memory was 55.4MB in the beginning and 270.5MB in the end (delta: -215.1MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. [2024-11-12 00:50:09,793 INFO L158 Benchmark]: RCFGBuilder took 1919.28ms. Allocated memory is still 333.4MB. Free memory was 270.5MB in the beginning and 241.0MB in the end (delta: 29.5MB). Peak memory consumption was 136.3MB. Max. memory is 16.1GB. [2024-11-12 00:50:09,793 INFO L158 Benchmark]: TraceAbstraction took 43402.70ms. Allocated memory was 333.4MB in the beginning and 906.0MB in the end (delta: 572.5MB). Free memory was 241.0MB in the beginning and 823.9MB in the end (delta: -582.9MB). Peak memory consumption was 506.6MB. Max. memory is 16.1GB. [2024-11-12 00:50:09,793 INFO L158 Benchmark]: Witness Printer took 3.66ms. Allocated memory is still 906.0MB. Free memory was 823.9MB in the beginning and 822.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 00:50:09,794 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 184.5MB. Free memory is still 149.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 514.61ms. Allocated memory is still 184.5MB. Free memory was 123.8MB in the beginning and 83.9MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 128.50ms. Allocated memory is still 184.5MB. Free memory was 83.9MB in the beginning and 55.4MB in the end (delta: 28.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 272.13ms. Allocated memory was 184.5MB in the beginning and 333.4MB in the end (delta: 148.9MB). Free memory was 55.4MB in the beginning and 270.5MB in the end (delta: -215.1MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. * RCFGBuilder took 1919.28ms. Allocated memory is still 333.4MB. Free memory was 270.5MB in the beginning and 241.0MB in the end (delta: 29.5MB). Peak memory consumption was 136.3MB. Max. memory is 16.1GB. * TraceAbstraction took 43402.70ms. Allocated memory was 333.4MB in the beginning and 906.0MB in the end (delta: 572.5MB). Free memory was 241.0MB in the beginning and 823.9MB in the end (delta: -582.9MB). Peak memory consumption was 506.6MB. Max. memory is 16.1GB. * Witness Printer took 3.66ms. Allocated memory is still 906.0MB. Free memory was 823.9MB in the beginning and 822.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 191. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 8); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (8 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 2); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (2 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 1); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (1 - 1); [L35] const SORT_1 var_11 = 0; [L36] const SORT_5 var_45 = 1; [L37] const SORT_1 var_49 = 1; [L38] const SORT_5 var_60 = 0; [L39] const SORT_3 var_81 = 0; [L40] const SORT_3 var_90 = 1; [L41] const SORT_3 var_99 = 2; [L42] const SORT_3 var_108 = 3; [L44] SORT_1 input_2; [L45] SORT_3 input_4; [L46] SORT_5 input_6; [L47] SORT_1 input_7; [L48] SORT_3 input_8; [L49] SORT_3 input_9; [L50] SORT_5 input_10; [L52] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L52] SORT_1 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L53] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L53] SORT_1 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L54] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L54] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L55] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L55] SORT_1 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L56] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L56] SORT_1 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L57] SORT_1 state_52 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L58] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L58] SORT_1 state_54 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L59] SORT_1 state_56 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L60] SORT_5 state_58 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L61] SORT_5 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L62] SORT_5 state_63 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L63] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L63] SORT_5 state_65 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L64] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L64] SORT_1 state_68 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L65] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L65] SORT_1 state_70 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L66] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L66] SORT_1 state_72 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L67] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, var_108=3, var_11=0, var_45=1, var_49=1, var_60=0, var_81=0, var_90=1, var_99=2] [L67] SORT_1 state_74 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L69] SORT_1 init_13_arg_1 = var_11; [L70] state_12 = init_13_arg_1 [L71] SORT_1 init_16_arg_1 = var_11; [L72] state_15 = init_16_arg_1 [L73] SORT_1 init_21_arg_1 = var_11; [L74] state_20 = init_21_arg_1 [L75] SORT_1 init_27_arg_1 = var_11; [L76] state_26 = init_27_arg_1 [L77] SORT_1 init_51_arg_1 = var_49; [L78] state_50 = init_51_arg_1 [L79] SORT_1 init_53_arg_1 = var_11; [L80] state_52 = init_53_arg_1 [L81] SORT_1 init_55_arg_1 = var_11; [L82] state_54 = init_55_arg_1 [L83] SORT_1 init_57_arg_1 = var_11; [L84] state_56 = init_57_arg_1 [L85] SORT_5 init_59_arg_1 = var_45; [L86] state_58 = init_59_arg_1 [L87] SORT_5 init_62_arg_1 = var_60; [L88] state_61 = init_62_arg_1 [L89] SORT_5 init_64_arg_1 = var_60; [L90] state_63 = init_64_arg_1 [L91] SORT_5 init_66_arg_1 = var_60; [L92] state_65 = init_66_arg_1 [L93] SORT_1 init_69_arg_1 = var_11; [L94] state_68 = init_69_arg_1 [L95] SORT_1 init_71_arg_1 = var_11; [L96] state_70 = init_71_arg_1 [L97] SORT_1 init_73_arg_1 = var_11; [L98] state_72 = init_73_arg_1 [L99] SORT_1 init_75_arg_1 = var_11; [L100] state_74 = init_75_arg_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L103] input_2 = __VERIFIER_nondet_uchar() [L104] EXPR input_2 & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L104] input_2 = input_2 & mask_SORT_1 [L105] input_4 = __VERIFIER_nondet_uchar() [L106] EXPR input_4 & mask_SORT_3 VAL [input_2=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L106] input_4 = input_4 & mask_SORT_3 [L107] input_6 = __VERIFIER_nondet_uchar() [L108] input_7 = __VERIFIER_nondet_uchar() [L109] EXPR input_7 & mask_SORT_1 VAL [input_2=0, input_4=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L109] input_7 = input_7 & mask_SORT_1 [L110] input_8 = __VERIFIER_nondet_uchar() [L111] EXPR input_8 & mask_SORT_3 VAL [input_2=0, input_4=0, input_7=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L111] input_8 = input_8 & mask_SORT_3 [L112] input_9 = __VERIFIER_nondet_uchar() [L113] EXPR input_9 & mask_SORT_3 VAL [input_2=0, input_4=0, input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L113] input_9 = input_9 & mask_SORT_3 [L114] input_10 = __VERIFIER_nondet_uchar() [L115] EXPR input_10 & mask_SORT_5 VAL [input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L115] input_10 = input_10 & mask_SORT_5 [L118] SORT_1 var_14_arg_0 = state_12; [L119] SORT_1 var_14_arg_1 = var_11; [L120] SORT_5 var_14 = var_14_arg_0 == var_14_arg_1; [L121] SORT_1 var_17_arg_0 = state_12; [L122] SORT_1 var_17_arg_1 = state_15; [L123] SORT_5 var_17 = var_17_arg_0 != var_17_arg_1; [L124] SORT_5 var_18_arg_0 = var_14; [L125] SORT_5 var_18_arg_1 = var_17; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_18_arg_0=1, var_18_arg_1=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L126] EXPR var_18_arg_0 | var_18_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L126] SORT_5 var_18 = var_18_arg_0 | var_18_arg_1; [L127] SORT_1 var_19_arg_0 = state_12; [L128] SORT_1 var_19_arg_1 = var_11; [L129] SORT_5 var_19 = var_19_arg_0 == var_19_arg_1; [L130] SORT_1 var_22_arg_0 = state_12; [L131] SORT_1 var_22_arg_1 = state_20; [L132] SORT_5 var_22 = var_22_arg_0 != var_22_arg_1; [L133] SORT_5 var_23_arg_0 = var_19; [L134] SORT_5 var_23_arg_1 = var_22; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_18=1, var_23_arg_0=1, var_23_arg_1=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L135] EXPR var_23_arg_0 | var_23_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_18=1, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L135] SORT_5 var_23 = var_23_arg_0 | var_23_arg_1; [L136] SORT_5 var_24_arg_0 = var_18; [L137] SORT_5 var_24_arg_1 = var_23; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_24_arg_0=1, var_24_arg_1=1, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L138] EXPR var_24_arg_0 & var_24_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L138] SORT_5 var_24 = var_24_arg_0 & var_24_arg_1; [L139] SORT_1 var_25_arg_0 = state_12; [L140] SORT_1 var_25_arg_1 = var_11; [L141] SORT_5 var_25 = var_25_arg_0 == var_25_arg_1; [L142] SORT_1 var_28_arg_0 = state_12; [L143] SORT_1 var_28_arg_1 = state_26; [L144] SORT_5 var_28 = var_28_arg_0 != var_28_arg_1; [L145] SORT_5 var_29_arg_0 = var_25; [L146] SORT_5 var_29_arg_1 = var_28; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_24=1, var_29_arg_0=1, var_29_arg_1=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L147] EXPR var_29_arg_0 | var_29_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_24=1, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L147] SORT_5 var_29 = var_29_arg_0 | var_29_arg_1; [L148] SORT_5 var_30_arg_0 = var_24; [L149] SORT_5 var_30_arg_1 = var_29; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_30_arg_0=1, var_30_arg_1=1, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L150] EXPR var_30_arg_0 & var_30_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L150] SORT_5 var_30 = var_30_arg_0 & var_30_arg_1; [L151] SORT_1 var_31_arg_0 = state_15; [L152] SORT_1 var_31_arg_1 = var_11; [L153] SORT_5 var_31 = var_31_arg_0 == var_31_arg_1; [L154] SORT_1 var_32_arg_0 = state_15; [L155] SORT_1 var_32_arg_1 = state_20; [L156] SORT_5 var_32 = var_32_arg_0 != var_32_arg_1; [L157] SORT_5 var_33_arg_0 = var_31; [L158] SORT_5 var_33_arg_1 = var_32; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_30=1, var_33_arg_0=1, var_33_arg_1=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L159] EXPR var_33_arg_0 | var_33_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_30=1, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L159] SORT_5 var_33 = var_33_arg_0 | var_33_arg_1; [L160] SORT_5 var_34_arg_0 = var_30; [L161] SORT_5 var_34_arg_1 = var_33; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_34_arg_0=1, var_34_arg_1=1, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L162] EXPR var_34_arg_0 & var_34_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L162] SORT_5 var_34 = var_34_arg_0 & var_34_arg_1; [L163] SORT_1 var_35_arg_0 = state_15; [L164] SORT_1 var_35_arg_1 = var_11; [L165] SORT_5 var_35 = var_35_arg_0 == var_35_arg_1; [L166] SORT_1 var_36_arg_0 = state_15; [L167] SORT_1 var_36_arg_1 = state_26; [L168] SORT_5 var_36 = var_36_arg_0 != var_36_arg_1; [L169] SORT_5 var_37_arg_0 = var_35; [L170] SORT_5 var_37_arg_1 = var_36; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_34=1, var_37_arg_0=1, var_37_arg_1=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L171] EXPR var_37_arg_0 | var_37_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_34=1, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L171] SORT_5 var_37 = var_37_arg_0 | var_37_arg_1; [L172] SORT_5 var_38_arg_0 = var_34; [L173] SORT_5 var_38_arg_1 = var_37; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_38_arg_0=1, var_38_arg_1=1, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L174] EXPR var_38_arg_0 & var_38_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L174] SORT_5 var_38 = var_38_arg_0 & var_38_arg_1; [L175] SORT_1 var_39_arg_0 = state_20; [L176] SORT_1 var_39_arg_1 = var_11; [L177] SORT_5 var_39 = var_39_arg_0 == var_39_arg_1; [L178] SORT_1 var_40_arg_0 = state_20; [L179] SORT_1 var_40_arg_1 = state_26; [L180] SORT_5 var_40 = var_40_arg_0 != var_40_arg_1; [L181] SORT_5 var_41_arg_0 = var_39; [L182] SORT_5 var_41_arg_1 = var_40; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_38=1, var_41_arg_0=1, var_41_arg_1=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L183] EXPR var_41_arg_0 | var_41_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_38=1, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L183] SORT_5 var_41 = var_41_arg_0 | var_41_arg_1; [L184] SORT_5 var_42_arg_0 = var_38; [L185] SORT_5 var_42_arg_1 = var_41; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_42_arg_0=1, var_42_arg_1=1, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L186] EXPR var_42_arg_0 & var_42_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L186] SORT_5 var_42 = var_42_arg_0 & var_42_arg_1; [L187] SORT_5 var_46_arg_0 = var_42; [L188] SORT_5 var_46 = ~var_46_arg_0; [L189] SORT_5 var_47_arg_0 = var_45; [L190] SORT_5 var_47_arg_1 = var_46; VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_47_arg_0=1, var_47_arg_1=-2, var_60=0, var_81=0, var_90=1, var_99=2] [L191] EXPR var_47_arg_0 & var_47_arg_1 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L191] SORT_5 var_47 = var_47_arg_0 & var_47_arg_1; [L192] EXPR var_47 & mask_SORT_5 VAL [input_10=0, input_2=0, input_4=0, input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_3=3, mask_SORT_5=1, state_12=0, state_15=0, state_20=0, state_26=0, state_50=1, state_52=0, state_54=0, state_56=0, state_58=1, state_61=0, state_63=0, state_65=0, state_68=0, state_70=0, state_72=0, state_74=0, var_108=3, var_11=0, var_45=1, var_60=0, var_81=0, var_90=1, var_99=2] [L192] var_47 = var_47 & mask_SORT_5 [L193] SORT_5 bad_48_arg_0 = var_47; [L194] CALL __VERIFIER_assert(!(bad_48_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 246 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 43.3s, OverallIterations: 27, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 29.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6143 SdHoareTripleChecker+Valid, 28.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6143 mSDsluCounter, 58576 SdHoareTripleChecker+Invalid, 27.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49655 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4413 IncrementalHoareTripleChecker+Invalid, 4455 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 8921 mSDtfsCounter, 4413 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 303 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=403occurred in iteration=22, InterpolantAutomatonStates: 230, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 613 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 2253 NumberOfCodeBlocks, 2253 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2138 ConstructedInterpolants, 0 QuantifiedInterpolants, 7114 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 00:50:09,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.toy_lock_4.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 64bit --witnessprinter.graph.data.programhash dc77f8e7fc201c8766f52fe3e014d6c5c37e220387f85127552a419acc9259b5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 00:50:11,810 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 00:50:11,869 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-12 00:50:11,875 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 00:50:11,876 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 00:50:11,905 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 00:50:11,906 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 00:50:11,906 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 00:50:11,907 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 00:50:11,907 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 00:50:11,907 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 00:50:11,907 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 00:50:11,908 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 00:50:11,908 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 00:50:11,909 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 00:50:11,910 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 00:50:11,910 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 00:50:11,912 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 00:50:11,912 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 00:50:11,912 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 00:50:11,913 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 00:50:11,913 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 00:50:11,913 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 00:50:11,913 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 00:50:11,914 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 00:50:11,914 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 00:50:11,914 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 00:50:11,916 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 00:50:11,917 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 00:50:11,917 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 00:50:11,917 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 00:50:11,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:50:11,917 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 00:50:11,917 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 00:50:11,918 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 00:50:11,918 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 00:50:11,918 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 00:50:11,918 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 00:50:11,919 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 00:50:11,919 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 00:50:11,919 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 00:50:11,920 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/ultimate/releaseScripts/default/UAutomizer-linux/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/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dc77f8e7fc201c8766f52fe3e014d6c5c37e220387f85127552a419acc9259b5 [2024-11-12 00:50:12,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 00:50:12,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 00:50:12,267 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 00:50:12,268 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 00:50:12,269 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 00:50:12,270 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.toy_lock_4.c [2024-11-12 00:50:13,951 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 00:50:14,182 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 00:50:14,183 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.toy_lock_4.c [2024-11-12 00:50:14,203 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a8d3033c/c38b0d9c74374b14a4e83439fc95e7bf/FLAGd0b2e9937 [2024-11-12 00:50:14,516 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a8d3033c/c38b0d9c74374b14a4e83439fc95e7bf [2024-11-12 00:50:14,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 00:50:14,520 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 00:50:14,521 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 00:50:14,521 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 00:50:14,525 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 00:50:14,525 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:50:14" (1/1) ... [2024-11-12 00:50:14,526 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@191b8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:14, skipping insertion in model container [2024-11-12 00:50:14,526 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:50:14" (1/1) ... [2024-11-12 00:50:14,580 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 00:50:14,714 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.toy_lock_4.c[1250,1263] [2024-11-12 00:50:14,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:50:14,916 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 00:50:14,926 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.toy_lock_4.c[1250,1263] [2024-11-12 00:50:14,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:50:14,994 INFO L204 MainTranslator]: Completed translation [2024-11-12 00:50:14,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:14 WrapperNode [2024-11-12 00:50:14,995 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 00:50:14,995 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 00:50:14,995 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 00:50:14,995 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 00:50:15,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:14" (1/1) ... [2024-11-12 00:50:15,018 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:14" (1/1) ... [2024-11-12 00:50:15,064 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 900 [2024-11-12 00:50:15,064 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 00:50:15,065 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 00:50:15,065 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 00:50:15,065 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 00:50:15,073 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:14" (1/1) ... [2024-11-12 00:50:15,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:14" (1/1) ... [2024-11-12 00:50:15,083 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:14" (1/1) ... [2024-11-12 00:50:15,116 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-11-12 00:50:15,117 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:14" (1/1) ... [2024-11-12 00:50:15,117 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:14" (1/1) ... [2024-11-12 00:50:15,144 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:14" (1/1) ... [2024-11-12 00:50:15,148 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:14" (1/1) ... [2024-11-12 00:50:15,158 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:14" (1/1) ... [2024-11-12 00:50:15,165 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:14" (1/1) ... [2024-11-12 00:50:15,179 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 00:50:15,180 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 00:50:15,180 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 00:50:15,180 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 00:50:15,181 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:14" (1/1) ... [2024-11-12 00:50:15,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:50:15,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:50:15,246 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 00:50:15,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 00:50:15,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 00:50:15,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 00:50:15,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 00:50:15,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 00:50:15,468 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 00:50:15,470 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 00:50:16,011 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-11-12 00:50:16,012 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 00:50:16,022 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 00:50:16,022 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 00:50:16,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:50:16 BoogieIcfgContainer [2024-11-12 00:50:16,022 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 00:50:16,025 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 00:50:16,025 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 00:50:16,027 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 00:50:16,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:50:14" (1/3) ... [2024-11-12 00:50:16,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b133fe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:50:16, skipping insertion in model container [2024-11-12 00:50:16,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:14" (2/3) ... [2024-11-12 00:50:16,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b133fe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:50:16, skipping insertion in model container [2024-11-12 00:50:16,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:50:16" (3/3) ... [2024-11-12 00:50:16,032 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.toy_lock_4.c [2024-11-12 00:50:16,045 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 00:50:16,046 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 00:50:16,095 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 00:50:16,100 INFO L333 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=LoopHeads, 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;@2be0df6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 00:50:16,100 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 00:50:16,104 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:50:16,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 00:50:16,107 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:50:16,108 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 00:50:16,109 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:50:16,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:50:16,114 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-12 00:50:16,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 00:50:16,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1389956320] [2024-11-12 00:50:16,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:50:16,126 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 00:50:16,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 00:50:16,128 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 00:50:16,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 00:50:16,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:50:16,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-12 00:50:16,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:50:16,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-11-12 00:50:16,768 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 00:50:16,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 00:50:16,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1389956320] [2024-11-12 00:50:16,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1389956320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:50:16,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:50:16,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:50:16,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670116480] [2024-11-12 00:50:16,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:50:16,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:50:16,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 00:50:16,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:50:16,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:50:16,795 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:50:16,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:50:16,866 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-12 00:50:16,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:50:16,868 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-12 00:50:16,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:50:16,873 INFO L225 Difference]: With dead ends: 18 [2024-11-12 00:50:16,873 INFO L226 Difference]: Without dead ends: 10 [2024-11-12 00:50:16,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:50:16,877 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 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-11-12 00:50:16,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:50:16,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-12 00:50:16,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-12 00:50:16,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:50:16,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-12 00:50:16,920 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-12 00:50:16,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:50:16,920 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-12 00:50:16,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:50:16,921 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-12 00:50:16,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-12 00:50:16,921 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:50:16,921 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-12 00:50:16,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-12 00:50:17,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 00:50:17,123 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:50:17,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:50:17,123 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-12 00:50:17,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 00:50:17,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [565252455] [2024-11-12 00:50:17,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:50:17,124 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 00:50:17,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 00:50:17,129 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 00:50:17,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 00:50:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:50:17,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 92 conjuncts are in the unsatisfiable core [2024-11-12 00:50:17,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:50:26,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:50:26,474 INFO L312 TraceCheckSpWp]: Computing backward predicates...