./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label57.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label57.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 44d07c49543a420b190637df21c7e31435249a3781140dab3c41eadeeaf7c396 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 16:21:04,450 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 16:21:04,526 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 16:21:04,533 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 16:21:04,533 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 16:21:04,562 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 16:21:04,562 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 16:21:04,563 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 16:21:04,564 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 16:21:04,565 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 16:21:04,565 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 16:21:04,565 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 16:21:04,566 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 16:21:04,566 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 16:21:04,567 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 16:21:04,567 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 16:21:04,567 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 16:21:04,568 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 16:21:04,568 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 16:21:04,570 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 16:21:04,571 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 16:21:04,574 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 16:21:04,574 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 16:21:04,574 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 16:21:04,575 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 16:21:04,575 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 16:21:04,575 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 16:21:04,575 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 16:21:04,576 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 16:21:04,576 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 16:21:04,576 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 16:21:04,577 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 16:21:04,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:21:04,577 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 16:21:04,577 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 16:21:04,578 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 16:21:04,578 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 16:21:04,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 16:21:04,579 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 16:21:04,579 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 16:21:04,579 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 16:21:04,580 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 16:21:04,580 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 44d07c49543a420b190637df21c7e31435249a3781140dab3c41eadeeaf7c396 [2024-10-12 16:21:04,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 16:21:04,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 16:21:04,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 16:21:04,855 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 16:21:04,855 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 16:21:04,856 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label57.c [2024-10-12 16:21:06,304 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 16:21:06,638 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 16:21:06,638 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label57.c [2024-10-12 16:21:06,662 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd85bba84/6edf64ff98184eac9cf773ef1856282a/FLAG5c347f71b [2024-10-12 16:21:06,681 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd85bba84/6edf64ff98184eac9cf773ef1856282a [2024-10-12 16:21:06,683 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 16:21:06,685 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 16:21:06,688 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 16:21:06,688 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 16:21:06,694 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 16:21:06,695 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:21:06" (1/1) ... [2024-10-12 16:21:06,696 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4adb319c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:21:06, skipping insertion in model container [2024-10-12 16:21:06,696 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:21:06" (1/1) ... [2024-10-12 16:21:06,763 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 16:21:07,034 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label57.c[5113,5126] [2024-10-12 16:21:07,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:21:07,525 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 16:21:07,553 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label57.c[5113,5126] [2024-10-12 16:21:07,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:21:07,807 INFO L204 MainTranslator]: Completed translation [2024-10-12 16:21:07,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:21:07 WrapperNode [2024-10-12 16:21:07,810 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 16:21:07,811 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 16:21:07,811 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 16:21:07,811 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 16:21:07,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:21:07" (1/1) ... [2024-10-12 16:21:07,858 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:21:07" (1/1) ... [2024-10-12 16:21:08,073 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1760 [2024-10-12 16:21:08,074 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 16:21:08,075 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 16:21:08,075 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 16:21:08,075 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 16:21:08,086 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:21:07" (1/1) ... [2024-10-12 16:21:08,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:21:07" (1/1) ... [2024-10-12 16:21:08,121 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:21:07" (1/1) ... [2024-10-12 16:21:08,208 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-10-12 16:21:08,209 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:21:07" (1/1) ... [2024-10-12 16:21:08,209 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:21:07" (1/1) ... [2024-10-12 16:21:08,283 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:21:07" (1/1) ... [2024-10-12 16:21:08,298 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:21:07" (1/1) ... [2024-10-12 16:21:08,333 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:21:07" (1/1) ... [2024-10-12 16:21:08,346 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:21:07" (1/1) ... [2024-10-12 16:21:08,386 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 16:21:08,388 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 16:21:08,388 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 16:21:08,388 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 16:21:08,389 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:21:07" (1/1) ... [2024-10-12 16:21:08,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:21:08,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:21:08,424 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-10-12 16:21:08,431 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-10-12 16:21:08,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 16:21:08,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 16:21:08,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 16:21:08,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 16:21:08,548 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 16:21:08,550 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 16:21:11,187 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2024-10-12 16:21:11,188 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 16:21:11,245 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 16:21:11,245 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 16:21:11,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:21:11 BoogieIcfgContainer [2024-10-12 16:21:11,246 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 16:21:11,252 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 16:21:11,252 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 16:21:11,255 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 16:21:11,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 04:21:06" (1/3) ... [2024-10-12 16:21:11,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de2d4bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:21:11, skipping insertion in model container [2024-10-12 16:21:11,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:21:07" (2/3) ... [2024-10-12 16:21:11,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de2d4bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:21:11, skipping insertion in model container [2024-10-12 16:21:11,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:21:11" (3/3) ... [2024-10-12 16:21:11,259 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label57.c [2024-10-12 16:21:11,275 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 16:21:11,275 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 16:21:11,352 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 16:21:11,359 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;@393aa070, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 16:21:11,360 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 16:21:11,365 INFO L276 IsEmpty]: Start isEmpty. Operand has 362 states, 360 states have (on average 1.9111111111111112) internal successors, (688), 361 states have internal predecessors, (688), 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-10-12 16:21:11,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-12 16:21:11,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:21:11,376 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:21:11,377 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:21:11,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:21:11,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1715706905, now seen corresponding path program 1 times [2024-10-12 16:21:11,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:21:11,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269406767] [2024-10-12 16:21:11,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:21:11,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:21:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:21:11,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:21:11,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:21:11,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269406767] [2024-10-12 16:21:11,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269406767] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:21:11,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:21:11,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:21:11,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730407115] [2024-10-12 16:21:11,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:21:11,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 16:21:11,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:21:11,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 16:21:11,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 16:21:11,628 INFO L87 Difference]: Start difference. First operand has 362 states, 360 states have (on average 1.9111111111111112) internal successors, (688), 361 states have internal predecessors, (688), 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 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 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-10-12 16:21:11,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:21:11,688 INFO L93 Difference]: Finished difference Result 723 states and 1375 transitions. [2024-10-12 16:21:11,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 16:21:11,694 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 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 40 [2024-10-12 16:21:11,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:21:11,707 INFO L225 Difference]: With dead ends: 723 [2024-10-12 16:21:11,708 INFO L226 Difference]: Without dead ends: 360 [2024-10-12 16:21:11,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 16:21:11,715 INFO L432 NwaCegarLoop]: 623 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:21:11,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 623 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 16:21:11,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-10-12 16:21:11,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2024-10-12 16:21:11,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.7353760445682451) internal successors, (623), 359 states have internal predecessors, (623), 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-10-12 16:21:11,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 623 transitions. [2024-10-12 16:21:11,778 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 623 transitions. Word has length 40 [2024-10-12 16:21:11,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:21:11,779 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 623 transitions. [2024-10-12 16:21:11,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 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-10-12 16:21:11,779 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 623 transitions. [2024-10-12 16:21:11,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-12 16:21:11,780 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:21:11,780 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:21:11,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 16:21:11,781 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:21:11,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:21:11,782 INFO L85 PathProgramCache]: Analyzing trace with hash -406382477, now seen corresponding path program 1 times [2024-10-12 16:21:11,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:21:11,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909934295] [2024-10-12 16:21:11,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:21:11,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:21:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:21:11,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:21:11,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:21:11,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909934295] [2024-10-12 16:21:11,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909934295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:21:11,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:21:11,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:21:11,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953087084] [2024-10-12 16:21:11,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:21:11,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:21:11,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:21:11,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:21:11,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:21:11,969 INFO L87 Difference]: Start difference. First operand 360 states and 623 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 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-10-12 16:21:13,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:21:13,600 INFO L93 Difference]: Finished difference Result 1023 states and 1787 transitions. [2024-10-12 16:21:13,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:21:13,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 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 40 [2024-10-12 16:21:13,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:21:13,606 INFO L225 Difference]: With dead ends: 1023 [2024-10-12 16:21:13,606 INFO L226 Difference]: Without dead ends: 664 [2024-10-12 16:21:13,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-12 16:21:13,609 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 276 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:21:13,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 316 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 16:21:13,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2024-10-12 16:21:13,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 662. [2024-10-12 16:21:13,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.4826021180030258) internal successors, (980), 661 states have internal predecessors, (980), 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-10-12 16:21:13,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 980 transitions. [2024-10-12 16:21:13,642 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 980 transitions. Word has length 40 [2024-10-12 16:21:13,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:21:13,643 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 980 transitions. [2024-10-12 16:21:13,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 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-10-12 16:21:13,643 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 980 transitions. [2024-10-12 16:21:13,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-12 16:21:13,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:21:13,647 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:21:13,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 16:21:13,648 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:21:13,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:21:13,649 INFO L85 PathProgramCache]: Analyzing trace with hash 111629093, now seen corresponding path program 1 times [2024-10-12 16:21:13,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:21:13,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551190326] [2024-10-12 16:21:13,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:21:13,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:21:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:21:14,033 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:21:14,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:21:14,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551190326] [2024-10-12 16:21:14,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551190326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:21:14,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:21:14,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:21:14,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704876322] [2024-10-12 16:21:14,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:21:14,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:21:14,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:21:14,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:21:14,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:21:14,039 INFO L87 Difference]: Start difference. First operand 662 states and 980 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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-10-12 16:21:15,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:21:15,243 INFO L93 Difference]: Finished difference Result 1623 states and 2314 transitions. [2024-10-12 16:21:15,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:21:15,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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 105 [2024-10-12 16:21:15,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:21:15,248 INFO L225 Difference]: With dead ends: 1623 [2024-10-12 16:21:15,248 INFO L226 Difference]: Without dead ends: 962 [2024-10-12 16:21:15,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-12 16:21:15,253 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 237 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:21:15,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 335 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 16:21:15,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2024-10-12 16:21:15,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2024-10-12 16:21:15,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 961 states have (on average 1.3631633714880333) internal successors, (1310), 961 states have internal predecessors, (1310), 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-10-12 16:21:15,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1310 transitions. [2024-10-12 16:21:15,292 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1310 transitions. Word has length 105 [2024-10-12 16:21:15,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:21:15,292 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1310 transitions. [2024-10-12 16:21:15,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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-10-12 16:21:15,293 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1310 transitions. [2024-10-12 16:21:15,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-12 16:21:15,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:21:15,296 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:21:15,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 16:21:15,296 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:21:15,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:21:15,297 INFO L85 PathProgramCache]: Analyzing trace with hash -52242872, now seen corresponding path program 1 times [2024-10-12 16:21:15,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:21:15,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944210712] [2024-10-12 16:21:15,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:21:15,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:21:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:21:15,498 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:21:15,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:21:15,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944210712] [2024-10-12 16:21:15,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944210712] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:21:15,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:21:15,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:21:15,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602983604] [2024-10-12 16:21:15,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:21:15,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:21:15,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:21:15,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:21:15,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:21:15,502 INFO L87 Difference]: Start difference. First operand 962 states and 1310 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-10-12 16:21:16,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:21:16,970 INFO L93 Difference]: Finished difference Result 2228 states and 3185 transitions. [2024-10-12 16:21:16,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:21:16,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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 110 [2024-10-12 16:21:16,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:21:16,976 INFO L225 Difference]: With dead ends: 2228 [2024-10-12 16:21:16,976 INFO L226 Difference]: Without dead ends: 1566 [2024-10-12 16:21:16,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-12 16:21:16,983 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 256 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:21:16,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 316 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 16:21:16,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2024-10-12 16:21:17,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1265. [2024-10-12 16:21:17,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1264 states have (on average 1.3045886075949367) internal successors, (1649), 1264 states have internal predecessors, (1649), 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-10-12 16:21:17,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1649 transitions. [2024-10-12 16:21:17,008 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1649 transitions. Word has length 110 [2024-10-12 16:21:17,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:21:17,010 INFO L471 AbstractCegarLoop]: Abstraction has 1265 states and 1649 transitions. [2024-10-12 16:21:17,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-10-12 16:21:17,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1649 transitions. [2024-10-12 16:21:17,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-12 16:21:17,021 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:21:17,021 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:21:17,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 16:21:17,021 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:21:17,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:21:17,022 INFO L85 PathProgramCache]: Analyzing trace with hash -470364156, now seen corresponding path program 1 times [2024-10-12 16:21:17,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:21:17,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322628432] [2024-10-12 16:21:17,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:21:17,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:21:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:21:17,308 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:21:17,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:21:17,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322628432] [2024-10-12 16:21:17,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322628432] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:21:17,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:21:17,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:21:17,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062569789] [2024-10-12 16:21:17,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:21:17,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:21:17,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:21:17,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:21:17,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:21:17,314 INFO L87 Difference]: Start difference. First operand 1265 states and 1649 transitions. Second operand has 4 states, 4 states have (on average 51.5) internal successors, (206), 3 states have internal predecessors, (206), 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-10-12 16:21:19,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:21:19,919 INFO L93 Difference]: Finished difference Result 4667 states and 6168 transitions. [2024-10-12 16:21:19,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:21:19,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.5) internal successors, (206), 3 states have internal predecessors, (206), 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 206 [2024-10-12 16:21:19,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:21:19,932 INFO L225 Difference]: With dead ends: 4667 [2024-10-12 16:21:19,933 INFO L226 Difference]: Without dead ends: 3403 [2024-10-12 16:21:19,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:21:19,937 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 484 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2278 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 2547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 2278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:21:19,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 374 Invalid, 2547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 2278 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-12 16:21:19,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3403 states. [2024-10-12 16:21:20,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3403 to 3380. [2024-10-12 16:21:20,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3380 states, 3379 states have (on average 1.2364604912696064) internal successors, (4178), 3379 states have internal predecessors, (4178), 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-10-12 16:21:20,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3380 states to 3380 states and 4178 transitions. [2024-10-12 16:21:20,041 INFO L78 Accepts]: Start accepts. Automaton has 3380 states and 4178 transitions. Word has length 206 [2024-10-12 16:21:20,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:21:20,042 INFO L471 AbstractCegarLoop]: Abstraction has 3380 states and 4178 transitions. [2024-10-12 16:21:20,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.5) internal successors, (206), 3 states have internal predecessors, (206), 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-10-12 16:21:20,043 INFO L276 IsEmpty]: Start isEmpty. Operand 3380 states and 4178 transitions. [2024-10-12 16:21:20,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-12 16:21:20,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:21:20,047 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:21:20,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 16:21:20,047 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:21:20,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:21:20,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1170776306, now seen corresponding path program 1 times [2024-10-12 16:21:20,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:21:20,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069710400] [2024-10-12 16:21:20,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:21:20,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:21:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:21:20,281 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-12 16:21:20,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:21:20,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069710400] [2024-10-12 16:21:20,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069710400] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:21:20,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:21:20,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:21:20,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829216368] [2024-10-12 16:21:20,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:21:20,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:21:20,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:21:20,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:21:20,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:21:20,285 INFO L87 Difference]: Start difference. First operand 3380 states and 4178 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 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-10-12 16:21:21,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:21:21,477 INFO L93 Difference]: Finished difference Result 8562 states and 10750 transitions. [2024-10-12 16:21:21,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:21:21,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 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 210 [2024-10-12 16:21:21,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:21:21,494 INFO L225 Difference]: With dead ends: 8562 [2024-10-12 16:21:21,495 INFO L226 Difference]: Without dead ends: 5482 [2024-10-12 16:21:21,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-12 16:21:21,500 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:21:21,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 337 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 16:21:21,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5482 states. [2024-10-12 16:21:21,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5482 to 5477. [2024-10-12 16:21:21,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5477 states, 5476 states have (on average 1.1683710737764792) internal successors, (6398), 5476 states have internal predecessors, (6398), 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-10-12 16:21:21,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5477 states to 5477 states and 6398 transitions. [2024-10-12 16:21:21,606 INFO L78 Accepts]: Start accepts. Automaton has 5477 states and 6398 transitions. Word has length 210 [2024-10-12 16:21:21,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:21:21,610 INFO L471 AbstractCegarLoop]: Abstraction has 5477 states and 6398 transitions. [2024-10-12 16:21:21,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 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-10-12 16:21:21,611 INFO L276 IsEmpty]: Start isEmpty. Operand 5477 states and 6398 transitions. [2024-10-12 16:21:21,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2024-10-12 16:21:21,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:21:21,615 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 16:21:21,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 16:21:21,615 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:21:21,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:21:21,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1473131366, now seen corresponding path program 1 times [2024-10-12 16:21:21,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:21:21,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363769149] [2024-10-12 16:21:21,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:21:21,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:21:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:21:22,298 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-12 16:21:22,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:21:22,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363769149] [2024-10-12 16:21:22,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363769149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:21:22,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:21:22,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:21:22,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288945099] [2024-10-12 16:21:22,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:21:22,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:21:22,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:21:22,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:21:22,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:21:22,302 INFO L87 Difference]: Start difference. First operand 5477 states and 6398 transitions. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 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-10-12 16:21:23,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:21:23,522 INFO L93 Difference]: Finished difference Result 10654 states and 12484 transitions. [2024-10-12 16:21:23,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:21:23,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 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 312 [2024-10-12 16:21:23,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:21:23,537 INFO L225 Difference]: With dead ends: 10654 [2024-10-12 16:21:23,537 INFO L226 Difference]: Without dead ends: 5477 [2024-10-12 16:21:23,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-12 16:21:23,545 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:21:23,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 357 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 16:21:23,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5477 states. [2024-10-12 16:21:23,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5477 to 5477. [2024-10-12 16:21:23,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5477 states, 5476 states have (on average 1.1672753834915996) internal successors, (6392), 5476 states have internal predecessors, (6392), 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-10-12 16:21:23,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5477 states to 5477 states and 6392 transitions. [2024-10-12 16:21:23,631 INFO L78 Accepts]: Start accepts. Automaton has 5477 states and 6392 transitions. Word has length 312 [2024-10-12 16:21:23,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:21:23,632 INFO L471 AbstractCegarLoop]: Abstraction has 5477 states and 6392 transitions. [2024-10-12 16:21:23,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 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-10-12 16:21:23,633 INFO L276 IsEmpty]: Start isEmpty. Operand 5477 states and 6392 transitions. [2024-10-12 16:21:23,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2024-10-12 16:21:23,637 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:21:23,637 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 16:21:23,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 16:21:23,637 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:21:23,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:21:23,638 INFO L85 PathProgramCache]: Analyzing trace with hash -2044964829, now seen corresponding path program 1 times [2024-10-12 16:21:23,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:21:23,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181444486] [2024-10-12 16:21:23,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:21:23,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:21:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:21:23,860 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-12 16:21:23,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:21:23,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181444486] [2024-10-12 16:21:23,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181444486] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:21:23,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:21:23,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:21:23,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930815369] [2024-10-12 16:21:23,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:21:23,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:21:23,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:21:23,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:21:23,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:21:23,863 INFO L87 Difference]: Start difference. First operand 5477 states and 6392 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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-10-12 16:21:25,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:21:25,266 INFO L93 Difference]: Finished difference Result 11850 states and 14144 transitions. [2024-10-12 16:21:25,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:21:25,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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 327 [2024-10-12 16:21:25,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:21:25,289 INFO L225 Difference]: With dead ends: 11850 [2024-10-12 16:21:25,289 INFO L226 Difference]: Without dead ends: 6673 [2024-10-12 16:21:25,296 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-10-12 16:21:25,296 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 273 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 16:21:25,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 320 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 16:21:25,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6673 states. [2024-10-12 16:21:25,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6673 to 4576. [2024-10-12 16:21:25,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4576 states, 4575 states have (on average 1.1840437158469945) internal successors, (5417), 4575 states have internal predecessors, (5417), 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-10-12 16:21:25,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4576 states to 4576 states and 5417 transitions. [2024-10-12 16:21:25,384 INFO L78 Accepts]: Start accepts. Automaton has 4576 states and 5417 transitions. Word has length 327 [2024-10-12 16:21:25,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:21:25,385 INFO L471 AbstractCegarLoop]: Abstraction has 4576 states and 5417 transitions. [2024-10-12 16:21:25,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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-10-12 16:21:25,386 INFO L276 IsEmpty]: Start isEmpty. Operand 4576 states and 5417 transitions. [2024-10-12 16:21:25,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2024-10-12 16:21:25,391 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:21:25,391 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 16:21:25,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 16:21:25,392 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:21:25,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:21:25,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1220383508, now seen corresponding path program 1 times [2024-10-12 16:21:25,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:21:25,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397795198] [2024-10-12 16:21:25,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:21:25,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:21:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:21:25,748 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-12 16:21:25,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:21:25,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397795198] [2024-10-12 16:21:25,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397795198] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:21:25,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:21:25,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:21:25,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260689770] [2024-10-12 16:21:25,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:21:25,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:21:25,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:21:25,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:21:25,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:21:25,751 INFO L87 Difference]: Start difference. First operand 4576 states and 5417 transitions. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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-10-12 16:21:27,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:21:27,172 INFO L93 Difference]: Finished difference Result 10954 states and 13232 transitions. [2024-10-12 16:21:27,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:21:27,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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 386 [2024-10-12 16:21:27,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:21:27,194 INFO L225 Difference]: With dead ends: 10954 [2024-10-12 16:21:27,195 INFO L226 Difference]: Without dead ends: 6678 [2024-10-12 16:21:27,201 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-10-12 16:21:27,203 INFO L432 NwaCegarLoop]: 598 mSDtfsCounter, 287 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:21:27,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 634 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 16:21:27,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6678 states. [2024-10-12 16:21:27,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6678 to 6080. [2024-10-12 16:21:27,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6080 states, 6079 states have (on average 1.1572627076821846) internal successors, (7035), 6079 states have internal predecessors, (7035), 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-10-12 16:21:27,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6080 states to 6080 states and 7035 transitions. [2024-10-12 16:21:27,296 INFO L78 Accepts]: Start accepts. Automaton has 6080 states and 7035 transitions. Word has length 386 [2024-10-12 16:21:27,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:21:27,297 INFO L471 AbstractCegarLoop]: Abstraction has 6080 states and 7035 transitions. [2024-10-12 16:21:27,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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-10-12 16:21:27,298 INFO L276 IsEmpty]: Start isEmpty. Operand 6080 states and 7035 transitions. [2024-10-12 16:21:27,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2024-10-12 16:21:27,303 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:21:27,304 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 16:21:27,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 16:21:27,304 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:21:27,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:21:27,308 INFO L85 PathProgramCache]: Analyzing trace with hash 826240192, now seen corresponding path program 1 times [2024-10-12 16:21:27,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:21:27,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660911366] [2024-10-12 16:21:27,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:21:27,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:21:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:21:27,623 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:21:27,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:21:27,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660911366] [2024-10-12 16:21:27,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660911366] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:21:27,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:21:27,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:21:27,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096157910] [2024-10-12 16:21:27,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:21:27,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:21:27,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:21:27,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:21:27,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:21:27,627 INFO L87 Difference]: Start difference. First operand 6080 states and 7035 transitions. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 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-10-12 16:21:28,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:21:28,915 INFO L93 Difference]: Finished difference Result 13964 states and 16475 transitions. [2024-10-12 16:21:28,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:21:28,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 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 392 [2024-10-12 16:21:28,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:21:28,931 INFO L225 Difference]: With dead ends: 13964 [2024-10-12 16:21:28,931 INFO L226 Difference]: Without dead ends: 8184 [2024-10-12 16:21:28,971 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-10-12 16:21:28,972 INFO L432 NwaCegarLoop]: 562 mSDtfsCounter, 248 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:21:28,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 600 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 16:21:28,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8184 states. [2024-10-12 16:21:29,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8184 to 7583. [2024-10-12 16:21:29,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7583 states, 7582 states have (on average 1.1423107359535742) internal successors, (8661), 7582 states have internal predecessors, (8661), 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-10-12 16:21:29,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7583 states to 7583 states and 8661 transitions. [2024-10-12 16:21:29,104 INFO L78 Accepts]: Start accepts. Automaton has 7583 states and 8661 transitions. Word has length 392 [2024-10-12 16:21:29,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:21:29,105 INFO L471 AbstractCegarLoop]: Abstraction has 7583 states and 8661 transitions. [2024-10-12 16:21:29,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 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-10-12 16:21:29,106 INFO L276 IsEmpty]: Start isEmpty. Operand 7583 states and 8661 transitions. [2024-10-12 16:21:29,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-10-12 16:21:29,114 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:21:29,115 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 16:21:29,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 16:21:29,116 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:21:29,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:21:29,116 INFO L85 PathProgramCache]: Analyzing trace with hash -247859821, now seen corresponding path program 1 times [2024-10-12 16:21:29,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:21:29,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924901908] [2024-10-12 16:21:29,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:21:29,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:21:29,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:21:29,469 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-12 16:21:29,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:21:29,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924901908] [2024-10-12 16:21:29,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924901908] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:21:29,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:21:29,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:21:29,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234154906] [2024-10-12 16:21:29,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:21:29,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:21:29,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:21:29,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:21:29,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:21:29,472 INFO L87 Difference]: Start difference. First operand 7583 states and 8661 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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-10-12 16:21:30,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:21:30,640 INFO L93 Difference]: Finished difference Result 16660 states and 19391 transitions. [2024-10-12 16:21:30,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:21:30,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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 409 [2024-10-12 16:21:30,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:21:30,656 INFO L225 Difference]: With dead ends: 16660 [2024-10-12 16:21:30,656 INFO L226 Difference]: Without dead ends: 9377 [2024-10-12 16:21:30,662 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-10-12 16:21:30,663 INFO L432 NwaCegarLoop]: 578 mSDtfsCounter, 246 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:21:30,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 616 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 16:21:30,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9377 states. [2024-10-12 16:21:30,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9377 to 9074. [2024-10-12 16:21:30,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9074 states, 9073 states have (on average 1.1318196847790147) internal successors, (10269), 9073 states have internal predecessors, (10269), 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-10-12 16:21:30,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9074 states to 9074 states and 10269 transitions. [2024-10-12 16:21:30,764 INFO L78 Accepts]: Start accepts. Automaton has 9074 states and 10269 transitions. Word has length 409 [2024-10-12 16:21:30,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:21:30,764 INFO L471 AbstractCegarLoop]: Abstraction has 9074 states and 10269 transitions. [2024-10-12 16:21:30,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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-10-12 16:21:30,765 INFO L276 IsEmpty]: Start isEmpty. Operand 9074 states and 10269 transitions. [2024-10-12 16:21:30,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2024-10-12 16:21:30,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:21:30,777 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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-10-12 16:21:30,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 16:21:30,777 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:21:30,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:21:30,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1601580396, now seen corresponding path program 1 times [2024-10-12 16:21:30,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:21:30,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329356858] [2024-10-12 16:21:30,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:21:30,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:21:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:21:31,395 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 487 proven. 39 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-10-12 16:21:31,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:21:31,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329356858] [2024-10-12 16:21:31,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329356858] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:21:31,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491996012] [2024-10-12 16:21:31,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:21:31,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:21:31,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:21:31,398 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-10-12 16:21:31,399 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-10-12 16:21:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:21:31,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:21:31,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:21:31,742 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2024-10-12 16:21:31,743 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:21:31,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491996012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:21:31,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:21:31,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-12 16:21:31,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109026351] [2024-10-12 16:21:31,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:21:31,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:21:31,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:21:31,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:21:31,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:21:31,746 INFO L87 Difference]: Start difference. First operand 9074 states and 10269 transitions. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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-10-12 16:21:33,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:21:33,025 INFO L93 Difference]: Finished difference Result 20239 states and 23188 transitions. [2024-10-12 16:21:33,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:21:33,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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 524 [2024-10-12 16:21:33,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:21:33,045 INFO L225 Difference]: With dead ends: 20239 [2024-10-12 16:21:33,046 INFO L226 Difference]: Without dead ends: 11465 [2024-10-12 16:21:33,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 523 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:21:33,057 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 376 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:21:33,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 444 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 16:21:33,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11465 states. [2024-10-12 16:21:33,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11465 to 11465. [2024-10-12 16:21:33,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11465 states, 11464 states have (on average 1.1366015352407537) internal successors, (13030), 11464 states have internal predecessors, (13030), 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-10-12 16:21:33,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11465 states to 11465 states and 13030 transitions. [2024-10-12 16:21:33,244 INFO L78 Accepts]: Start accepts. Automaton has 11465 states and 13030 transitions. Word has length 524 [2024-10-12 16:21:33,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:21:33,245 INFO L471 AbstractCegarLoop]: Abstraction has 11465 states and 13030 transitions. [2024-10-12 16:21:33,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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-10-12 16:21:33,245 INFO L276 IsEmpty]: Start isEmpty. Operand 11465 states and 13030 transitions. [2024-10-12 16:21:33,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2024-10-12 16:21:33,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:21:33,251 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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-10-12 16:21:33,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 16:21:33,452 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,SelfDestructingSolverStorable11 [2024-10-12 16:21:33,453 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:21:33,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:21:33,453 INFO L85 PathProgramCache]: Analyzing trace with hash -2105948042, now seen corresponding path program 1 times [2024-10-12 16:21:33,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:21:33,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873557773] [2024-10-12 16:21:33,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:21:33,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:21:33,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:21:33,973 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-10-12 16:21:33,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:21:33,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873557773] [2024-10-12 16:21:33,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873557773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:21:33,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:21:33,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:21:33,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909445148] [2024-10-12 16:21:33,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:21:33,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:21:33,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:21:33,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:21:33,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:21:33,977 INFO L87 Difference]: Start difference. First operand 11465 states and 13030 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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-10-12 16:21:35,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:21:35,342 INFO L93 Difference]: Finished difference Result 27129 states and 31137 transitions. [2024-10-12 16:21:35,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:21:35,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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 528 [2024-10-12 16:21:35,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:21:35,371 INFO L225 Difference]: With dead ends: 27129 [2024-10-12 16:21:35,371 INFO L226 Difference]: Without dead ends: 15964 [2024-10-12 16:21:35,384 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-10-12 16:21:35,385 INFO L432 NwaCegarLoop]: 586 mSDtfsCounter, 246 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 16:21:35,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 618 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 16:21:35,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15964 states. [2024-10-12 16:21:35,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15964 to 15355. [2024-10-12 16:21:35,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15355 states, 15354 states have (on average 1.1285658460336068) internal successors, (17328), 15354 states have internal predecessors, (17328), 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-10-12 16:21:35,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15355 states to 15355 states and 17328 transitions. [2024-10-12 16:21:35,562 INFO L78 Accepts]: Start accepts. Automaton has 15355 states and 17328 transitions. Word has length 528 [2024-10-12 16:21:35,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:21:35,563 INFO L471 AbstractCegarLoop]: Abstraction has 15355 states and 17328 transitions. [2024-10-12 16:21:35,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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-10-12 16:21:35,563 INFO L276 IsEmpty]: Start isEmpty. Operand 15355 states and 17328 transitions. [2024-10-12 16:21:35,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2024-10-12 16:21:35,573 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:21:35,574 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 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-10-12 16:21:35,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 16:21:35,574 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:21:35,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:21:35,575 INFO L85 PathProgramCache]: Analyzing trace with hash 602937302, now seen corresponding path program 1 times [2024-10-12 16:21:35,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:21:35,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293801722] [2024-10-12 16:21:35,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:21:35,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:21:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:21:36,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1029 backedges. 644 proven. 39 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2024-10-12 16:21:36,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:21:36,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293801722] [2024-10-12 16:21:36,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293801722] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:21:36,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639481344] [2024-10-12 16:21:36,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:21:36,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:21:36,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:21:36,263 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-10-12 16:21:36,264 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-10-12 16:21:36,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:21:36,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:21:36,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:21:36,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1029 backedges. 505 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2024-10-12 16:21:36,606 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:21:36,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639481344] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:21:36,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:21:36,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-12 16:21:36,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883997769] [2024-10-12 16:21:36,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:21:36,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:21:36,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:21:36,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:21:36,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:21:36,608 INFO L87 Difference]: Start difference. First operand 15355 states and 17328 transitions. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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-10-12 16:21:37,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:21:37,969 INFO L93 Difference]: Finished difference Result 30107 states and 34015 transitions. [2024-10-12 16:21:37,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:21:37,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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 603 [2024-10-12 16:21:37,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:21:37,991 INFO L225 Difference]: With dead ends: 30107 [2024-10-12 16:21:37,991 INFO L226 Difference]: Without dead ends: 15052 [2024-10-12 16:21:38,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 606 GetRequests, 602 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:21:38,004 INFO L432 NwaCegarLoop]: 565 mSDtfsCounter, 252 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 16:21:38,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 601 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 16:21:38,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15052 states. [2024-10-12 16:21:38,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15052 to 15051. [2024-10-12 16:21:38,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15051 states, 15050 states have (on average 1.079468438538206) internal successors, (16246), 15050 states have internal predecessors, (16246), 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-10-12 16:21:38,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15051 states to 15051 states and 16246 transitions. [2024-10-12 16:21:38,167 INFO L78 Accepts]: Start accepts. Automaton has 15051 states and 16246 transitions. Word has length 603 [2024-10-12 16:21:38,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:21:38,168 INFO L471 AbstractCegarLoop]: Abstraction has 15051 states and 16246 transitions. [2024-10-12 16:21:38,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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-10-12 16:21:38,168 INFO L276 IsEmpty]: Start isEmpty. Operand 15051 states and 16246 transitions. [2024-10-12 16:21:38,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2024-10-12 16:21:38,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:21:38,179 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:21:38,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 16:21:38,379 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,SelfDestructingSolverStorable13 [2024-10-12 16:21:38,380 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:21:38,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:21:38,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1915140437, now seen corresponding path program 1 times [2024-10-12 16:21:38,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:21:38,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399349007] [2024-10-12 16:21:38,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:21:38,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:21:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:21:39,064 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 571 proven. 39 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-10-12 16:21:39,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:21:39,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399349007] [2024-10-12 16:21:39,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399349007] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:21:39,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761949108] [2024-10-12 16:21:39,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:21:39,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:21:39,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:21:39,066 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-10-12 16:21:39,067 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-10-12 16:21:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:21:39,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 743 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 16:21:39,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:21:40,118 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 610 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-10-12 16:21:40,118 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:21:40,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761949108] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:21:40,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:21:40,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-12 16:21:40,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327878728] [2024-10-12 16:21:40,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:21:40,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:21:40,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:21:40,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:21:40,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:21:40,121 INFO L87 Difference]: Start difference. First operand 15051 states and 16246 transitions. Second operand has 4 states, 4 states have (on average 122.0) internal successors, (488), 3 states have internal predecessors, (488), 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-10-12 16:21:42,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:21:42,043 INFO L93 Difference]: Finished difference Result 31597 states and 34114 transitions. [2024-10-12 16:21:42,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:21:42,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 122.0) internal successors, (488), 3 states have internal predecessors, (488), 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 604 [2024-10-12 16:21:42,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:21:42,066 INFO L225 Difference]: With dead ends: 31597 [2024-10-12 16:21:42,066 INFO L226 Difference]: Without dead ends: 16248 [2024-10-12 16:21:42,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 602 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:21:42,083 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 316 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1752 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 1844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-12 16:21:42,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 386 Invalid, 1844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1752 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-12 16:21:42,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16248 states. [2024-10-12 16:21:42,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16248 to 15648. [2024-10-12 16:21:42,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15648 states, 15647 states have (on average 1.0769476576979613) internal successors, (16851), 15647 states have internal predecessors, (16851), 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-10-12 16:21:42,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15648 states to 15648 states and 16851 transitions. [2024-10-12 16:21:42,307 INFO L78 Accepts]: Start accepts. Automaton has 15648 states and 16851 transitions. Word has length 604 [2024-10-12 16:21:42,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:21:42,307 INFO L471 AbstractCegarLoop]: Abstraction has 15648 states and 16851 transitions. [2024-10-12 16:21:42,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.0) internal successors, (488), 3 states have internal predecessors, (488), 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-10-12 16:21:42,307 INFO L276 IsEmpty]: Start isEmpty. Operand 15648 states and 16851 transitions. [2024-10-12 16:21:42,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2024-10-12 16:21:42,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:21:42,318 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:21:42,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 16:21:42,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:21:42,519 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:21:42,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:21:42,519 INFO L85 PathProgramCache]: Analyzing trace with hash 321157154, now seen corresponding path program 1 times [2024-10-12 16:21:42,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:21:42,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492529171] [2024-10-12 16:21:42,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:21:42,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:21:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:21:42,911 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-10-12 16:21:42,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:21:42,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492529171] [2024-10-12 16:21:42,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492529171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:21:42,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:21:42,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:21:42,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649451856] [2024-10-12 16:21:42,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:21:42,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:21:42,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:21:42,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:21:42,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:21:42,914 INFO L87 Difference]: Start difference. First operand 15648 states and 16851 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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-10-12 16:21:44,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:21:44,164 INFO L93 Difference]: Finished difference Result 39961 states and 43016 transitions. [2024-10-12 16:21:44,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:21:44,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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 641 [2024-10-12 16:21:44,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:21:44,187 INFO L225 Difference]: With dead ends: 39961 [2024-10-12 16:21:44,187 INFO L226 Difference]: Without dead ends: 19530 [2024-10-12 16:21:44,201 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-10-12 16:21:44,201 INFO L432 NwaCegarLoop]: 605 mSDtfsCounter, 275 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:21:44,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 643 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 16:21:44,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19530 states. [2024-10-12 16:21:44,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19530 to 17437. [2024-10-12 16:21:44,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17437 states, 17436 states have (on average 1.0509864647855012) internal successors, (18325), 17436 states have internal predecessors, (18325), 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-10-12 16:21:44,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17437 states to 17437 states and 18325 transitions. [2024-10-12 16:21:44,398 INFO L78 Accepts]: Start accepts. Automaton has 17437 states and 18325 transitions. Word has length 641 [2024-10-12 16:21:44,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:21:44,398 INFO L471 AbstractCegarLoop]: Abstraction has 17437 states and 18325 transitions. [2024-10-12 16:21:44,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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-10-12 16:21:44,399 INFO L276 IsEmpty]: Start isEmpty. Operand 17437 states and 18325 transitions. [2024-10-12 16:21:44,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 666 [2024-10-12 16:21:44,408 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:21:44,410 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:21:44,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 16:21:44,411 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:21:44,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:21:44,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1162998334, now seen corresponding path program 1 times [2024-10-12 16:21:44,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:21:44,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656392138] [2024-10-12 16:21:44,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:21:44,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:21:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:21:44,991 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2024-10-12 16:21:44,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:21:44,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656392138] [2024-10-12 16:21:44,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656392138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:21:44,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:21:44,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 16:21:44,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399273874] [2024-10-12 16:21:44,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:21:44,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:21:44,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:21:44,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:21:44,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:21:44,995 INFO L87 Difference]: Start difference. First operand 17437 states and 18325 transitions. Second operand has 4 states, 4 states have (on average 78.75) internal successors, (315), 4 states have internal predecessors, (315), 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-10-12 16:21:46,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:21:46,611 INFO L93 Difference]: Finished difference Result 45338 states and 47681 transitions. [2024-10-12 16:21:46,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:21:46,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 78.75) internal successors, (315), 4 states have internal predecessors, (315), 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 665 [2024-10-12 16:21:46,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:21:46,631 INFO L225 Difference]: With dead ends: 45338 [2024-10-12 16:21:46,631 INFO L226 Difference]: Without dead ends: 21623 [2024-10-12 16:21:46,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:21:46,648 INFO L432 NwaCegarLoop]: 415 mSDtfsCounter, 708 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1530 mSolverCounterSat, 460 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 1990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 460 IncrementalHoareTripleChecker+Valid, 1530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:21:46,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 449 Invalid, 1990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [460 Valid, 1530 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 16:21:46,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21623 states. [2024-10-12 16:21:46,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21623 to 18633. [2024-10-12 16:21:46,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18633 states, 18632 states have (on average 1.0338127951910692) internal successors, (19262), 18632 states have internal predecessors, (19262), 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-10-12 16:21:46,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18633 states to 18633 states and 19262 transitions. [2024-10-12 16:21:46,828 INFO L78 Accepts]: Start accepts. Automaton has 18633 states and 19262 transitions. Word has length 665 [2024-10-12 16:21:46,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:21:46,829 INFO L471 AbstractCegarLoop]: Abstraction has 18633 states and 19262 transitions. [2024-10-12 16:21:46,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.75) internal successors, (315), 4 states have internal predecessors, (315), 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-10-12 16:21:46,829 INFO L276 IsEmpty]: Start isEmpty. Operand 18633 states and 19262 transitions. [2024-10-12 16:21:46,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 697 [2024-10-12 16:21:46,839 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:21:46,840 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 16:21:46,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 16:21:46,840 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:21:46,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:21:46,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1376037958, now seen corresponding path program 1 times [2024-10-12 16:21:46,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:21:46,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627841675] [2024-10-12 16:21:46,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:21:46,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:21:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:21:47,202 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 499 proven. 0 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2024-10-12 16:21:47,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:21:47,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627841675] [2024-10-12 16:21:47,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627841675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:21:47,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:21:47,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:21:47,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453813823] [2024-10-12 16:21:47,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:21:47,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:21:47,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:21:47,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:21:47,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:21:47,205 INFO L87 Difference]: Start difference. First operand 18633 states and 19262 transitions. Second operand has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:21:47,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:21:47,951 INFO L93 Difference]: Finished difference Result 37561 states and 38830 transitions. [2024-10-12 16:21:47,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:21:47,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 696 [2024-10-12 16:21:47,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:21:47,970 INFO L225 Difference]: With dead ends: 37561 [2024-10-12 16:21:47,970 INFO L226 Difference]: Without dead ends: 18929 [2024-10-12 16:21:47,981 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-10-12 16:21:47,981 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 460 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:21:47,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 65 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 16:21:47,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18929 states. [2024-10-12 16:21:48,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18929 to 18629. [2024-10-12 16:21:48,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18629 states, 18628 states have (on average 1.033659007945029) internal successors, (19255), 18628 states have internal predecessors, (19255), 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-10-12 16:21:48,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18629 states to 18629 states and 19255 transitions. [2024-10-12 16:21:48,122 INFO L78 Accepts]: Start accepts. Automaton has 18629 states and 19255 transitions. Word has length 696 [2024-10-12 16:21:48,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:21:48,123 INFO L471 AbstractCegarLoop]: Abstraction has 18629 states and 19255 transitions. [2024-10-12 16:21:48,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:21:48,123 INFO L276 IsEmpty]: Start isEmpty. Operand 18629 states and 19255 transitions. [2024-10-12 16:21:48,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 768 [2024-10-12 16:21:48,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:21:48,138 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 16:21:48,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 16:21:48,138 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:21:48,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:21:48,138 INFO L85 PathProgramCache]: Analyzing trace with hash -381729159, now seen corresponding path program 1 times [2024-10-12 16:21:48,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:21:48,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422340010] [2024-10-12 16:21:48,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:21:48,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:21:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:21:48,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1222 backedges. 648 proven. 0 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2024-10-12 16:21:48,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:21:48,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422340010] [2024-10-12 16:21:48,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422340010] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:21:48,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:21:48,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:21:48,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070028202] [2024-10-12 16:21:48,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:21:48,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:21:48,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:21:48,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:21:48,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:21:48,622 INFO L87 Difference]: Start difference. First operand 18629 states and 19255 transitions. Second operand has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 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-10-12 16:21:49,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:21:49,643 INFO L93 Difference]: Finished difference Result 39945 states and 41308 transitions. [2024-10-12 16:21:49,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:21:49,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 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 767 [2024-10-12 16:21:49,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:21:49,666 INFO L225 Difference]: With dead ends: 39945 [2024-10-12 16:21:49,666 INFO L226 Difference]: Without dead ends: 21317 [2024-10-12 16:21:49,679 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-10-12 16:21:49,679 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 183 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 16:21:49,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 165 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 16:21:49,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21317 states. [2024-10-12 16:21:49,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21317 to 19822. [2024-10-12 16:21:49,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19822 states, 19821 states have (on average 1.03112860097876) internal successors, (20438), 19821 states have internal predecessors, (20438), 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-10-12 16:21:49,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19822 states to 19822 states and 20438 transitions. [2024-10-12 16:21:49,863 INFO L78 Accepts]: Start accepts. Automaton has 19822 states and 20438 transitions. Word has length 767 [2024-10-12 16:21:49,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:21:49,863 INFO L471 AbstractCegarLoop]: Abstraction has 19822 states and 20438 transitions. [2024-10-12 16:21:49,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 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-10-12 16:21:49,864 INFO L276 IsEmpty]: Start isEmpty. Operand 19822 states and 20438 transitions. [2024-10-12 16:21:49,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 789 [2024-10-12 16:21:49,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:21:49,876 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 16:21:49,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 16:21:49,876 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:21:49,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:21:49,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1896481568, now seen corresponding path program 1 times [2024-10-12 16:21:49,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:21:49,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072706713] [2024-10-12 16:21:49,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:21:49,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:21:49,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:21:50,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1245 backedges. 669 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2024-10-12 16:21:50,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:21:50,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072706713] [2024-10-12 16:21:50,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072706713] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:21:50,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:21:50,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:21:50,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218067085] [2024-10-12 16:21:50,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:21:50,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:21:50,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:21:50,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:21:50,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:21:50,143 INFO L87 Difference]: Start difference. First operand 19822 states and 20438 transitions. Second operand has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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-10-12 16:21:51,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:21:51,052 INFO L93 Difference]: Finished difference Result 42032 states and 43365 transitions. [2024-10-12 16:21:51,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:21:51,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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 788 [2024-10-12 16:21:51,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:21:51,076 INFO L225 Difference]: With dead ends: 42032 [2024-10-12 16:21:51,077 INFO L226 Difference]: Without dead ends: 21912 [2024-10-12 16:21:51,090 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-10-12 16:21:51,091 INFO L432 NwaCegarLoop]: 457 mSDtfsCounter, 163 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 16:21:51,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 483 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 16:21:51,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21912 states. [2024-10-12 16:21:51,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21912 to 18021. [2024-10-12 16:21:51,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18021 states, 18020 states have (on average 1.0299112097669256) internal successors, (18559), 18020 states have internal predecessors, (18559), 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-10-12 16:21:51,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18021 states to 18021 states and 18559 transitions. [2024-10-12 16:21:51,256 INFO L78 Accepts]: Start accepts. Automaton has 18021 states and 18559 transitions. Word has length 788 [2024-10-12 16:21:51,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:21:51,257 INFO L471 AbstractCegarLoop]: Abstraction has 18021 states and 18559 transitions. [2024-10-12 16:21:51,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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-10-12 16:21:51,257 INFO L276 IsEmpty]: Start isEmpty. Operand 18021 states and 18559 transitions. [2024-10-12 16:21:51,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 826 [2024-10-12 16:21:51,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:21:51,268 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:21:51,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 16:21:51,268 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:21:51,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:21:51,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1864145110, now seen corresponding path program 1 times [2024-10-12 16:21:51,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:21:51,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945345246] [2024-10-12 16:21:51,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:21:51,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:21:51,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:21:51,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 532 proven. 0 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2024-10-12 16:21:51,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:21:51,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945345246] [2024-10-12 16:21:51,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945345246] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:21:51,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:21:51,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:21:51,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751720191] [2024-10-12 16:21:51,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:21:51,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:21:51,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:21:51,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:21:51,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:21:51,595 INFO L87 Difference]: Start difference. First operand 18021 states and 18559 transitions. Second operand has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:21:52,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:21:52,418 INFO L93 Difference]: Finished difference Result 37834 states and 38974 transitions. [2024-10-12 16:21:52,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:21:52,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 825 [2024-10-12 16:21:52,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:21:52,436 INFO L225 Difference]: With dead ends: 37834 [2024-10-12 16:21:52,436 INFO L226 Difference]: Without dead ends: 19814 [2024-10-12 16:21:52,448 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-10-12 16:21:52,449 INFO L432 NwaCegarLoop]: 488 mSDtfsCounter, 310 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:21:52,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 527 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 16:21:52,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19814 states. [2024-10-12 16:21:52,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19814 to 18618. [2024-10-12 16:21:52,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18618 states, 18617 states have (on average 1.0289520330880377) internal successors, (19156), 18617 states have internal predecessors, (19156), 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-10-12 16:21:52,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18618 states to 18618 states and 19156 transitions. [2024-10-12 16:21:52,657 INFO L78 Accepts]: Start accepts. Automaton has 18618 states and 19156 transitions. Word has length 825 [2024-10-12 16:21:52,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:21:52,657 INFO L471 AbstractCegarLoop]: Abstraction has 18618 states and 19156 transitions. [2024-10-12 16:21:52,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:21:52,658 INFO L276 IsEmpty]: Start isEmpty. Operand 18618 states and 19156 transitions. [2024-10-12 16:21:52,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 847 [2024-10-12 16:21:52,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:21:52,666 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:21:52,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 16:21:52,666 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:21:52,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:21:52,667 INFO L85 PathProgramCache]: Analyzing trace with hash 965145984, now seen corresponding path program 1 times [2024-10-12 16:21:52,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:21:52,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844212296] [2024-10-12 16:21:52,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:21:52,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:21:52,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:21:54,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1050 backedges. 597 proven. 269 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-10-12 16:21:54,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:21:54,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844212296] [2024-10-12 16:21:54,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844212296] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:21:54,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034760028] [2024-10-12 16:21:54,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:21:54,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:21:54,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:21:54,105 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 16:21:54,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 16:21:54,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:21:54,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 980 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 16:21:54,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:21:54,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1050 backedges. 570 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-12 16:21:54,768 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:21:54,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034760028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:21:54,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:21:54,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-10-12 16:21:54,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245021369] [2024-10-12 16:21:54,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:21:54,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:21:54,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:21:54,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:21:54,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:21:54,771 INFO L87 Difference]: Start difference. First operand 18618 states and 19156 transitions. Second operand has 4 states, 4 states have (on average 118.25) internal successors, (473), 4 states have internal predecessors, (473), 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-10-12 16:21:56,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:21:56,435 INFO L93 Difference]: Finished difference Result 44129 states and 45361 transitions. [2024-10-12 16:21:56,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:21:56,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 118.25) internal successors, (473), 4 states have internal predecessors, (473), 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 846 [2024-10-12 16:21:56,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:21:56,461 INFO L225 Difference]: With dead ends: 44129 [2024-10-12 16:21:56,461 INFO L226 Difference]: Without dead ends: 25512 [2024-10-12 16:21:56,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 849 GetRequests, 844 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:21:56,476 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 504 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1578 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 1578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:21:56,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 118 Invalid, 1767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 1578 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 16:21:56,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25512 states. [2024-10-12 16:21:56,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25512 to 19519. [2024-10-12 16:21:56,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19519 states, 19518 states have (on average 1.02792294292448) internal successors, (20063), 19518 states have internal predecessors, (20063), 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-10-12 16:21:56,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19519 states to 19519 states and 20063 transitions. [2024-10-12 16:21:56,748 INFO L78 Accepts]: Start accepts. Automaton has 19519 states and 20063 transitions. Word has length 846 [2024-10-12 16:21:56,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:21:56,748 INFO L471 AbstractCegarLoop]: Abstraction has 19519 states and 20063 transitions. [2024-10-12 16:21:56,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.25) internal successors, (473), 4 states have internal predecessors, (473), 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-10-12 16:21:56,749 INFO L276 IsEmpty]: Start isEmpty. Operand 19519 states and 20063 transitions. [2024-10-12 16:21:56,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 909 [2024-10-12 16:21:56,763 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:21:56,763 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 16:21:56,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 16:21:56,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:21:56,964 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:21:56,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:21:56,965 INFO L85 PathProgramCache]: Analyzing trace with hash -321143868, now seen corresponding path program 1 times [2024-10-12 16:21:56,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:21:56,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860098499] [2024-10-12 16:21:56,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:21:56,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:21:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:21:57,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 924 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2024-10-12 16:21:57,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:21:57,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860098499] [2024-10-12 16:21:57,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860098499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:21:57,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:21:57,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:21:57,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943190960] [2024-10-12 16:21:57,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:21:57,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:21:57,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:21:57,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:21:57,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:21:57,676 INFO L87 Difference]: Start difference. First operand 19519 states and 20063 transitions. Second operand has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 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-10-12 16:21:58,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:21:58,402 INFO L93 Difference]: Finished difference Result 30921 states and 31706 transitions. [2024-10-12 16:21:58,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:21:58,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 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 908 [2024-10-12 16:21:58,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:21:58,403 INFO L225 Difference]: With dead ends: 30921 [2024-10-12 16:21:58,403 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 16:21:58,415 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-10-12 16:21:58,416 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 320 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:21:58,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 67 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 16:21:58,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 16:21:58,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 16:21:58,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-10-12 16:21:58,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 16:21:58,417 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 908 [2024-10-12 16:21:58,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:21:58,417 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 16:21:58,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 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-10-12 16:21:58,418 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 16:21:58,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 16:21:58,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 16:21:58,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 16:21:58,424 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] [2024-10-12 16:21:58,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 16:22:01,376 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 16:22:01,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 04:22:01 BoogieIcfgContainer [2024-10-12 16:22:01,407 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 16:22:01,407 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 16:22:01,407 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 16:22:01,408 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 16:22:01,408 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:21:11" (3/4) ... [2024-10-12 16:22:01,410 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 16:22:01,437 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-12 16:22:01,440 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-12 16:22:01,442 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 16:22:01,444 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 16:22:01,653 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 16:22:01,654 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 16:22:01,654 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 16:22:01,654 INFO L158 Benchmark]: Toolchain (without parser) took 54969.60ms. Allocated memory was 146.8MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 87.5MB in the beginning and 687.7MB in the end (delta: -600.1MB). Peak memory consumption was 800.6MB. Max. memory is 16.1GB. [2024-10-12 16:22:01,655 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 146.8MB. Free memory is still 106.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 16:22:01,655 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1122.15ms. Allocated memory is still 146.8MB. Free memory was 87.2MB in the beginning and 54.2MB in the end (delta: 33.0MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. [2024-10-12 16:22:01,659 INFO L158 Benchmark]: Boogie Procedure Inliner took 263.23ms. Allocated memory was 146.8MB in the beginning and 203.4MB in the end (delta: 56.6MB). Free memory was 54.2MB in the beginning and 137.1MB in the end (delta: -82.9MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. [2024-10-12 16:22:01,659 INFO L158 Benchmark]: Boogie Preprocessor took 312.12ms. Allocated memory is still 203.4MB. Free memory was 137.1MB in the beginning and 79.7MB in the end (delta: 57.4MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2024-10-12 16:22:01,659 INFO L158 Benchmark]: RCFGBuilder took 2857.78ms. Allocated memory was 203.4MB in the beginning and 350.2MB in the end (delta: 146.8MB). Free memory was 79.7MB in the beginning and 212.2MB in the end (delta: -132.5MB). Peak memory consumption was 72.1MB. Max. memory is 16.1GB. [2024-10-12 16:22:01,659 INFO L158 Benchmark]: TraceAbstraction took 50154.96ms. Allocated memory was 350.2MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 211.1MB in the beginning and 714.9MB in the end (delta: -503.8MB). Peak memory consumption was 884.9MB. Max. memory is 16.1GB. [2024-10-12 16:22:01,660 INFO L158 Benchmark]: Witness Printer took 246.50ms. Allocated memory is still 1.5GB. Free memory was 714.9MB in the beginning and 687.7MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-12 16:22:01,661 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 146.8MB. Free memory is still 106.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1122.15ms. Allocated memory is still 146.8MB. Free memory was 87.2MB in the beginning and 54.2MB in the end (delta: 33.0MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 263.23ms. Allocated memory was 146.8MB in the beginning and 203.4MB in the end (delta: 56.6MB). Free memory was 54.2MB in the beginning and 137.1MB in the end (delta: -82.9MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 312.12ms. Allocated memory is still 203.4MB. Free memory was 137.1MB in the beginning and 79.7MB in the end (delta: 57.4MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * RCFGBuilder took 2857.78ms. Allocated memory was 203.4MB in the beginning and 350.2MB in the end (delta: 146.8MB). Free memory was 79.7MB in the beginning and 212.2MB in the end (delta: -132.5MB). Peak memory consumption was 72.1MB. Max. memory is 16.1GB. * TraceAbstraction took 50154.96ms. Allocated memory was 350.2MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 211.1MB in the beginning and 714.9MB in the end (delta: -503.8MB). Peak memory consumption was 884.9MB. Max. memory is 16.1GB. * Witness Printer took 246.50ms. Allocated memory is still 1.5GB. Free memory was 714.9MB in the beginning and 687.7MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. 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 - PositiveResult [Line: 140]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 362 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 47.1s, OverallIterations: 23, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 30.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6782 SdHoareTripleChecker+Valid, 27.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6782 mSDsluCounter, 9394 SdHoareTripleChecker+Invalid, 23.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 862 mSDsCounter, 3913 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22578 IncrementalHoareTripleChecker+Invalid, 26491 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3913 mSolverCounterUnsat, 8532 mSDtfsCounter, 22578 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2641 GetRequests, 2603 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19822occurred in iteration=19, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.9s AutomataMinimizationTime, 23 MinimizatonAttempts, 23098 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 13509 NumberOfCodeBlocks, 13509 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 13482 ConstructedInterpolants, 0 QuantifiedInterpolants, 38417 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3140 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 27 InterpolantComputations, 23 PerfectInterpolantSequences, 15728/16114 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1776]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((long long) a0 + 105) <= 0) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) 146 + a0))) && (5 <= a2)) && (a29 <= 43)) || (((((long long) 89 + a4) <= 0) && (a2 == 1)) && (((long long) a0 + 61) <= 0))) || (((((long long) 89 + a4) <= 0) && (0 <= ((long long) a0 + 60))) && (5 <= a2))) || (((((long long) 89 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (5 <= a2))) || (((((((long long) a0 + 105) <= 0) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (44 <= a29)) && (a2 == 4))) || ((((((long long) a0 + 105) <= 0) && (((long long) 42 + a4) <= 0)) && (3 == a2)) && (a29 <= 43))) || (((((long long) 89 + a4) <= 0) && (a2 == 4)) && (a29 <= 43))) || ((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 147) <= 0)) && (3 == a2))) || ((2 == a2) && (((long long) 89 + a4) <= 0))) || ((((((a2 == 1) && (((long long) a0 + 61) <= 0)) || ((0 <= ((long long) a4 + 85)) && (a2 == 1))) && (0 <= ((long long) 599999 + a0))) && (((long long) 42 + a4) <= 0)) && (a29 <= 43))) || ((((((long long) 42 + a4) <= 0) && (44 <= a29)) && (((long long) a0 + 147) <= 0)) && (a2 == 1))) || (((((0 <= ((long long) 599999 + a0)) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 147) <= 0)) && (5 <= a2))) || ((((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (3 == a2))) || (((44 <= a29) && (((long long) 89 + a4) <= 0)) && (5 <= a2))) || (((((long long) 89 + a4) <= 0) && (a2 == 1)) && (((long long) a29 + 127) <= 0))) || (((((long long) 89 + a4) <= 0) && (a2 == 4)) && (((long long) a0 + 61) <= 0))) || (((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (5 <= a2))) || (((((0 <= ((long long) 599999 + a0)) && (((long long) 42 + a4) <= 0)) && (44 <= a29)) && (((long long) a0 + 147) <= 0)) && (5 <= a2))) || ((((long long) 89 + a4) <= 0) && (3 == a2))) || ((((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (a2 == 1))) || ((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 147) <= 0)) && (a2 == 4))) || (((((long long) a0 + 105) <= 0) && (2 == a2)) && (44 <= a29))) || ((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0))) RESULT: Ultimate proved your program to be correct! [2024-10-12 16:22:01,695 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 Result: TRUE