./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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.vis_QF_BV_s1269b_p4.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 cc15dd8c58787d1f6894f4700fb98e0d8cb8608f1a57f24801c50df888951e5d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:15:05,394 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:15:05,482 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-08 19:15:05,486 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:15:05,487 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:15:05,514 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:15:05,515 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:15:05,515 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:15:05,516 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:15:05,516 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:15:05,516 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:15:05,517 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:15:05,518 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:15:05,522 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:15:05,522 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:15:05,522 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:15:05,523 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:15:05,523 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:15:05,523 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:15:05,523 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:15:05,524 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:15:05,526 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:15:05,527 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:15:05,527 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:15:05,527 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:15:05,528 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:15:05,528 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:15:05,528 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:15:05,528 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:15:05,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:15:05,529 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:15:05,529 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:15:05,529 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:15:05,529 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:15:05,530 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:15:05,530 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:15:05,531 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:15:05,532 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:15:05,532 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:15:05,532 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 -> cc15dd8c58787d1f6894f4700fb98e0d8cb8608f1a57f24801c50df888951e5d [2024-11-08 19:15:05,793 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:15:05,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:15:05,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:15:05,822 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:15:05,823 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:15:05,824 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c [2024-11-08 19:15:07,312 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:15:07,517 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:15:07,518 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c [2024-11-08 19:15:07,531 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f96dcbb8/e61cd1b1959c4d08ba8bbd574b82eb9b/FLAG6d25f5a9c [2024-11-08 19:15:07,547 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f96dcbb8/e61cd1b1959c4d08ba8bbd574b82eb9b [2024-11-08 19:15:07,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:15:07,551 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:15:07,556 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:15:07,557 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:15:07,562 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:15:07,563 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:15:07" (1/1) ... [2024-11-08 19:15:07,564 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bccd12f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:07, skipping insertion in model container [2024-11-08 19:15:07,564 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:15:07" (1/1) ... [2024-11-08 19:15:07,598 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:15:07,774 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.vis_QF_BV_s1269b_p4.c[1259,1272] [2024-11-08 19:15:07,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:15:07,881 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:15:07,892 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.vis_QF_BV_s1269b_p4.c[1259,1272] [2024-11-08 19:15:07,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:15:07,946 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:15:07,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:07 WrapperNode [2024-11-08 19:15:07,947 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:15:07,948 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:15:07,948 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:15:07,948 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:15:07,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:07" (1/1) ... [2024-11-08 19:15:07,972 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:07" (1/1) ... [2024-11-08 19:15:08,035 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 458 [2024-11-08 19:15:08,035 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:15:08,036 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:15:08,036 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:15:08,036 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:15:08,052 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:07" (1/1) ... [2024-11-08 19:15:08,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:07" (1/1) ... [2024-11-08 19:15:08,069 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:07" (1/1) ... [2024-11-08 19:15:08,103 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-08 19:15:08,104 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:07" (1/1) ... [2024-11-08 19:15:08,104 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:07" (1/1) ... [2024-11-08 19:15:08,132 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:07" (1/1) ... [2024-11-08 19:15:08,137 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:07" (1/1) ... [2024-11-08 19:15:08,143 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:07" (1/1) ... [2024-11-08 19:15:08,150 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:07" (1/1) ... [2024-11-08 19:15:08,161 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:15:08,162 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:15:08,163 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:15:08,163 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:15:08,164 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:07" (1/1) ... [2024-11-08 19:15:08,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:15:08,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:15:08,202 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-08 19:15:08,208 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-08 19:15:08,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:15:08,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:15:08,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:15:08,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:15:08,389 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:15:08,391 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:15:09,149 INFO L? ?]: Removed 232 outVars from TransFormulas that were not future-live. [2024-11-08 19:15:09,149 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:15:09,166 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:15:09,166 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:15:09,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:15:09 BoogieIcfgContainer [2024-11-08 19:15:09,167 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:15:09,169 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:15:09,169 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:15:09,173 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:15:09,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:15:07" (1/3) ... [2024-11-08 19:15:09,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c786353 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:15:09, skipping insertion in model container [2024-11-08 19:15:09,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:07" (2/3) ... [2024-11-08 19:15:09,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c786353 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:15:09, skipping insertion in model container [2024-11-08 19:15:09,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:15:09" (3/3) ... [2024-11-08 19:15:09,177 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_s1269b_p4.c [2024-11-08 19:15:09,192 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:15:09,193 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:15:09,267 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:15:09,274 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;@1fd3fd0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:15:09,275 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:15:09,279 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 116 states have (on average 1.4913793103448276) internal successors, (173), 117 states have internal predecessors, (173), 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-08 19:15:09,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 19:15:09,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:09,288 INFO L215 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] [2024-11-08 19:15:09,289 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:09,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:09,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1135438275, now seen corresponding path program 1 times [2024-11-08 19:15:09,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:09,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923261279] [2024-11-08 19:15:09,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:09,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:09,873 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-08 19:15:09,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:09,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923261279] [2024-11-08 19:15:09,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923261279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:09,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:09,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:15:09,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882265272] [2024-11-08 19:15:09,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:09,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:15:09,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:09,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:15:09,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:15:09,917 INFO L87 Difference]: Start difference. First operand has 118 states, 116 states have (on average 1.4913793103448276) internal successors, (173), 117 states have internal predecessors, (173), 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 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-08 19:15:09,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:09,986 INFO L93 Difference]: Finished difference Result 217 states and 321 transitions. [2024-11-08 19:15:09,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:15:09,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 23 [2024-11-08 19:15:09,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:09,998 INFO L225 Difference]: With dead ends: 217 [2024-11-08 19:15:09,998 INFO L226 Difference]: Without dead ends: 117 [2024-11-08 19:15:10,002 INFO L431 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-08 19:15:10,006 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 495 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-08 19:15:10,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 495 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:15:10,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-08 19:15:10,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-08 19:15:10,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.4741379310344827) internal successors, (171), 116 states have internal predecessors, (171), 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-08 19:15:10,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 171 transitions. [2024-11-08 19:15:10,042 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 171 transitions. Word has length 23 [2024-11-08 19:15:10,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:10,043 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 171 transitions. [2024-11-08 19:15:10,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-08 19:15:10,043 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 171 transitions. [2024-11-08 19:15:10,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 19:15:10,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:10,044 INFO L215 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] [2024-11-08 19:15:10,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:15:10,045 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:10,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:10,046 INFO L85 PathProgramCache]: Analyzing trace with hash 840543427, now seen corresponding path program 1 times [2024-11-08 19:15:10,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:10,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738304125] [2024-11-08 19:15:10,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:10,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:10,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:10,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-08 19:15:10,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:10,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738304125] [2024-11-08 19:15:10,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738304125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:10,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:10,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:15:10,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62522769] [2024-11-08 19:15:10,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:10,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:15:10,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:10,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:15:10,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:15:10,211 INFO L87 Difference]: Start difference. First operand 117 states and 171 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-08 19:15:10,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:10,261 INFO L93 Difference]: Finished difference Result 218 states and 319 transitions. [2024-11-08 19:15:10,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:15:10,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 24 [2024-11-08 19:15:10,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:10,263 INFO L225 Difference]: With dead ends: 218 [2024-11-08 19:15:10,264 INFO L226 Difference]: Without dead ends: 119 [2024-11-08 19:15:10,264 INFO L431 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-08 19:15:10,266 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 491 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-08 19:15:10,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 491 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:15:10,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-08 19:15:10,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-08 19:15:10,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.4661016949152543) internal successors, (173), 118 states have internal predecessors, (173), 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-08 19:15:10,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 173 transitions. [2024-11-08 19:15:10,275 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 173 transitions. Word has length 24 [2024-11-08 19:15:10,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:10,275 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 173 transitions. [2024-11-08 19:15:10,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-08 19:15:10,276 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 173 transitions. [2024-11-08 19:15:10,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 19:15:10,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:10,277 INFO L215 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] [2024-11-08 19:15:10,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 19:15:10,277 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:10,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:10,282 INFO L85 PathProgramCache]: Analyzing trace with hash -810923364, now seen corresponding path program 1 times [2024-11-08 19:15:10,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:10,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430659181] [2024-11-08 19:15:10,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:10,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:10,653 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-08 19:15:10,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:10,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430659181] [2024-11-08 19:15:10,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430659181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:10,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:10,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:15:10,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17669663] [2024-11-08 19:15:10,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:10,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:15:10,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:10,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:15:10,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:15:10,658 INFO L87 Difference]: Start difference. First operand 119 states and 173 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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-08 19:15:10,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:10,789 INFO L93 Difference]: Finished difference Result 231 states and 337 transitions. [2024-11-08 19:15:10,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 19:15:10,790 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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 25 [2024-11-08 19:15:10,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:10,792 INFO L225 Difference]: With dead ends: 231 [2024-11-08 19:15:10,795 INFO L226 Difference]: Without dead ends: 130 [2024-11-08 19:15:10,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-08 19:15:10,797 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 26 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:10,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 927 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:15:10,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-08 19:15:10,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2024-11-08 19:15:10,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.453125) internal successors, (186), 128 states have internal predecessors, (186), 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-08 19:15:10,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 186 transitions. [2024-11-08 19:15:10,810 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 186 transitions. Word has length 25 [2024-11-08 19:15:10,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:10,811 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 186 transitions. [2024-11-08 19:15:10,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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-08 19:15:10,811 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 186 transitions. [2024-11-08 19:15:10,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 19:15:10,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:10,812 INFO L215 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] [2024-11-08 19:15:10,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 19:15:10,813 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:10,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:10,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1540066410, now seen corresponding path program 1 times [2024-11-08 19:15:10,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:10,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009598480] [2024-11-08 19:15:10,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:10,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:11,170 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-08 19:15:11,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:11,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009598480] [2024-11-08 19:15:11,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009598480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:11,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:11,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 19:15:11,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264426385] [2024-11-08 19:15:11,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:11,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 19:15:11,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:11,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 19:15:11,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 19:15:11,173 INFO L87 Difference]: Start difference. First operand 129 states and 186 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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-08 19:15:11,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:11,358 INFO L93 Difference]: Finished difference Result 305 states and 441 transitions. [2024-11-08 19:15:11,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 19:15:11,359 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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 26 [2024-11-08 19:15:11,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:11,362 INFO L225 Difference]: With dead ends: 305 [2024-11-08 19:15:11,362 INFO L226 Difference]: Without dead ends: 204 [2024-11-08 19:15:11,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-08 19:15:11,367 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 130 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:11,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1203 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:15:11,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-08 19:15:11,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 131. [2024-11-08 19:15:11,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.4461538461538461) internal successors, (188), 130 states have internal predecessors, (188), 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-08 19:15:11,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 188 transitions. [2024-11-08 19:15:11,381 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 188 transitions. Word has length 26 [2024-11-08 19:15:11,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:11,381 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 188 transitions. [2024-11-08 19:15:11,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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-08 19:15:11,382 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 188 transitions. [2024-11-08 19:15:11,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 19:15:11,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:11,383 INFO L215 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] [2024-11-08 19:15:11,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 19:15:11,383 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:11,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:11,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1685236529, now seen corresponding path program 1 times [2024-11-08 19:15:11,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:11,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788216900] [2024-11-08 19:15:11,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:11,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:11,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:11,553 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-08 19:15:11,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:11,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788216900] [2024-11-08 19:15:11,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788216900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:11,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:11,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:15:11,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508751805] [2024-11-08 19:15:11,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:11,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:15:11,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:11,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:15:11,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:15:11,557 INFO L87 Difference]: Start difference. First operand 131 states and 188 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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-08 19:15:11,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:11,647 INFO L93 Difference]: Finished difference Result 303 states and 434 transitions. [2024-11-08 19:15:11,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 19:15:11,647 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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 26 [2024-11-08 19:15:11,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:11,648 INFO L225 Difference]: With dead ends: 303 [2024-11-08 19:15:11,650 INFO L226 Difference]: Without dead ends: 193 [2024-11-08 19:15:11,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-08 19:15:11,651 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 109 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:11,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 910 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:15:11,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-08 19:15:11,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 132. [2024-11-08 19:15:11,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.4351145038167938) internal successors, (188), 131 states have internal predecessors, (188), 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-08 19:15:11,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 188 transitions. [2024-11-08 19:15:11,667 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 188 transitions. Word has length 26 [2024-11-08 19:15:11,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:11,668 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 188 transitions. [2024-11-08 19:15:11,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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-08 19:15:11,668 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 188 transitions. [2024-11-08 19:15:11,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 19:15:11,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:11,669 INFO L215 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] [2024-11-08 19:15:11,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 19:15:11,669 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:11,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:11,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1487729941, now seen corresponding path program 1 times [2024-11-08 19:15:11,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:11,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639622381] [2024-11-08 19:15:11,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:11,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:11,790 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-08 19:15:11,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:11,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639622381] [2024-11-08 19:15:11,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639622381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:11,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:11,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:15:11,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177372764] [2024-11-08 19:15:11,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:11,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:15:11,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:11,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:15:11,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:15:11,794 INFO L87 Difference]: Start difference. First operand 132 states and 188 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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-08 19:15:11,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:11,829 INFO L93 Difference]: Finished difference Result 283 states and 405 transitions. [2024-11-08 19:15:11,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:15:11,830 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 27 [2024-11-08 19:15:11,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:11,831 INFO L225 Difference]: With dead ends: 283 [2024-11-08 19:15:11,831 INFO L226 Difference]: Without dead ends: 173 [2024-11-08 19:15:11,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:15:11,833 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 89 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:11,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 626 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:15:11,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-08 19:15:11,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 128. [2024-11-08 19:15:11,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.4330708661417322) internal successors, (182), 127 states have internal predecessors, (182), 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-08 19:15:11,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 182 transitions. [2024-11-08 19:15:11,845 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 182 transitions. Word has length 27 [2024-11-08 19:15:11,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:11,845 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 182 transitions. [2024-11-08 19:15:11,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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-08 19:15:11,846 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 182 transitions. [2024-11-08 19:15:11,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-08 19:15:11,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:11,848 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:15:11,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 19:15:11,848 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:11,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:11,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1767100030, now seen corresponding path program 1 times [2024-11-08 19:15:11,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:11,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916221620] [2024-11-08 19:15:11,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:11,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:11,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:12,389 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:12,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:12,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916221620] [2024-11-08 19:15:12,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916221620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:12,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:12,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:15:12,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212806165] [2024-11-08 19:15:12,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:12,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:15:12,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:12,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:15:12,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:15:12,393 INFO L87 Difference]: Start difference. First operand 128 states and 182 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 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-08 19:15:12,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:12,471 INFO L93 Difference]: Finished difference Result 277 states and 399 transitions. [2024-11-08 19:15:12,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 19:15:12,472 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 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-08 19:15:12,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:12,473 INFO L225 Difference]: With dead ends: 277 [2024-11-08 19:15:12,473 INFO L226 Difference]: Without dead ends: 176 [2024-11-08 19:15:12,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-08 19:15:12,474 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 92 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:12,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 794 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:15:12,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-08 19:15:12,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 145. [2024-11-08 19:15:12,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.4166666666666667) internal successors, (204), 144 states have internal predecessors, (204), 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-08 19:15:12,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 204 transitions. [2024-11-08 19:15:12,485 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 204 transitions. Word has length 75 [2024-11-08 19:15:12,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:12,486 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 204 transitions. [2024-11-08 19:15:12,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 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-08 19:15:12,486 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 204 transitions. [2024-11-08 19:15:12,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-08 19:15:12,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:12,489 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:15:12,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 19:15:12,493 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:12,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:12,493 INFO L85 PathProgramCache]: Analyzing trace with hash 2102834484, now seen corresponding path program 1 times [2024-11-08 19:15:12,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:12,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689969662] [2024-11-08 19:15:12,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:12,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:13,020 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:13,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:13,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689969662] [2024-11-08 19:15:13,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689969662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:13,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:13,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 19:15:13,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408442913] [2024-11-08 19:15:13,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:13,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:15:13,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:13,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:15:13,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:15:13,025 INFO L87 Difference]: Start difference. First operand 145 states and 204 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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-08 19:15:13,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:13,074 INFO L93 Difference]: Finished difference Result 254 states and 363 transitions. [2024-11-08 19:15:13,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:15:13,074 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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-08 19:15:13,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:13,075 INFO L225 Difference]: With dead ends: 254 [2024-11-08 19:15:13,076 INFO L226 Difference]: Without dead ends: 153 [2024-11-08 19:15:13,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:15:13,077 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 5 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:13,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 809 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:15:13,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-08 19:15:13,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 150. [2024-11-08 19:15:13,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 1.4093959731543624) internal successors, (210), 149 states have internal predecessors, (210), 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-08 19:15:13,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 210 transitions. [2024-11-08 19:15:13,083 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 210 transitions. Word has length 76 [2024-11-08 19:15:13,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:13,083 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 210 transitions. [2024-11-08 19:15:13,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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-08 19:15:13,083 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 210 transitions. [2024-11-08 19:15:13,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-08 19:15:13,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:13,085 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:15:13,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 19:15:13,085 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:13,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:13,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1102813423, now seen corresponding path program 1 times [2024-11-08 19:15:13,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:13,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248775029] [2024-11-08 19:15:13,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:13,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:13,743 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:13,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:13,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248775029] [2024-11-08 19:15:13,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248775029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:13,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:13,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 19:15:13,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501995871] [2024-11-08 19:15:13,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:13,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 19:15:13,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:13,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 19:15:13,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-08 19:15:13,746 INFO L87 Difference]: Start difference. First operand 150 states and 210 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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-08 19:15:13,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:13,899 INFO L93 Difference]: Finished difference Result 307 states and 439 transitions. [2024-11-08 19:15:13,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 19:15:13,900 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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-08 19:15:13,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:13,904 INFO L225 Difference]: With dead ends: 307 [2024-11-08 19:15:13,904 INFO L226 Difference]: Without dead ends: 201 [2024-11-08 19:15:13,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-08 19:15:13,905 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 99 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:13,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 1204 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:15:13,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-08 19:15:13,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 168. [2024-11-08 19:15:13,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.407185628742515) internal successors, (235), 167 states have internal predecessors, (235), 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-08 19:15:13,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 235 transitions. [2024-11-08 19:15:13,914 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 235 transitions. Word has length 77 [2024-11-08 19:15:13,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:13,914 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 235 transitions. [2024-11-08 19:15:13,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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-08 19:15:13,914 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 235 transitions. [2024-11-08 19:15:13,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-08 19:15:13,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:13,915 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:15:13,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 19:15:13,916 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:13,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:13,916 INFO L85 PathProgramCache]: Analyzing trace with hash 599392645, now seen corresponding path program 1 times [2024-11-08 19:15:13,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:13,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037254527] [2024-11-08 19:15:13,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:13,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:14,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:14,380 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:14,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:14,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037254527] [2024-11-08 19:15:14,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037254527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:14,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:14,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 19:15:14,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471425767] [2024-11-08 19:15:14,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:14,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 19:15:14,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:14,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 19:15:14,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 19:15:14,383 INFO L87 Difference]: Start difference. First operand 168 states and 235 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-08 19:15:14,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:14,477 INFO L93 Difference]: Finished difference Result 292 states and 415 transitions. [2024-11-08 19:15:14,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 19:15:14,478 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-08 19:15:14,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:14,479 INFO L225 Difference]: With dead ends: 292 [2024-11-08 19:15:14,479 INFO L226 Difference]: Without dead ends: 186 [2024-11-08 19:15:14,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 19:15:14,480 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 11 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:14,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1290 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:15:14,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-08 19:15:14,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2024-11-08 19:15:14,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.4021739130434783) internal successors, (258), 184 states have internal predecessors, (258), 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-08 19:15:14,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 258 transitions. [2024-11-08 19:15:14,486 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 258 transitions. Word has length 78 [2024-11-08 19:15:14,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:14,487 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 258 transitions. [2024-11-08 19:15:14,488 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-08 19:15:14,488 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 258 transitions. [2024-11-08 19:15:14,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-08 19:15:14,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:14,489 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:15:14,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 19:15:14,490 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:14,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:14,491 INFO L85 PathProgramCache]: Analyzing trace with hash 985055635, now seen corresponding path program 1 times [2024-11-08 19:15:14,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:14,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607036138] [2024-11-08 19:15:14,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:14,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:14,984 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:14,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:14,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607036138] [2024-11-08 19:15:14,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607036138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:14,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:14,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:15:14,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510507991] [2024-11-08 19:15:14,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:14,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:15:14,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:14,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:15:14,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:15:14,987 INFO L87 Difference]: Start difference. First operand 185 states and 258 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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-08 19:15:14,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:15,000 INFO L93 Difference]: Finished difference Result 308 states and 434 transitions. [2024-11-08 19:15:15,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:15:15,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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-08 19:15:15,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:15,001 INFO L225 Difference]: With dead ends: 308 [2024-11-08 19:15:15,001 INFO L226 Difference]: Without dead ends: 185 [2024-11-08 19:15:15,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:15:15,002 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 2 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 325 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-08 19:15:15,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 325 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:15:15,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-08 19:15:15,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-11-08 19:15:15,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.3967391304347827) internal successors, (257), 184 states have internal predecessors, (257), 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-08 19:15:15,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 257 transitions. [2024-11-08 19:15:15,007 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 257 transitions. Word has length 78 [2024-11-08 19:15:15,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:15,007 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 257 transitions. [2024-11-08 19:15:15,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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-08 19:15:15,008 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 257 transitions. [2024-11-08 19:15:15,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-08 19:15:15,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:15,008 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:15:15,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 19:15:15,009 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:15,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:15,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1801205834, now seen corresponding path program 1 times [2024-11-08 19:15:15,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:15,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919842315] [2024-11-08 19:15:15,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:15,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:15,773 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:15,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:15,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919842315] [2024-11-08 19:15:15,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919842315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:15,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:15,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 19:15:15,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897980817] [2024-11-08 19:15:15,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:15,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 19:15:15,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:15,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 19:15:15,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-08 19:15:15,776 INFO L87 Difference]: Start difference. First operand 185 states and 257 transitions. Second operand has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 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-08 19:15:16,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:16,015 INFO L93 Difference]: Finished difference Result 360 states and 507 transitions. [2024-11-08 19:15:16,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 19:15:16,016 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 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-08 19:15:16,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:16,018 INFO L225 Difference]: With dead ends: 360 [2024-11-08 19:15:16,018 INFO L226 Difference]: Without dead ends: 237 [2024-11-08 19:15:16,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-11-08 19:15:16,019 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 45 mSDsluCounter, 1511 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1677 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:16,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1677 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 19:15:16,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-08 19:15:16,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 215. [2024-11-08 19:15:16,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 1.3925233644859814) internal successors, (298), 214 states have internal predecessors, (298), 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-08 19:15:16,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 298 transitions. [2024-11-08 19:15:16,028 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 298 transitions. Word has length 79 [2024-11-08 19:15:16,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:16,028 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 298 transitions. [2024-11-08 19:15:16,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 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-08 19:15:16,029 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 298 transitions. [2024-11-08 19:15:16,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-08 19:15:16,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:16,029 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:15:16,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 19:15:16,030 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:16,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:16,030 INFO L85 PathProgramCache]: Analyzing trace with hash 28135856, now seen corresponding path program 1 times [2024-11-08 19:15:16,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:16,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032286988] [2024-11-08 19:15:16,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:16,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:16,953 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:16,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:16,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032286988] [2024-11-08 19:15:16,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032286988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:16,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:16,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 19:15:16,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816427745] [2024-11-08 19:15:16,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:16,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 19:15:16,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:16,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 19:15:16,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-11-08 19:15:16,955 INFO L87 Difference]: Start difference. First operand 215 states and 298 transitions. Second operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 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-08 19:15:17,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:17,214 INFO L93 Difference]: Finished difference Result 423 states and 596 transitions. [2024-11-08 19:15:17,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 19:15:17,215 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 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-08 19:15:17,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:17,216 INFO L225 Difference]: With dead ends: 423 [2024-11-08 19:15:17,217 INFO L226 Difference]: Without dead ends: 270 [2024-11-08 19:15:17,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-11-08 19:15:17,219 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 74 mSDsluCounter, 1467 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1606 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:17,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1606 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 19:15:17,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-11-08 19:15:17,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 258. [2024-11-08 19:15:17,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 257 states have (on average 1.3891050583657587) internal successors, (357), 257 states have internal predecessors, (357), 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-08 19:15:17,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 357 transitions. [2024-11-08 19:15:17,229 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 357 transitions. Word has length 80 [2024-11-08 19:15:17,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:17,229 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 357 transitions. [2024-11-08 19:15:17,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 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-08 19:15:17,229 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 357 transitions. [2024-11-08 19:15:17,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-08 19:15:17,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:17,230 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:15:17,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 19:15:17,231 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:17,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:17,232 INFO L85 PathProgramCache]: Analyzing trace with hash -118938263, now seen corresponding path program 1 times [2024-11-08 19:15:17,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:17,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080024790] [2024-11-08 19:15:17,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:17,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:17,825 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:17,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:17,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080024790] [2024-11-08 19:15:17,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080024790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:17,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:17,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 19:15:17,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172079198] [2024-11-08 19:15:17,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:17,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 19:15:17,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:17,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 19:15:17,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-08 19:15:17,828 INFO L87 Difference]: Start difference. First operand 258 states and 357 transitions. Second operand has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 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-08 19:15:17,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:17,982 INFO L93 Difference]: Finished difference Result 447 states and 624 transitions. [2024-11-08 19:15:17,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 19:15:17,982 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 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-08 19:15:17,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:17,984 INFO L225 Difference]: With dead ends: 447 [2024-11-08 19:15:17,984 INFO L226 Difference]: Without dead ends: 294 [2024-11-08 19:15:17,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-08 19:15:17,985 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 29 mSDsluCounter, 1316 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 1486 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:17,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 1486 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:15:17,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-08 19:15:17,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 287. [2024-11-08 19:15:17,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 286 states have (on average 1.3916083916083917) internal successors, (398), 286 states have internal predecessors, (398), 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-08 19:15:17,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 398 transitions. [2024-11-08 19:15:17,993 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 398 transitions. Word has length 80 [2024-11-08 19:15:17,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:17,993 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 398 transitions. [2024-11-08 19:15:17,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 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-08 19:15:17,994 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 398 transitions. [2024-11-08 19:15:17,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-08 19:15:17,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:17,995 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:15:17,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 19:15:17,995 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:17,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:17,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1169245647, now seen corresponding path program 1 times [2024-11-08 19:15:17,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:17,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514678086] [2024-11-08 19:15:17,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:17,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:19,053 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:19,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:19,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514678086] [2024-11-08 19:15:19,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514678086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:19,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:19,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-08 19:15:19,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222537882] [2024-11-08 19:15:19,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:19,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 19:15:19,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:19,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 19:15:19,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2024-11-08 19:15:19,055 INFO L87 Difference]: Start difference. First operand 287 states and 398 transitions. Second operand has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 17 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-08 19:15:19,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:19,609 INFO L93 Difference]: Finished difference Result 530 states and 744 transitions. [2024-11-08 19:15:19,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 19:15:19,610 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 17 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-08 19:15:19,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:19,611 INFO L225 Difference]: With dead ends: 530 [2024-11-08 19:15:19,611 INFO L226 Difference]: Without dead ends: 352 [2024-11-08 19:15:19,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2024-11-08 19:15:19,613 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 158 mSDsluCounter, 1995 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 2139 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:19,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 2139 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 19:15:19,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-11-08 19:15:19,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 329. [2024-11-08 19:15:19,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 328 states have (on average 1.4024390243902438) internal successors, (460), 328 states have internal predecessors, (460), 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-08 19:15:19,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 460 transitions. [2024-11-08 19:15:19,622 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 460 transitions. Word has length 81 [2024-11-08 19:15:19,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:19,622 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 460 transitions. [2024-11-08 19:15:19,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 17 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-08 19:15:19,623 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 460 transitions. [2024-11-08 19:15:19,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-08 19:15:19,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:19,624 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:15:19,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 19:15:19,624 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:19,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:19,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1118774572, now seen corresponding path program 1 times [2024-11-08 19:15:19,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:19,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437768426] [2024-11-08 19:15:19,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:19,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:20,333 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:20,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:20,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437768426] [2024-11-08 19:15:20,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437768426] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:15:20,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287866320] [2024-11-08 19:15:20,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:20,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:15:20,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:15:20,339 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:15:20,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 19:15:20,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:20,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-08 19:15:20,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:15:21,062 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:21,062 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:15:21,658 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:21,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287866320] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 19:15:21,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-08 19:15:21,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [12, 16] total 37 [2024-11-08 19:15:21,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576486441] [2024-11-08 19:15:21,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:21,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 19:15:21,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:21,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 19:15:21,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1224, Unknown=0, NotChecked=0, Total=1332 [2024-11-08 19:15:21,661 INFO L87 Difference]: Start difference. First operand 329 states and 460 transitions. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 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-08 19:15:22,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:22,067 INFO L93 Difference]: Finished difference Result 564 states and 792 transitions. [2024-11-08 19:15:22,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 19:15:22,068 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 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-08 19:15:22,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:22,070 INFO L225 Difference]: With dead ends: 564 [2024-11-08 19:15:22,070 INFO L226 Difference]: Without dead ends: 385 [2024-11-08 19:15:22,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=134, Invalid=1588, Unknown=0, NotChecked=0, Total=1722 [2024-11-08 19:15:22,072 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 59 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:22,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 1513 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 19:15:22,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-11-08 19:15:22,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 365. [2024-11-08 19:15:22,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 1.4065934065934067) internal successors, (512), 364 states have internal predecessors, (512), 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-08 19:15:22,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 512 transitions. [2024-11-08 19:15:22,082 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 512 transitions. Word has length 81 [2024-11-08 19:15:22,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:22,083 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 512 transitions. [2024-11-08 19:15:22,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 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-08 19:15:22,083 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 512 transitions. [2024-11-08 19:15:22,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-08 19:15:22,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:22,087 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:15:22,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 19:15:22,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-08 19:15:22,291 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:22,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:22,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1516768061, now seen corresponding path program 1 times [2024-11-08 19:15:22,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:22,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096723037] [2024-11-08 19:15:22,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:22,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:22,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:22,773 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:22,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:22,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096723037] [2024-11-08 19:15:22,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096723037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:22,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:22,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 19:15:22,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666736347] [2024-11-08 19:15:22,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:22,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 19:15:22,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:22,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 19:15:22,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-08 19:15:22,776 INFO L87 Difference]: Start difference. First operand 365 states and 512 transitions. Second operand has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 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-08 19:15:22,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:22,968 INFO L93 Difference]: Finished difference Result 677 states and 954 transitions. [2024-11-08 19:15:22,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 19:15:22,968 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 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-08 19:15:22,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:22,970 INFO L225 Difference]: With dead ends: 677 [2024-11-08 19:15:22,970 INFO L226 Difference]: Without dead ends: 472 [2024-11-08 19:15:22,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-08 19:15:22,971 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 132 mSDsluCounter, 1833 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 2077 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:22,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 2077 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:15:22,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-11-08 19:15:22,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 384. [2024-11-08 19:15:22,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 383 states have (on average 1.4073107049608355) internal successors, (539), 383 states have internal predecessors, (539), 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-08 19:15:22,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 539 transitions. [2024-11-08 19:15:22,982 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 539 transitions. Word has length 81 [2024-11-08 19:15:22,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:22,982 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 539 transitions. [2024-11-08 19:15:22,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 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-08 19:15:22,982 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 539 transitions. [2024-11-08 19:15:22,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-08 19:15:22,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:22,984 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:15:22,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 19:15:22,984 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:22,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:22,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1661938180, now seen corresponding path program 1 times [2024-11-08 19:15:22,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:22,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971086112] [2024-11-08 19:15:22,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:22,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:23,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:23,668 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:23,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:23,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971086112] [2024-11-08 19:15:23,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971086112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:23,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:23,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 19:15:23,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177634019] [2024-11-08 19:15:23,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:23,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 19:15:23,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:23,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 19:15:23,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-08 19:15:23,672 INFO L87 Difference]: Start difference. First operand 384 states and 539 transitions. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 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-08 19:15:24,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:24,014 INFO L93 Difference]: Finished difference Result 967 states and 1369 transitions. [2024-11-08 19:15:24,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 19:15:24,015 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 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-08 19:15:24,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:24,019 INFO L225 Difference]: With dead ends: 967 [2024-11-08 19:15:24,020 INFO L226 Difference]: Without dead ends: 743 [2024-11-08 19:15:24,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2024-11-08 19:15:24,021 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 152 mSDsluCounter, 2182 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 2413 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:24,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 2413 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 19:15:24,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2024-11-08 19:15:24,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 620. [2024-11-08 19:15:24,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 619 states have (on average 1.4022617124394183) internal successors, (868), 619 states have internal predecessors, (868), 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-08 19:15:24,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 868 transitions. [2024-11-08 19:15:24,039 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 868 transitions. Word has length 81 [2024-11-08 19:15:24,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:24,039 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 868 transitions. [2024-11-08 19:15:24,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 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-08 19:15:24,039 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 868 transitions. [2024-11-08 19:15:24,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-08 19:15:24,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:24,041 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:15:24,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 19:15:24,042 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:24,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:24,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1776829672, now seen corresponding path program 1 times [2024-11-08 19:15:24,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:24,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594401914] [2024-11-08 19:15:24,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:24,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:24,672 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:24,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:24,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594401914] [2024-11-08 19:15:24,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594401914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:24,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:24,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 19:15:24,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207886000] [2024-11-08 19:15:24,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:24,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 19:15:24,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:24,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 19:15:24,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-08 19:15:24,675 INFO L87 Difference]: Start difference. First operand 620 states and 868 transitions. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 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-08 19:15:24,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:24,847 INFO L93 Difference]: Finished difference Result 1129 states and 1589 transitions. [2024-11-08 19:15:24,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 19:15:24,848 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 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-08 19:15:24,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:24,850 INFO L225 Difference]: With dead ends: 1129 [2024-11-08 19:15:24,851 INFO L226 Difference]: Without dead ends: 652 [2024-11-08 19:15:24,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-08 19:15:24,852 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 81 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1310 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:24,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 1310 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:15:24,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2024-11-08 19:15:24,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 648. [2024-11-08 19:15:24,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 647 states have (on average 1.3848531684698608) internal successors, (896), 647 states have internal predecessors, (896), 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-08 19:15:24,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 896 transitions. [2024-11-08 19:15:24,867 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 896 transitions. Word has length 81 [2024-11-08 19:15:24,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:24,868 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 896 transitions. [2024-11-08 19:15:24,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 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-08 19:15:24,868 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 896 transitions. [2024-11-08 19:15:24,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-08 19:15:24,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:24,870 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:15:24,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 19:15:24,870 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:24,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:24,870 INFO L85 PathProgramCache]: Analyzing trace with hash -66857656, now seen corresponding path program 1 times [2024-11-08 19:15:24,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:24,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987299359] [2024-11-08 19:15:24,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:24,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:25,060 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:25,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:25,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987299359] [2024-11-08 19:15:25,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987299359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:25,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:25,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:15:25,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761661784] [2024-11-08 19:15:25,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:25,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:15:25,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:25,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:15:25,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:15:25,063 INFO L87 Difference]: Start difference. First operand 648 states and 896 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-08 19:15:25,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:25,093 INFO L93 Difference]: Finished difference Result 1067 states and 1487 transitions. [2024-11-08 19:15:25,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:15:25,093 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-08 19:15:25,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:25,096 INFO L225 Difference]: With dead ends: 1067 [2024-11-08 19:15:25,096 INFO L226 Difference]: Without dead ends: 638 [2024-11-08 19:15:25,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:15:25,098 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 51 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:25,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 621 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:15:25,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2024-11-08 19:15:25,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2024-11-08 19:15:25,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 637 states have (on average 1.3720565149136579) internal successors, (874), 637 states have internal predecessors, (874), 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-08 19:15:25,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 874 transitions. [2024-11-08 19:15:25,117 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 874 transitions. Word has length 81 [2024-11-08 19:15:25,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:25,118 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 874 transitions. [2024-11-08 19:15:25,119 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-08 19:15:25,119 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 874 transitions. [2024-11-08 19:15:25,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-08 19:15:25,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:25,121 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:15:25,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 19:15:25,121 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:25,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:25,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1970933155, now seen corresponding path program 1 times [2024-11-08 19:15:25,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:25,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142436805] [2024-11-08 19:15:25,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:25,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:25,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:25,314 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:25,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:25,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142436805] [2024-11-08 19:15:25,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142436805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:25,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:25,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:15:25,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59633313] [2024-11-08 19:15:25,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:25,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:15:25,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:25,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:15:25,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:15:25,318 INFO L87 Difference]: Start difference. First operand 638 states and 874 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-08 19:15:25,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:25,361 INFO L93 Difference]: Finished difference Result 1111 states and 1530 transitions. [2024-11-08 19:15:25,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:15:25,362 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-08 19:15:25,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:25,365 INFO L225 Difference]: With dead ends: 1111 [2024-11-08 19:15:25,365 INFO L226 Difference]: Without dead ends: 636 [2024-11-08 19:15:25,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:15:25,367 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 57 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:25,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 609 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:15:25,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-11-08 19:15:25,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 636. [2024-11-08 19:15:25,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 635 states have (on average 1.368503937007874) internal successors, (869), 635 states have internal predecessors, (869), 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-08 19:15:25,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 869 transitions. [2024-11-08 19:15:25,382 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 869 transitions. Word has length 81 [2024-11-08 19:15:25,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:25,382 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 869 transitions. [2024-11-08 19:15:25,382 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-08 19:15:25,383 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 869 transitions. [2024-11-08 19:15:25,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-08 19:15:25,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:25,384 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:15:25,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 19:15:25,385 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:25,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:25,385 INFO L85 PathProgramCache]: Analyzing trace with hash 94516038, now seen corresponding path program 1 times [2024-11-08 19:15:25,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:25,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378422488] [2024-11-08 19:15:25,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:25,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:26,209 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:26,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:26,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378422488] [2024-11-08 19:15:26,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378422488] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:15:26,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450327279] [2024-11-08 19:15:26,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:26,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:15:26,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:15:26,213 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:15:26,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 19:15:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:26,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 113 conjuncts are in the unsatisfiable core [2024-11-08 19:15:26,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:15:27,842 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:27,842 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:15:30,097 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:30,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450327279] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:15:30,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 19:15:30,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 30, 29] total 68 [2024-11-08 19:15:30,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453705352] [2024-11-08 19:15:30,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 19:15:30,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2024-11-08 19:15:30,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:30,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2024-11-08 19:15:30,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=778, Invalid=3778, Unknown=0, NotChecked=0, Total=4556 [2024-11-08 19:15:30,104 INFO L87 Difference]: Start difference. First operand 636 states and 869 transitions. Second operand has 68 states, 68 states have (on average 3.3676470588235294) internal successors, (229), 68 states have internal predecessors, (229), 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-08 19:15:33,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:33,416 INFO L93 Difference]: Finished difference Result 1436 states and 1999 transitions. [2024-11-08 19:15:33,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-11-08 19:15:33,417 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 3.3676470588235294) internal successors, (229), 68 states have internal predecessors, (229), 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-08 19:15:33,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:33,421 INFO L225 Difference]: With dead ends: 1436 [2024-11-08 19:15:33,421 INFO L226 Difference]: Without dead ends: 1065 [2024-11-08 19:15:33,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4069 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2014, Invalid=11792, Unknown=0, NotChecked=0, Total=13806 [2024-11-08 19:15:33,427 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 1064 mSDsluCounter, 4090 mSDsCounter, 0 mSdLazyCounter, 2101 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1064 SdHoareTripleChecker+Valid, 4211 SdHoareTripleChecker+Invalid, 2123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:33,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1064 Valid, 4211 Invalid, 2123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2101 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 19:15:33,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2024-11-08 19:15:33,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 819. [2024-11-08 19:15:33,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 818 states have (on average 1.385085574572127) internal successors, (1133), 818 states have internal predecessors, (1133), 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-08 19:15:33,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1133 transitions. [2024-11-08 19:15:33,444 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1133 transitions. Word has length 82 [2024-11-08 19:15:33,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:33,445 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1133 transitions. [2024-11-08 19:15:33,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 3.3676470588235294) internal successors, (229), 68 states have internal predecessors, (229), 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-08 19:15:33,445 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1133 transitions. [2024-11-08 19:15:33,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-08 19:15:33,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:33,447 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:15:33,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 19:15:33,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-08 19:15:33,651 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:33,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:33,651 INFO L85 PathProgramCache]: Analyzing trace with hash 765481122, now seen corresponding path program 1 times [2024-11-08 19:15:33,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:33,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936397482] [2024-11-08 19:15:33,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:33,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:33,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:34,047 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:34,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:34,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936397482] [2024-11-08 19:15:34,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936397482] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:15:34,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468153870] [2024-11-08 19:15:34,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:34,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:15:34,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:15:34,050 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:15:34,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 19:15:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:34,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-11-08 19:15:34,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:15:34,748 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:34,748 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:15:35,683 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:35,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468153870] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:15:35,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 19:15:35,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19, 17] total 38 [2024-11-08 19:15:35,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726784926] [2024-11-08 19:15:35,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 19:15:35,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-08 19:15:35,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:35,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-08 19:15:35,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1248, Unknown=0, NotChecked=0, Total=1406 [2024-11-08 19:15:35,686 INFO L87 Difference]: Start difference. First operand 819 states and 1133 transitions. Second operand has 38 states, 38 states have (on average 4.552631578947368) internal successors, (173), 38 states have internal predecessors, (173), 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-08 19:15:36,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:36,634 INFO L93 Difference]: Finished difference Result 2425 states and 3368 transitions. [2024-11-08 19:15:36,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-08 19:15:36,635 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 4.552631578947368) internal successors, (173), 38 states have internal predecessors, (173), 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-08 19:15:36,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:36,640 INFO L225 Difference]: With dead ends: 2425 [2024-11-08 19:15:36,640 INFO L226 Difference]: Without dead ends: 1645 [2024-11-08 19:15:36,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 135 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=423, Invalid=3359, Unknown=0, NotChecked=0, Total=3782 [2024-11-08 19:15:36,644 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 524 mSDsluCounter, 2948 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 3087 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:36,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 3087 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 19:15:36,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states. [2024-11-08 19:15:36,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1564. [2024-11-08 19:15:36,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1564 states, 1563 states have (on average 1.3742802303262955) internal successors, (2148), 1563 states have internal predecessors, (2148), 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-08 19:15:36,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 2148 transitions. [2024-11-08 19:15:36,680 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 2148 transitions. Word has length 82 [2024-11-08 19:15:36,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:36,681 INFO L471 AbstractCegarLoop]: Abstraction has 1564 states and 2148 transitions. [2024-11-08 19:15:36,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 4.552631578947368) internal successors, (173), 38 states have internal predecessors, (173), 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-08 19:15:36,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 2148 transitions. [2024-11-08 19:15:36,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-08 19:15:36,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:36,684 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:15:36,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 19:15:36,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:15:36,889 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:36,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:36,889 INFO L85 PathProgramCache]: Analyzing trace with hash -6288752, now seen corresponding path program 1 times [2024-11-08 19:15:36,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:36,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831516325] [2024-11-08 19:15:36,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:36,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:37,681 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:37,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:37,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831516325] [2024-11-08 19:15:37,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831516325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:37,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:37,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 19:15:37,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399339931] [2024-11-08 19:15:37,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:37,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 19:15:37,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:37,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 19:15:37,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2024-11-08 19:15:37,683 INFO L87 Difference]: Start difference. First operand 1564 states and 2148 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 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-08 19:15:38,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:38,079 INFO L93 Difference]: Finished difference Result 2711 states and 3753 transitions. [2024-11-08 19:15:38,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 19:15:38,079 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 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-08 19:15:38,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:38,085 INFO L225 Difference]: With dead ends: 2711 [2024-11-08 19:15:38,085 INFO L226 Difference]: Without dead ends: 1596 [2024-11-08 19:15:38,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2024-11-08 19:15:38,087 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 124 mSDsluCounter, 1705 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1849 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:38,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 1849 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 19:15:38,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2024-11-08 19:15:38,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1568. [2024-11-08 19:15:38,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1567 states have (on average 1.3733248245054244) internal successors, (2152), 1567 states have internal predecessors, (2152), 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-08 19:15:38,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2152 transitions. [2024-11-08 19:15:38,121 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2152 transitions. Word has length 82 [2024-11-08 19:15:38,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:38,121 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2152 transitions. [2024-11-08 19:15:38,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 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-08 19:15:38,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2152 transitions. [2024-11-08 19:15:38,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-08 19:15:38,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:38,124 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:15:38,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-08 19:15:38,125 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:38,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:38,125 INFO L85 PathProgramCache]: Analyzing trace with hash -231925111, now seen corresponding path program 1 times [2024-11-08 19:15:38,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:38,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784641625] [2024-11-08 19:15:38,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:38,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:38,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:39,257 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:39,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:39,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784641625] [2024-11-08 19:15:39,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784641625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:39,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:39,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-08 19:15:39,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227646549] [2024-11-08 19:15:39,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:39,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 19:15:39,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:39,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 19:15:39,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-11-08 19:15:39,261 INFO L87 Difference]: Start difference. First operand 1568 states and 2152 transitions. Second operand has 16 states, 16 states have (on average 5.125) internal successors, (82), 16 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-08 19:15:39,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:39,706 INFO L93 Difference]: Finished difference Result 2679 states and 3709 transitions. [2024-11-08 19:15:39,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 19:15:39,706 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 16 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-08 19:15:39,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:39,712 INFO L225 Difference]: With dead ends: 2679 [2024-11-08 19:15:39,713 INFO L226 Difference]: Without dead ends: 1600 [2024-11-08 19:15:39,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2024-11-08 19:15:39,717 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 98 mSDsluCounter, 1674 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1830 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:39,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 1830 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 19:15:39,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2024-11-08 19:15:39,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1572. [2024-11-08 19:15:39,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1571 states have (on average 1.372374283895608) internal successors, (2156), 1571 states have internal predecessors, (2156), 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-08 19:15:39,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2156 transitions. [2024-11-08 19:15:39,758 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2156 transitions. Word has length 82 [2024-11-08 19:15:39,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:39,759 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2156 transitions. [2024-11-08 19:15:39,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 16 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-08 19:15:39,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2156 transitions. [2024-11-08 19:15:39,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-08 19:15:39,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:39,763 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:15:39,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-08 19:15:39,764 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:39,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:39,765 INFO L85 PathProgramCache]: Analyzing trace with hash 861498717, now seen corresponding path program 1 times [2024-11-08 19:15:39,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:39,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736246303] [2024-11-08 19:15:39,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:39,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:39,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:39,965 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:39,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:39,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736246303] [2024-11-08 19:15:39,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736246303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:39,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:39,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:15:39,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567075104] [2024-11-08 19:15:39,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:39,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:15:39,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:39,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:15:39,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:15:39,966 INFO L87 Difference]: Start difference. First operand 1572 states and 2156 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 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-08 19:15:40,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:40,018 INFO L93 Difference]: Finished difference Result 2651 states and 3669 transitions. [2024-11-08 19:15:40,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:15:40,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 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-08 19:15:40,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:40,023 INFO L225 Difference]: With dead ends: 2651 [2024-11-08 19:15:40,023 INFO L226 Difference]: Without dead ends: 1358 [2024-11-08 19:15:40,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:15:40,025 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 53 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:40,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 610 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:15:40,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2024-11-08 19:15:40,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1358. [2024-11-08 19:15:40,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1358 states, 1357 states have (on average 1.3809874723655122) internal successors, (1874), 1357 states have internal predecessors, (1874), 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-08 19:15:40,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1874 transitions. [2024-11-08 19:15:40,059 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1874 transitions. Word has length 82 [2024-11-08 19:15:40,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:40,059 INFO L471 AbstractCegarLoop]: Abstraction has 1358 states and 1874 transitions. [2024-11-08 19:15:40,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 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-08 19:15:40,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1874 transitions. [2024-11-08 19:15:40,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-08 19:15:40,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:40,061 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:15:40,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-08 19:15:40,061 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:40,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:40,062 INFO L85 PathProgramCache]: Analyzing trace with hash 199575100, now seen corresponding path program 1 times [2024-11-08 19:15:40,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:40,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095811542] [2024-11-08 19:15:40,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:40,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:40,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:15:40,150 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:15:40,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:15:40,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 19:15:40,289 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 19:15:40,290 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 19:15:40,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-08 19:15:40,294 INFO L407 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-08 19:15:40,371 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 19:15:40,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:15:40 BoogieIcfgContainer [2024-11-08 19:15:40,376 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 19:15:40,377 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:15:40,377 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:15:40,378 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:15:40,378 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:15:09" (3/4) ... [2024-11-08 19:15:40,380 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 19:15:40,381 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:15:40,382 INFO L158 Benchmark]: Toolchain (without parser) took 32830.58ms. Allocated memory was 140.5MB in the beginning and 734.0MB in the end (delta: 593.5MB). Free memory was 87.2MB in the beginning and 355.5MB in the end (delta: -268.4MB). Peak memory consumption was 330.1MB. Max. memory is 16.1GB. [2024-11-08 19:15:40,382 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 140.5MB. Free memory is still 107.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:15:40,382 INFO L158 Benchmark]: CACSL2BoogieTranslator took 390.84ms. Allocated memory is still 140.5MB. Free memory was 86.8MB in the beginning and 69.6MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 19:15:40,383 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.51ms. Allocated memory is still 140.5MB. Free memory was 69.6MB in the beginning and 59.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 19:15:40,383 INFO L158 Benchmark]: Boogie Preprocessor took 125.69ms. Allocated memory is still 140.5MB. Free memory was 59.1MB in the beginning and 53.2MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 19:15:40,383 INFO L158 Benchmark]: RCFGBuilder took 1004.12ms. Allocated memory is still 140.5MB. Free memory was 53.2MB in the beginning and 65.5MB in the end (delta: -12.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-08 19:15:40,384 INFO L158 Benchmark]: TraceAbstraction took 31207.53ms. Allocated memory was 140.5MB in the beginning and 734.0MB in the end (delta: 593.5MB). Free memory was 64.8MB in the beginning and 355.5MB in the end (delta: -290.7MB). Peak memory consumption was 306.9MB. Max. memory is 16.1GB. [2024-11-08 19:15:40,384 INFO L158 Benchmark]: Witness Printer took 4.39ms. Allocated memory is still 734.0MB. Free memory is still 355.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:15:40,385 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.13ms. Allocated memory is still 140.5MB. Free memory is still 107.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 390.84ms. Allocated memory is still 140.5MB. Free memory was 86.8MB in the beginning and 69.6MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.51ms. Allocated memory is still 140.5MB. Free memory was 69.6MB in the beginning and 59.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 125.69ms. Allocated memory is still 140.5MB. Free memory was 59.1MB in the beginning and 53.2MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1004.12ms. Allocated memory is still 140.5MB. Free memory was 53.2MB in the beginning and 65.5MB in the end (delta: -12.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 31207.53ms. Allocated memory was 140.5MB in the beginning and 734.0MB in the end (delta: 593.5MB). Free memory was 64.8MB in the beginning and 355.5MB in the end (delta: -290.7MB). Peak memory consumption was 306.9MB. Max. memory is 16.1GB. * Witness Printer took 4.39ms. Allocated memory is still 734.0MB. Free memory is still 355.5MB. 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 bitwiseOr at line 106, overapproximation of bitwiseAnd at line 111. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 3); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (3 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 8); [L33] const SORT_12 msb_SORT_12 = (SORT_12)1 << (8 - 1); [L35] const SORT_3 var_14 = 0; [L36] const SORT_3 var_29 = 1; [L38] SORT_1 input_2; [L39] SORT_3 input_4; [L40] SORT_3 input_5; [L41] SORT_3 input_6; [L42] SORT_3 input_7; [L43] SORT_3 input_8; [L44] SORT_3 input_9; [L45] SORT_3 input_10; [L46] SORT_3 input_11; [L47] SORT_12 input_13; [L48] SORT_12 input_33; [L49] SORT_12 input_35; [L50] SORT_3 input_37; [L51] SORT_3 input_39; [L52] SORT_12 input_97; [L53] SORT_3 input_99; [L54] SORT_1 input_102; [L55] SORT_3 input_104; [L56] SORT_3 input_106; [L57] SORT_3 input_108; [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, var_14=0, var_29=1] [L59] SORT_3 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, var_14=0, var_29=1] [L60] SORT_3 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, var_14=0, var_29=1] [L61] SORT_3 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, var_14=0, var_29=1] [L62] SORT_3 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L64] SORT_3 init_16_arg_1 = var_14; [L65] state_15 = init_16_arg_1 [L66] SORT_3 init_18_arg_1 = var_14; [L67] state_17 = init_18_arg_1 [L68] SORT_3 init_21_arg_1 = var_14; [L69] state_20 = init_21_arg_1 [L70] SORT_3 init_25_arg_1 = var_14; [L71] state_24 = init_25_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_29=1] [L74] input_2 = __VERIFIER_nondet_uchar() [L75] input_4 = __VERIFIER_nondet_uchar() [L76] input_5 = __VERIFIER_nondet_uchar() [L77] input_6 = __VERIFIER_nondet_uchar() [L78] input_7 = __VERIFIER_nondet_uchar() [L79] input_8 = __VERIFIER_nondet_uchar() [L80] input_9 = __VERIFIER_nondet_uchar() [L81] input_10 = __VERIFIER_nondet_uchar() [L82] input_11 = __VERIFIER_nondet_uchar() [L83] input_13 = __VERIFIER_nondet_uchar() [L84] input_33 = __VERIFIER_nondet_uchar() [L85] input_35 = __VERIFIER_nondet_uchar() [L86] input_37 = __VERIFIER_nondet_uchar() [L87] input_39 = __VERIFIER_nondet_uchar() [L88] input_97 = __VERIFIER_nondet_uchar() [L89] input_99 = __VERIFIER_nondet_uchar() [L90] input_102 = __VERIFIER_nondet_uchar() [L91] input_104 = __VERIFIER_nondet_uchar() [L92] input_106 = __VERIFIER_nondet_uchar() [L93] input_108 = __VERIFIER_nondet_uchar() [L96] SORT_3 var_19_arg_0 = state_15; [L97] SORT_3 var_19_arg_1 = state_17; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_19_arg_0=0, var_19_arg_1=0, var_29=1] [L98] EXPR var_19_arg_0 | var_19_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_29=1] [L98] SORT_3 var_19 = var_19_arg_0 | var_19_arg_1; [L99] SORT_3 var_22_arg_0 = var_19; [L100] SORT_3 var_22_arg_1 = state_20; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_22_arg_0=0, var_22_arg_1=0, var_29=1] [L101] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_29=1] [L101] SORT_3 var_22 = var_22_arg_0 | var_22_arg_1; [L102] SORT_3 var_23_arg_0 = var_22; [L103] SORT_3 var_23 = ~var_23_arg_0; [L104] SORT_3 var_26_arg_0 = var_23; [L105] SORT_3 var_26_arg_1 = state_24; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_26_arg_0=-1, var_26_arg_1=0, var_29=1] [L106] EXPR var_26_arg_0 | var_26_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1] [L106] SORT_3 var_26 = var_26_arg_0 | var_26_arg_1; [L107] SORT_3 var_30_arg_0 = var_26; [L108] SORT_3 var_30 = ~var_30_arg_0; [L109] SORT_3 var_31_arg_0 = var_29; [L110] SORT_3 var_31_arg_1 = var_30; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_31_arg_0=1, var_31_arg_1=-256] [L111] EXPR var_31_arg_0 & var_31_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1] [L111] SORT_3 var_31 = var_31_arg_0 & var_31_arg_1; [L112] EXPR var_31 & mask_SORT_3 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1] [L112] var_31 = var_31 & mask_SORT_3 [L113] SORT_3 bad_32_arg_0 = var_31; [L114] CALL __VERIFIER_assert(!(bad_32_arg_0)) [L21] COND FALSE !(!(cond)) [L114] RET __VERIFIER_assert(!(bad_32_arg_0)) [L116] SORT_3 var_41_arg_0 = state_17; [L117] SORT_3 var_41 = ~var_41_arg_0; [L118] SORT_3 var_42_arg_0 = state_15; [L119] SORT_3 var_42 = ~var_42_arg_0; [L120] SORT_3 var_43_arg_0 = var_42; [L121] SORT_3 var_43_arg_1 = state_20; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_41=-1, var_42=-1, var_43_arg_0=-1, var_43_arg_1=0] [L122] EXPR var_43_arg_0 & var_43_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_41=-1, var_42=-1] [L122] SORT_3 var_43 = var_43_arg_0 & var_43_arg_1; [L123] SORT_3 var_44_arg_0 = var_43; [L124] SORT_3 var_44 = ~var_44_arg_0; [L125] SORT_3 var_45_arg_0 = var_41; [L126] SORT_3 var_45_arg_1 = var_44; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_42=-1, var_45_arg_0=-1, var_45_arg_1=-1] [L127] EXPR var_45_arg_0 | var_45_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_42=-1] [L127] SORT_3 var_45 = var_45_arg_0 | var_45_arg_1; [L128] SORT_3 var_46_arg_0 = var_45; [L129] SORT_3 var_46 = ~var_46_arg_0; [L130] SORT_3 var_47_arg_0 = state_17; [L131] SORT_3 var_47_arg_1 = state_20; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_42=-1, var_46=-256, var_47_arg_0=0, var_47_arg_1=0] [L132] EXPR var_47_arg_0 & var_47_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_42=-1, var_46=-256] [L132] SORT_3 var_47 = var_47_arg_0 & var_47_arg_1; [L133] SORT_3 var_48_arg_0 = var_42; [L134] SORT_3 var_48_arg_1 = var_47; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_46=-256, var_48_arg_0=-1, var_48_arg_1=0] [L135] EXPR var_48_arg_0 | var_48_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_46=-256] [L135] SORT_3 var_48 = var_48_arg_0 | var_48_arg_1; [L136] SORT_3 var_49_arg_0 = var_48; [L137] SORT_3 var_49 = ~var_49_arg_0; [L138] SORT_3 var_50_arg_0 = var_46; [L139] SORT_3 var_50_arg_1 = var_49; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_50_arg_0=-256, var_50_arg_1=-256] [L140] EXPR var_50_arg_0 | var_50_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1] [L140] SORT_3 var_50 = var_50_arg_0 | var_50_arg_1; [L141] SORT_3 next_110_arg_1 = var_50; [L142] SORT_3 var_52_arg_0 = state_20; [L143] SORT_3 var_52 = ~var_52_arg_0; [L144] SORT_3 var_53_arg_0 = state_17; [L145] SORT_3 var_53_arg_1 = var_52; VAL [mask_SORT_3=1, next_110_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_53_arg_0=0, var_53_arg_1=-1] [L146] EXPR var_53_arg_0 | var_53_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1] [L146] SORT_3 var_53 = var_53_arg_0 | var_53_arg_1; [L147] SORT_3 var_54_arg_0 = state_17; [L148] SORT_3 var_54_arg_1 = var_52; VAL [mask_SORT_3=1, next_110_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_53=255, var_54_arg_0=0, var_54_arg_1=-1] [L149] EXPR var_54_arg_0 & var_54_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_53=255] [L149] SORT_3 var_54 = var_54_arg_0 & var_54_arg_1; [L150] SORT_3 var_55_arg_0 = var_54; [L151] SORT_3 var_55 = ~var_55_arg_0; [L152] SORT_3 var_56_arg_0 = var_53; [L153] SORT_3 var_56_arg_1 = var_55; VAL [mask_SORT_3=1, next_110_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_56_arg_0=255, var_56_arg_1=-1] [L154] EXPR var_56_arg_0 & var_56_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1] [L154] SORT_3 var_56 = var_56_arg_0 & var_56_arg_1; [L155] SORT_3 var_57_arg_0 = var_56; [L156] SORT_3 var_57 = ~var_57_arg_0; [L157] SORT_3 next_111_arg_1 = var_57; [L158] SORT_1 var_59_arg_0 = input_2; [L159] SORT_3 var_59 = var_59_arg_0 >> 0; [L160] SORT_1 var_60_arg_0 = input_2; [L161] SORT_3 var_60 = var_60_arg_0 >> 2; [L162] SORT_3 var_61_arg_0 = var_60; [L163] SORT_3 var_61 = ~var_61_arg_0; [L164] SORT_1 var_62_arg_0 = input_2; [L165] SORT_3 var_62 = var_62_arg_0 >> 1; [L166] SORT_3 var_63_arg_0 = var_61; [L167] SORT_3 var_63_arg_1 = var_62; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_59=0, var_63_arg_0=-1, var_63_arg_1=0] [L168] EXPR var_63_arg_0 | var_63_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_59=0] [L168] SORT_3 var_63 = var_63_arg_0 | var_63_arg_1; [L169] SORT_3 var_64_arg_0 = var_59; [L170] SORT_3 var_64_arg_1 = var_63; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_59=0, var_63=255, var_64_arg_0=0, var_64_arg_1=255] [L171] EXPR var_64_arg_0 | var_64_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_59=0, var_63=255] [L171] SORT_3 var_64 = var_64_arg_0 | var_64_arg_1; [L172] SORT_3 var_65_arg_0 = var_64; [L173] SORT_3 var_65 = ~var_65_arg_0; [L174] SORT_3 var_66_arg_0 = state_15; [L175] SORT_3 var_66_arg_1 = state_17; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_20=0, var_29=1, var_52=-1, var_59=0, var_63=255, var_65=-256, var_66_arg_0=0, var_66_arg_1=0] [L176] EXPR var_66_arg_0 | var_66_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_20=0, var_29=1, var_52=-1, var_59=0, var_63=255, var_65=-256] [L176] SORT_3 var_66 = var_66_arg_0 | var_66_arg_1; [L177] SORT_3 var_67_arg_0 = var_65; [L178] SORT_3 var_67_arg_1 = var_66; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_20=0, var_29=1, var_52=-1, var_59=0, var_63=255, var_66=0, var_67_arg_0=-256, var_67_arg_1=0] [L179] EXPR var_67_arg_0 | var_67_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_20=0, var_29=1, var_52=-1, var_59=0, var_63=255, var_66=0] [L179] SORT_3 var_67 = var_67_arg_0 | var_67_arg_1; [L180] SORT_3 var_68_arg_0 = var_67; [L181] SORT_3 var_68_arg_1 = var_52; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_20=0, var_29=1, var_59=0, var_63=255, var_66=0, var_68_arg_0=0, var_68_arg_1=-1] [L182] EXPR var_68_arg_0 & var_68_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_20=0, var_29=1, var_59=0, var_63=255, var_66=0] [L182] SORT_3 var_68 = var_68_arg_0 & var_68_arg_1; [L183] SORT_3 next_112_arg_1 = var_68; [L184] SORT_3 var_75_arg_0 = state_20; [L185] SORT_3 var_75_arg_1 = var_66; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_59=0, var_63=255, var_75_arg_0=0, var_75_arg_1=0] [L186] EXPR var_75_arg_0 | var_75_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_59=0, var_63=255] [L186] SORT_3 var_75 = var_75_arg_0 | var_75_arg_1; [L187] SORT_3 var_76_arg_0 = var_75; [L188] SORT_3 var_76 = ~var_76_arg_0; [L189] SORT_3 var_77_arg_0 = var_59; [L190] SORT_3 var_77_arg_1 = var_76; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_63=255, var_76=-1, var_77_arg_0=0, var_77_arg_1=-1] [L191] EXPR var_77_arg_0 & var_77_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_63=255, var_76=-1] [L191] SORT_3 var_77 = var_77_arg_0 & var_77_arg_1; [L192] SORT_3 var_78_arg_0 = var_77; [L193] SORT_3 var_78 = ~var_78_arg_0; [L194] SORT_3 var_82_arg_0 = var_63; [L195] SORT_3 var_82_arg_1 = var_76; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_78=-1, var_82_arg_0=255, var_82_arg_1=-1] [L196] EXPR var_82_arg_0 & var_82_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_78=-1] [L196] SORT_3 var_82 = var_82_arg_0 & var_82_arg_1; [L197] SORT_3 var_91_arg_0 = var_82; [L198] SORT_3 var_91 = ~var_91_arg_0; [L199] SORT_3 var_92_arg_0 = var_78; [L200] SORT_3 var_92_arg_1 = var_91; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_92_arg_0=-1, var_92_arg_1=-256] [L201] EXPR var_92_arg_0 & var_92_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1] [L201] SORT_3 var_92 = var_92_arg_0 & var_92_arg_1; [L202] SORT_3 var_94_arg_0 = input_4; [L203] SORT_3 var_94_arg_1 = var_92; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_94_arg_0=254, var_94_arg_1=0] [L204] EXPR var_94_arg_0 | var_94_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1] [L204] SORT_3 var_94 = var_94_arg_0 | var_94_arg_1; [L205] SORT_3 var_95_arg_0 = var_94; [L206] SORT_3 var_95 = ~var_95_arg_0; [L207] SORT_3 next_113_arg_1 = var_95; [L209] state_15 = next_110_arg_1 [L210] state_17 = next_111_arg_1 [L211] state_20 = next_112_arg_1 [L212] state_24 = next_113_arg_1 [L74] input_2 = __VERIFIER_nondet_uchar() [L75] input_4 = __VERIFIER_nondet_uchar() [L76] input_5 = __VERIFIER_nondet_uchar() [L77] input_6 = __VERIFIER_nondet_uchar() [L78] input_7 = __VERIFIER_nondet_uchar() [L79] input_8 = __VERIFIER_nondet_uchar() [L80] input_9 = __VERIFIER_nondet_uchar() [L81] input_10 = __VERIFIER_nondet_uchar() [L82] input_11 = __VERIFIER_nondet_uchar() [L83] input_13 = __VERIFIER_nondet_uchar() [L84] input_33 = __VERIFIER_nondet_uchar() [L85] input_35 = __VERIFIER_nondet_uchar() [L86] input_37 = __VERIFIER_nondet_uchar() [L87] input_39 = __VERIFIER_nondet_uchar() [L88] input_97 = __VERIFIER_nondet_uchar() [L89] input_99 = __VERIFIER_nondet_uchar() [L90] input_102 = __VERIFIER_nondet_uchar() [L91] input_104 = __VERIFIER_nondet_uchar() [L92] input_106 = __VERIFIER_nondet_uchar() [L93] input_108 = __VERIFIER_nondet_uchar() [L96] SORT_3 var_19_arg_0 = state_15; [L97] SORT_3 var_19_arg_1 = state_17; VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, state_24=-255, var_19_arg_0=0, var_19_arg_1=-256, var_29=1] [L98] EXPR var_19_arg_0 | var_19_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, state_24=-255, var_29=1] [L98] SORT_3 var_19 = var_19_arg_0 | var_19_arg_1; [L99] SORT_3 var_22_arg_0 = var_19; [L100] SORT_3 var_22_arg_1 = state_20; VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, state_24=-255, var_22_arg_0=0, var_22_arg_1=0, var_29=1] [L101] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, state_24=-255, var_29=1] [L101] SORT_3 var_22 = var_22_arg_0 | var_22_arg_1; [L102] SORT_3 var_23_arg_0 = var_22; [L103] SORT_3 var_23 = ~var_23_arg_0; [L104] SORT_3 var_26_arg_0 = var_23; [L105] SORT_3 var_26_arg_1 = state_24; VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, var_26_arg_0=-1, var_26_arg_1=-255, var_29=1] [L106] EXPR var_26_arg_0 | var_26_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, var_29=1] [L106] SORT_3 var_26 = var_26_arg_0 | var_26_arg_1; [L107] SORT_3 var_30_arg_0 = var_26; [L108] SORT_3 var_30 = ~var_30_arg_0; [L109] SORT_3 var_31_arg_0 = var_29; [L110] SORT_3 var_31_arg_1 = var_30; VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, var_29=1, var_31_arg_0=1, var_31_arg_1=-1] [L111] EXPR var_31_arg_0 & var_31_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, var_29=1] [L111] SORT_3 var_31 = var_31_arg_0 & var_31_arg_1; [L112] EXPR var_31 & mask_SORT_3 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, var_29=1] [L112] var_31 = var_31 & mask_SORT_3 [L113] SORT_3 bad_32_arg_0 = var_31; [L114] CALL __VERIFIER_assert(!(bad_32_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 118 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.1s, OverallIterations: 27, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3264 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3264 mSDsluCounter, 36112 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31887 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6436 IncrementalHoareTripleChecker+Invalid, 6502 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 4225 mSDtfsCounter, 6436 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 896 GetRequests, 449 SyntacticMatches, 4 SemanticMatches, 443 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5873 ImplicationChecksByTransitivity, 8.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1572occurred in iteration=25, InterpolantAutomatonStates: 320, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 26 MinimizatonAttempts, 930 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 17.5s InterpolantComputationTime, 2079 NumberOfCodeBlocks, 2079 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2209 ConstructedInterpolants, 0 QuantifiedInterpolants, 10642 SizeOfPredicates, 26 NumberOfNonLiveVariables, 1352 ConjunctsInSsa, 250 ConjunctsInUnsatCore, 32 InterpolantComputations, 24 PerfectInterpolantSequences, 294/319 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-08 19:15:40,419 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.vis_QF_BV_s1269b_p4.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 cc15dd8c58787d1f6894f4700fb98e0d8cb8608f1a57f24801c50df888951e5d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:15:42,668 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:15:42,754 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-08 19:15:42,761 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:15:42,762 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:15:42,791 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:15:42,792 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:15:42,792 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:15:42,793 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:15:42,793 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:15:42,793 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:15:42,794 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:15:42,795 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:15:42,796 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:15:42,796 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:15:42,797 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:15:42,797 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:15:42,797 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:15:42,799 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:15:42,800 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:15:42,802 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:15:42,803 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 19:15:42,804 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 19:15:42,804 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:15:42,804 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 19:15:42,804 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:15:42,804 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:15:42,805 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:15:42,805 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:15:42,805 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:15:42,805 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:15:42,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:15:42,806 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:15:42,806 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:15:42,806 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:15:42,807 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 19:15:42,807 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 19:15:42,808 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:15:42,809 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:15:42,809 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:15:42,809 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:15:42,810 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 -> cc15dd8c58787d1f6894f4700fb98e0d8cb8608f1a57f24801c50df888951e5d [2024-11-08 19:15:43,164 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:15:43,192 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:15:43,195 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:15:43,197 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:15:43,197 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:15:43,199 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c [2024-11-08 19:15:44,814 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:15:45,048 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:15:45,048 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c [2024-11-08 19:15:45,063 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78aef2f24/089d902d07734c05a9f9db6654fce09c/FLAGe38695bd8 [2024-11-08 19:15:45,077 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78aef2f24/089d902d07734c05a9f9db6654fce09c [2024-11-08 19:15:45,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:15:45,081 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:15:45,083 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:15:45,084 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:15:45,089 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:15:45,090 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:15:45" (1/1) ... [2024-11-08 19:15:45,091 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4491f03b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:45, skipping insertion in model container [2024-11-08 19:15:45,091 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:15:45" (1/1) ... [2024-11-08 19:15:45,124 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:15:45,330 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.vis_QF_BV_s1269b_p4.c[1259,1272] [2024-11-08 19:15:45,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:15:45,435 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:15:45,447 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.vis_QF_BV_s1269b_p4.c[1259,1272] [2024-11-08 19:15:45,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:15:45,523 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:15:45,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:45 WrapperNode [2024-11-08 19:15:45,524 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:15:45,525 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:15:45,525 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:15:45,525 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:15:45,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:45" (1/1) ... [2024-11-08 19:15:45,545 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:45" (1/1) ... [2024-11-08 19:15:45,578 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 242 [2024-11-08 19:15:45,581 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:15:45,582 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:15:45,582 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:15:45,582 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:15:45,593 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:45" (1/1) ... [2024-11-08 19:15:45,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:45" (1/1) ... [2024-11-08 19:15:45,612 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:45" (1/1) ... [2024-11-08 19:15:45,634 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-08 19:15:45,635 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:45" (1/1) ... [2024-11-08 19:15:45,635 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:45" (1/1) ... [2024-11-08 19:15:45,641 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:45" (1/1) ... [2024-11-08 19:15:45,644 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:45" (1/1) ... [2024-11-08 19:15:45,646 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:45" (1/1) ... [2024-11-08 19:15:45,647 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:45" (1/1) ... [2024-11-08 19:15:45,651 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:15:45,652 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:15:45,656 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:15:45,656 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:15:45,657 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:45" (1/1) ... [2024-11-08 19:15:45,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:15:45,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:15:45,706 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-08 19:15:45,709 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-08 19:15:45,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:15:45,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 19:15:45,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:15:45,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:15:45,853 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:15:45,855 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:15:46,170 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-11-08 19:15:46,173 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:15:46,185 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:15:46,187 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:15:46,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:15:46 BoogieIcfgContainer [2024-11-08 19:15:46,187 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:15:46,189 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:15:46,189 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:15:46,193 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:15:46,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:15:45" (1/3) ... [2024-11-08 19:15:46,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@560f5436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:15:46, skipping insertion in model container [2024-11-08 19:15:46,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:45" (2/3) ... [2024-11-08 19:15:46,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@560f5436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:15:46, skipping insertion in model container [2024-11-08 19:15:46,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:15:46" (3/3) ... [2024-11-08 19:15:46,197 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_s1269b_p4.c [2024-11-08 19:15:46,215 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:15:46,216 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:15:46,281 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:15:46,288 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;@695345f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:15:46,288 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:15:46,291 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-08 19:15:46,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 19:15:46,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:46,296 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-08 19:15:46,296 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:46,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:46,302 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-08 19:15:46,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:15:46,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1587114407] [2024-11-08 19:15:46,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:46,318 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-08 19:15:46,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:15:46,321 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-08 19:15:46,323 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-08 19:15:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:46,465 WARN L253 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-08 19:15:46,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:15:46,719 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-08 19:15:46,719 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:15:46,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:15:46,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1587114407] [2024-11-08 19:15:46,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1587114407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:46,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:46,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:15:46,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928618843] [2024-11-08 19:15:46,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:46,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:15:46,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:15:46,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:15:46,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:15:46,754 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-08 19:15:46,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:46,799 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-08 19:15:46,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:15:46,803 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-08 19:15:46,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:46,810 INFO L225 Difference]: With dead ends: 18 [2024-11-08 19:15:46,810 INFO L226 Difference]: Without dead ends: 10 [2024-11-08 19:15:46,813 INFO L431 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-08 19:15:46,818 INFO L432 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-08 19:15:46,819 INFO L433 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-08 19:15:46,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-08 19:15:46,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-08 19:15:46,849 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-08 19:15:46,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-08 19:15:46,851 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-08 19:15:46,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:46,852 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-08 19:15:46,852 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-08 19:15:46,852 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-08 19:15:46,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 19:15:46,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:46,853 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-08 19:15:46,857 INFO L552 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)] Ended with exit code 0 [2024-11-08 19:15:47,054 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-08 19:15:47,054 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:47,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:47,055 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-08 19:15:47,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:15:47,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [147289220] [2024-11-08 19:15:47,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:47,057 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-08 19:15:47,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:15:47,060 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-08 19:15:47,063 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-08 19:15:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:15:47,220 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:15:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:15:47,388 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-08 19:15:47,389 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 19:15:47,391 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 19:15:47,398 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 (3)] Forceful destruction successful, exit code 0 [2024-11-08 19:15:47,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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-08 19:15:47,596 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-08 19:15:47,628 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 19:15:47,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:15:47 BoogieIcfgContainer [2024-11-08 19:15:47,634 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 19:15:47,635 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:15:47,635 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:15:47,635 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:15:47,636 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:15:46" (3/4) ... [2024-11-08 19:15:47,637 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 19:15:47,735 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 19:15:47,742 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:15:47,743 INFO L158 Benchmark]: Toolchain (without parser) took 2662.34ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 30.3MB in the beginning and 51.3MB in the end (delta: -21.0MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2024-11-08 19:15:47,743 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 52.4MB. Free memory is still 35.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:15:47,743 INFO L158 Benchmark]: CACSL2BoogieTranslator took 441.18ms. Allocated memory is still 62.9MB. Free memory was 30.1MB in the beginning and 29.0MB in the end (delta: 1.1MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2024-11-08 19:15:47,744 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.39ms. Allocated memory is still 62.9MB. Free memory was 29.0MB in the beginning and 26.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:15:47,744 INFO L158 Benchmark]: Boogie Preprocessor took 69.45ms. Allocated memory is still 62.9MB. Free memory was 26.5MB in the beginning and 40.8MB in the end (delta: -14.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 19:15:47,744 INFO L158 Benchmark]: RCFGBuilder took 535.27ms. Allocated memory is still 62.9MB. Free memory was 40.8MB in the beginning and 35.7MB in the end (delta: 5.1MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. [2024-11-08 19:15:47,744 INFO L158 Benchmark]: TraceAbstraction took 1444.97ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 34.9MB in the beginning and 39.2MB in the end (delta: -4.3MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2024-11-08 19:15:47,745 INFO L158 Benchmark]: Witness Printer took 107.78ms. Allocated memory is still 77.6MB. Free memory was 38.6MB in the beginning and 51.3MB in the end (delta: -12.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 19:15:47,746 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.20ms. Allocated memory is still 52.4MB. Free memory is still 35.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 441.18ms. Allocated memory is still 62.9MB. Free memory was 30.1MB in the beginning and 29.0MB in the end (delta: 1.1MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.39ms. Allocated memory is still 62.9MB. Free memory was 29.0MB in the beginning and 26.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.45ms. Allocated memory is still 62.9MB. Free memory was 26.5MB in the beginning and 40.8MB in the end (delta: -14.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 535.27ms. Allocated memory is still 62.9MB. Free memory was 40.8MB in the beginning and 35.7MB in the end (delta: 5.1MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1444.97ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 34.9MB in the beginning and 39.2MB in the end (delta: -4.3MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Witness Printer took 107.78ms. Allocated memory is still 77.6MB. Free memory was 38.6MB in the beginning and 51.3MB in the end (delta: -12.7MB). Peak memory consumption was 4.2MB. 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 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 3); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (3 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 8); [L33] const SORT_12 msb_SORT_12 = (SORT_12)1 << (8 - 1); [L35] const SORT_3 var_14 = 0; [L36] const SORT_3 var_29 = 1; [L38] SORT_1 input_2; [L39] SORT_3 input_4; [L40] SORT_3 input_5; [L41] SORT_3 input_6; [L42] SORT_3 input_7; [L43] SORT_3 input_8; [L44] SORT_3 input_9; [L45] SORT_3 input_10; [L46] SORT_3 input_11; [L47] SORT_12 input_13; [L48] SORT_12 input_33; [L49] SORT_12 input_35; [L50] SORT_3 input_37; [L51] SORT_3 input_39; [L52] SORT_12 input_97; [L53] SORT_3 input_99; [L54] SORT_1 input_102; [L55] SORT_3 input_104; [L56] SORT_3 input_106; [L57] SORT_3 input_108; [L59] SORT_3 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L60] SORT_3 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L61] SORT_3 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L62] SORT_3 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L64] SORT_3 init_16_arg_1 = var_14; [L65] state_15 = init_16_arg_1 [L66] SORT_3 init_18_arg_1 = var_14; [L67] state_17 = init_18_arg_1 [L68] SORT_3 init_21_arg_1 = var_14; [L69] state_20 = init_21_arg_1 [L70] SORT_3 init_25_arg_1 = var_14; [L71] state_24 = init_25_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_29=1] [L74] input_2 = __VERIFIER_nondet_uchar() [L75] input_4 = __VERIFIER_nondet_uchar() [L76] input_5 = __VERIFIER_nondet_uchar() [L77] input_6 = __VERIFIER_nondet_uchar() [L78] input_7 = __VERIFIER_nondet_uchar() [L79] input_8 = __VERIFIER_nondet_uchar() [L80] input_9 = __VERIFIER_nondet_uchar() [L81] input_10 = __VERIFIER_nondet_uchar() [L82] input_11 = __VERIFIER_nondet_uchar() [L83] input_13 = __VERIFIER_nondet_uchar() [L84] input_33 = __VERIFIER_nondet_uchar() [L85] input_35 = __VERIFIER_nondet_uchar() [L86] input_37 = __VERIFIER_nondet_uchar() [L87] input_39 = __VERIFIER_nondet_uchar() [L88] input_97 = __VERIFIER_nondet_uchar() [L89] input_99 = __VERIFIER_nondet_uchar() [L90] input_102 = __VERIFIER_nondet_uchar() [L91] input_104 = __VERIFIER_nondet_uchar() [L92] input_106 = __VERIFIER_nondet_uchar() [L93] input_108 = __VERIFIER_nondet_uchar() [L96] SORT_3 var_19_arg_0 = state_15; [L97] SORT_3 var_19_arg_1 = state_17; [L98] SORT_3 var_19 = var_19_arg_0 | var_19_arg_1; [L99] SORT_3 var_22_arg_0 = var_19; [L100] SORT_3 var_22_arg_1 = state_20; [L101] SORT_3 var_22 = var_22_arg_0 | var_22_arg_1; [L102] SORT_3 var_23_arg_0 = var_22; [L103] SORT_3 var_23 = ~var_23_arg_0; [L104] SORT_3 var_26_arg_0 = var_23; [L105] SORT_3 var_26_arg_1 = state_24; [L106] SORT_3 var_26 = var_26_arg_0 | var_26_arg_1; [L107] SORT_3 var_30_arg_0 = var_26; [L108] SORT_3 var_30 = ~var_30_arg_0; [L109] SORT_3 var_31_arg_0 = var_29; [L110] SORT_3 var_31_arg_1 = var_30; [L111] SORT_3 var_31 = var_31_arg_0 & var_31_arg_1; [L112] var_31 = var_31 & mask_SORT_3 [L113] SORT_3 bad_32_arg_0 = var_31; [L114] CALL __VERIFIER_assert(!(bad_32_arg_0)) [L21] COND FALSE !(!(cond)) [L114] RET __VERIFIER_assert(!(bad_32_arg_0)) [L116] SORT_3 var_41_arg_0 = state_17; [L117] SORT_3 var_41 = ~var_41_arg_0; [L118] SORT_3 var_42_arg_0 = state_15; [L119] SORT_3 var_42 = ~var_42_arg_0; [L120] SORT_3 var_43_arg_0 = var_42; [L121] SORT_3 var_43_arg_1 = state_20; [L122] SORT_3 var_43 = var_43_arg_0 & var_43_arg_1; [L123] SORT_3 var_44_arg_0 = var_43; [L124] SORT_3 var_44 = ~var_44_arg_0; [L125] SORT_3 var_45_arg_0 = var_41; [L126] SORT_3 var_45_arg_1 = var_44; [L127] SORT_3 var_45 = var_45_arg_0 | var_45_arg_1; [L128] SORT_3 var_46_arg_0 = var_45; [L129] SORT_3 var_46 = ~var_46_arg_0; [L130] SORT_3 var_47_arg_0 = state_17; [L131] SORT_3 var_47_arg_1 = state_20; [L132] SORT_3 var_47 = var_47_arg_0 & var_47_arg_1; [L133] SORT_3 var_48_arg_0 = var_42; [L134] SORT_3 var_48_arg_1 = var_47; [L135] SORT_3 var_48 = var_48_arg_0 | var_48_arg_1; [L136] SORT_3 var_49_arg_0 = var_48; [L137] SORT_3 var_49 = ~var_49_arg_0; [L138] SORT_3 var_50_arg_0 = var_46; [L139] SORT_3 var_50_arg_1 = var_49; [L140] SORT_3 var_50 = var_50_arg_0 | var_50_arg_1; [L141] SORT_3 next_110_arg_1 = var_50; [L142] SORT_3 var_52_arg_0 = state_20; [L143] SORT_3 var_52 = ~var_52_arg_0; [L144] SORT_3 var_53_arg_0 = state_17; [L145] SORT_3 var_53_arg_1 = var_52; [L146] SORT_3 var_53 = var_53_arg_0 | var_53_arg_1; [L147] SORT_3 var_54_arg_0 = state_17; [L148] SORT_3 var_54_arg_1 = var_52; [L149] SORT_3 var_54 = var_54_arg_0 & var_54_arg_1; [L150] SORT_3 var_55_arg_0 = var_54; [L151] SORT_3 var_55 = ~var_55_arg_0; [L152] SORT_3 var_56_arg_0 = var_53; [L153] SORT_3 var_56_arg_1 = var_55; [L154] SORT_3 var_56 = var_56_arg_0 & var_56_arg_1; [L155] SORT_3 var_57_arg_0 = var_56; [L156] SORT_3 var_57 = ~var_57_arg_0; [L157] SORT_3 next_111_arg_1 = var_57; [L158] SORT_1 var_59_arg_0 = input_2; [L159] SORT_3 var_59 = var_59_arg_0 >> 0; [L160] SORT_1 var_60_arg_0 = input_2; [L161] SORT_3 var_60 = var_60_arg_0 >> 2; [L162] SORT_3 var_61_arg_0 = var_60; [L163] SORT_3 var_61 = ~var_61_arg_0; [L164] SORT_1 var_62_arg_0 = input_2; [L165] SORT_3 var_62 = var_62_arg_0 >> 1; [L166] SORT_3 var_63_arg_0 = var_61; [L167] SORT_3 var_63_arg_1 = var_62; [L168] SORT_3 var_63 = var_63_arg_0 | var_63_arg_1; [L169] SORT_3 var_64_arg_0 = var_59; [L170] SORT_3 var_64_arg_1 = var_63; [L171] SORT_3 var_64 = var_64_arg_0 | var_64_arg_1; [L172] SORT_3 var_65_arg_0 = var_64; [L173] SORT_3 var_65 = ~var_65_arg_0; [L174] SORT_3 var_66_arg_0 = state_15; [L175] SORT_3 var_66_arg_1 = state_17; [L176] SORT_3 var_66 = var_66_arg_0 | var_66_arg_1; [L177] SORT_3 var_67_arg_0 = var_65; [L178] SORT_3 var_67_arg_1 = var_66; [L179] SORT_3 var_67 = var_67_arg_0 | var_67_arg_1; [L180] SORT_3 var_68_arg_0 = var_67; [L181] SORT_3 var_68_arg_1 = var_52; [L182] SORT_3 var_68 = var_68_arg_0 & var_68_arg_1; [L183] SORT_3 next_112_arg_1 = var_68; [L184] SORT_3 var_75_arg_0 = state_20; [L185] SORT_3 var_75_arg_1 = var_66; [L186] SORT_3 var_75 = var_75_arg_0 | var_75_arg_1; [L187] SORT_3 var_76_arg_0 = var_75; [L188] SORT_3 var_76 = ~var_76_arg_0; [L189] SORT_3 var_77_arg_0 = var_59; [L190] SORT_3 var_77_arg_1 = var_76; [L191] SORT_3 var_77 = var_77_arg_0 & var_77_arg_1; [L192] SORT_3 var_78_arg_0 = var_77; [L193] SORT_3 var_78 = ~var_78_arg_0; [L194] SORT_3 var_82_arg_0 = var_63; [L195] SORT_3 var_82_arg_1 = var_76; [L196] SORT_3 var_82 = var_82_arg_0 & var_82_arg_1; [L197] SORT_3 var_91_arg_0 = var_82; [L198] SORT_3 var_91 = ~var_91_arg_0; [L199] SORT_3 var_92_arg_0 = var_78; [L200] SORT_3 var_92_arg_1 = var_91; [L201] SORT_3 var_92 = var_92_arg_0 & var_92_arg_1; [L202] SORT_3 var_94_arg_0 = input_4; [L203] SORT_3 var_94_arg_1 = var_92; [L204] SORT_3 var_94 = var_94_arg_0 | var_94_arg_1; [L205] SORT_3 var_95_arg_0 = var_94; [L206] SORT_3 var_95 = ~var_95_arg_0; [L207] SORT_3 next_113_arg_1 = var_95; [L209] state_15 = next_110_arg_1 [L210] state_17 = next_111_arg_1 [L211] state_20 = next_112_arg_1 [L212] state_24 = next_113_arg_1 [L74] input_2 = __VERIFIER_nondet_uchar() [L75] input_4 = __VERIFIER_nondet_uchar() [L76] input_5 = __VERIFIER_nondet_uchar() [L77] input_6 = __VERIFIER_nondet_uchar() [L78] input_7 = __VERIFIER_nondet_uchar() [L79] input_8 = __VERIFIER_nondet_uchar() [L80] input_9 = __VERIFIER_nondet_uchar() [L81] input_10 = __VERIFIER_nondet_uchar() [L82] input_11 = __VERIFIER_nondet_uchar() [L83] input_13 = __VERIFIER_nondet_uchar() [L84] input_33 = __VERIFIER_nondet_uchar() [L85] input_35 = __VERIFIER_nondet_uchar() [L86] input_37 = __VERIFIER_nondet_uchar() [L87] input_39 = __VERIFIER_nondet_uchar() [L88] input_97 = __VERIFIER_nondet_uchar() [L89] input_99 = __VERIFIER_nondet_uchar() [L90] input_102 = __VERIFIER_nondet_uchar() [L91] input_104 = __VERIFIER_nondet_uchar() [L92] input_106 = __VERIFIER_nondet_uchar() [L93] input_108 = __VERIFIER_nondet_uchar() [L96] SORT_3 var_19_arg_0 = state_15; [L97] SORT_3 var_19_arg_1 = state_17; [L98] SORT_3 var_19 = var_19_arg_0 | var_19_arg_1; [L99] SORT_3 var_22_arg_0 = var_19; [L100] SORT_3 var_22_arg_1 = state_20; [L101] SORT_3 var_22 = var_22_arg_0 | var_22_arg_1; [L102] SORT_3 var_23_arg_0 = var_22; [L103] SORT_3 var_23 = ~var_23_arg_0; [L104] SORT_3 var_26_arg_0 = var_23; [L105] SORT_3 var_26_arg_1 = state_24; [L106] SORT_3 var_26 = var_26_arg_0 | var_26_arg_1; [L107] SORT_3 var_30_arg_0 = var_26; [L108] SORT_3 var_30 = ~var_30_arg_0; [L109] SORT_3 var_31_arg_0 = var_29; [L110] SORT_3 var_31_arg_1 = var_30; [L111] SORT_3 var_31 = var_31_arg_0 & var_31_arg_1; [L112] var_31 = var_31 & mask_SORT_3 [L113] SORT_3 bad_32_arg_0 = var_31; [L114] CALL __VERIFIER_assert(!(bad_32_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9 IncrementalHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 4 mSDtfsCounter, 9 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=0, InterpolantAutomatonStates: 4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 13 NumberOfCodeBlocks, 13 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 18 SizeOfPredicates, 4 NumberOfNonLiveVariables, 49 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 proved your program to be incorrect! [2024-11-08 19:15:47,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE