./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_label35.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_label35.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 954f50d37143b139a2ebc4626a6099455decd471f8c1055eb5e8a313dea8492b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 16:19:26,635 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 16:19:26,698 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 16:19:26,702 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 16:19:26,704 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 16:19:26,735 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 16:19:26,736 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 16:19:26,736 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 16:19:26,736 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 16:19:26,737 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 16:19:26,737 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 16:19:26,738 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 16:19:26,739 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 16:19:26,740 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 16:19:26,742 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 16:19:26,742 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 16:19:26,743 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 16:19:26,743 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 16:19:26,743 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 16:19:26,743 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 16:19:26,744 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 16:19:26,748 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 16:19:26,749 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 16:19:26,749 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 16:19:26,749 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 16:19:26,749 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 16:19:26,750 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 16:19:26,750 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 16:19:26,750 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 16:19:26,750 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 16:19:26,750 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 16:19:26,751 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 16:19:26,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:19:26,751 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 16:19:26,751 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 16:19:26,752 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 16:19:26,752 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 16:19:26,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 16:19:26,755 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 16:19:26,755 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 16:19:26,755 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 16:19:26,756 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 16:19:26,756 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 -> 954f50d37143b139a2ebc4626a6099455decd471f8c1055eb5e8a313dea8492b [2024-10-12 16:19:26,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 16:19:27,015 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 16:19:27,018 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 16:19:27,019 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 16:19:27,020 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 16:19:27,021 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label35.c [2024-10-12 16:19:28,435 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 16:19:28,779 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 16:19:28,779 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label35.c [2024-10-12 16:19:28,803 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/811077190/4b913db987b74d76aaec952d0036adeb/FLAG32eeec34a [2024-10-12 16:19:29,029 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/811077190/4b913db987b74d76aaec952d0036adeb [2024-10-12 16:19:29,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 16:19:29,032 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 16:19:29,033 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 16:19:29,033 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 16:19:29,038 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 16:19:29,038 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:19:29" (1/1) ... [2024-10-12 16:19:29,039 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32e8032f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:29, skipping insertion in model container [2024-10-12 16:19:29,039 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:19:29" (1/1) ... [2024-10-12 16:19:29,101 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 16:19:29,427 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_label35.c[4490,4503] [2024-10-12 16:19:29,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:19:29,871 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 16:19:29,897 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_label35.c[4490,4503] [2024-10-12 16:19:30,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:19:30,087 INFO L204 MainTranslator]: Completed translation [2024-10-12 16:19:30,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:30 WrapperNode [2024-10-12 16:19:30,088 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 16:19:30,089 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 16:19:30,090 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 16:19:30,090 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 16:19:30,096 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:19:30" (1/1) ... [2024-10-12 16:19:30,140 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:19:30" (1/1) ... [2024-10-12 16:19:30,293 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1760 [2024-10-12 16:19:30,294 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 16:19:30,295 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 16:19:30,295 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 16:19:30,295 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 16:19:30,305 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:30" (1/1) ... [2024-10-12 16:19:30,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:30" (1/1) ... [2024-10-12 16:19:30,397 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:30" (1/1) ... [2024-10-12 16:19:30,465 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:19:30,465 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:30" (1/1) ... [2024-10-12 16:19:30,466 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:30" (1/1) ... [2024-10-12 16:19:30,520 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:30" (1/1) ... [2024-10-12 16:19:30,541 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:30" (1/1) ... [2024-10-12 16:19:30,560 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:30" (1/1) ... [2024-10-12 16:19:30,574 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:30" (1/1) ... [2024-10-12 16:19:30,596 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 16:19:30,598 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 16:19:30,598 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 16:19:30,598 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 16:19:30,599 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:30" (1/1) ... [2024-10-12 16:19:30,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:19:30,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:19:30,629 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:19:30,631 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:19:30,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 16:19:30,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 16:19:30,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 16:19:30,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 16:19:30,796 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 16:19:30,798 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 16:19:33,212 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2024-10-12 16:19:33,212 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 16:19:33,284 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 16:19:33,285 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 16:19:33,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:19:33 BoogieIcfgContainer [2024-10-12 16:19:33,286 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 16:19:33,288 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 16:19:33,288 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 16:19:33,291 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 16:19:33,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 04:19:29" (1/3) ... [2024-10-12 16:19:33,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@350ff928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:19:33, skipping insertion in model container [2024-10-12 16:19:33,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:30" (2/3) ... [2024-10-12 16:19:33,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@350ff928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:19:33, skipping insertion in model container [2024-10-12 16:19:33,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:19:33" (3/3) ... [2024-10-12 16:19:33,294 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label35.c [2024-10-12 16:19:33,310 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 16:19:33,310 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 16:19:33,381 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 16:19:33,390 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;@5538417c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 16:19:33,391 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 16:19:33,396 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:19:33,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-12 16:19:33,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:33,406 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] [2024-10-12 16:19:33,406 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:33,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:33,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1299030564, now seen corresponding path program 1 times [2024-10-12 16:19:33,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:33,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664977170] [2024-10-12 16:19:33,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:33,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:33,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:33,618 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:19:33,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:33,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664977170] [2024-10-12 16:19:33,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664977170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:33,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:19:33,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:19:33,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048918681] [2024-10-12 16:19:33,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:33,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 16:19:33,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:33,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 16:19:33,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 16:19:33,657 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 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 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:19:33,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:33,709 INFO L93 Difference]: Finished difference Result 723 states and 1375 transitions. [2024-10-12 16:19:33,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 16:19:33,713 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2024-10-12 16:19:33,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:33,729 INFO L225 Difference]: With dead ends: 723 [2024-10-12 16:19:33,730 INFO L226 Difference]: Without dead ends: 360 [2024-10-12 16:19:33,735 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:19:33,739 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:19:33,741 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:19:33,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-10-12 16:19:33,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2024-10-12 16:19:33,803 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:19:33,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 623 transitions. [2024-10-12 16:19:33,810 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 623 transitions. Word has length 35 [2024-10-12 16:19:33,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:33,811 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 623 transitions. [2024-10-12 16:19:33,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 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:19:33,811 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 623 transitions. [2024-10-12 16:19:33,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-12 16:19:33,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:33,812 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:19:33,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 16:19:33,813 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:33,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:33,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1618624743, now seen corresponding path program 1 times [2024-10-12 16:19:33,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:33,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780228504] [2024-10-12 16:19:33,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:33,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:34,015 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:19:34,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:34,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780228504] [2024-10-12 16:19:34,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780228504] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:34,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:19:34,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:19:34,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473294251] [2024-10-12 16:19:34,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:34,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:19:34,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:34,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:19:34,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:19:34,021 INFO L87 Difference]: Start difference. First operand 360 states and 623 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 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:19:35,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:35,775 INFO L93 Difference]: Finished difference Result 1025 states and 1788 transitions. [2024-10-12 16:19:35,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:19:35,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2024-10-12 16:19:35,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:35,783 INFO L225 Difference]: With dead ends: 1025 [2024-10-12 16:19:35,783 INFO L226 Difference]: Without dead ends: 666 [2024-10-12 16:19:35,784 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:19:35,788 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 292 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 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.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:35,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 316 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 16:19:35,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2024-10-12 16:19:35,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 664. [2024-10-12 16:19:35,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 663 states have (on average 1.4796380090497738) internal successors, (981), 663 states have internal predecessors, (981), 0 states have call successors, (0), 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:19:35,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 981 transitions. [2024-10-12 16:19:35,826 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 981 transitions. Word has length 35 [2024-10-12 16:19:35,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:35,827 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 981 transitions. [2024-10-12 16:19:35,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 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:19:35,827 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 981 transitions. [2024-10-12 16:19:35,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-12 16:19:35,830 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:35,834 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:35,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 16:19:35,835 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:35,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:35,836 INFO L85 PathProgramCache]: Analyzing trace with hash 800852888, now seen corresponding path program 1 times [2024-10-12 16:19:35,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:35,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070065612] [2024-10-12 16:19:35,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:35,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:36,063 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:19:36,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:36,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070065612] [2024-10-12 16:19:36,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070065612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:36,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:19:36,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:19:36,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906945097] [2024-10-12 16:19:36,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:36,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:19:36,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:36,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:19:36,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:19:36,071 INFO L87 Difference]: Start difference. First operand 664 states and 981 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:19:38,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:38,045 INFO L93 Difference]: Finished difference Result 1952 states and 2892 transitions. [2024-10-12 16:19:38,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:19:38,045 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:19:38,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:38,050 INFO L225 Difference]: With dead ends: 1952 [2024-10-12 16:19:38,050 INFO L226 Difference]: Without dead ends: 1289 [2024-10-12 16:19:38,051 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:19:38,052 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 257 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:38,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 323 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-12 16:19:38,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2024-10-12 16:19:38,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1281. [2024-10-12 16:19:38,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 1280 states have (on average 1.39921875) internal successors, (1791), 1280 states have internal predecessors, (1791), 0 states have call successors, (0), 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:19:38,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1791 transitions. [2024-10-12 16:19:38,089 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1791 transitions. Word has length 110 [2024-10-12 16:19:38,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:38,089 INFO L471 AbstractCegarLoop]: Abstraction has 1281 states and 1791 transitions. [2024-10-12 16:19:38,090 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:19:38,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1791 transitions. [2024-10-12 16:19:38,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-12 16:19:38,095 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:38,095 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:38,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 16:19:38,096 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:38,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:38,096 INFO L85 PathProgramCache]: Analyzing trace with hash -296139314, now seen corresponding path program 1 times [2024-10-12 16:19:38,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:38,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272989285] [2024-10-12 16:19:38,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:38,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:38,259 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:19:38,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:38,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272989285] [2024-10-12 16:19:38,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272989285] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:38,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:19:38,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:19:38,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507911616] [2024-10-12 16:19:38,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:38,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:19:38,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:38,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:19:38,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:19:38,261 INFO L87 Difference]: Start difference. First operand 1281 states and 1791 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 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:19:39,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:39,980 INFO L93 Difference]: Finished difference Result 3763 states and 5262 transitions. [2024-10-12 16:19:39,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:19:39,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2024-10-12 16:19:39,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:39,990 INFO L225 Difference]: With dead ends: 3763 [2024-10-12 16:19:39,990 INFO L226 Difference]: Without dead ends: 2483 [2024-10-12 16:19:39,992 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:19:39,993 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 236 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:39,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 364 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 956 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 16:19:39,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2483 states. [2024-10-12 16:19:40,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2483 to 2181. [2024-10-12 16:19:40,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2181 states, 2180 states have (on average 1.281651376146789) internal successors, (2794), 2180 states have internal predecessors, (2794), 0 states have call successors, (0), 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:19:40,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 2181 states and 2794 transitions. [2024-10-12 16:19:40,037 INFO L78 Accepts]: Start accepts. Automaton has 2181 states and 2794 transitions. Word has length 114 [2024-10-12 16:19:40,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:40,039 INFO L471 AbstractCegarLoop]: Abstraction has 2181 states and 2794 transitions. [2024-10-12 16:19:40,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 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:19:40,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 2794 transitions. [2024-10-12 16:19:40,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-12 16:19:40,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:40,046 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:19:40,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 16:19:40,048 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:40,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:40,049 INFO L85 PathProgramCache]: Analyzing trace with hash -40763892, now seen corresponding path program 1 times [2024-10-12 16:19:40,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:40,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478395974] [2024-10-12 16:19:40,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:40,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:40,307 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-12 16:19:40,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:40,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478395974] [2024-10-12 16:19:40,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478395974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:40,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:19:40,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:19:40,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045300063] [2024-10-12 16:19:40,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:40,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:19:40,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:40,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:19:40,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:19:40,314 INFO L87 Difference]: Start difference. First operand 2181 states and 2794 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 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:19:41,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:41,819 INFO L93 Difference]: Finished difference Result 6165 states and 7960 transitions. [2024-10-12 16:19:41,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:19:41,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 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 205 [2024-10-12 16:19:41,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:41,832 INFO L225 Difference]: With dead ends: 6165 [2024-10-12 16:19:41,832 INFO L226 Difference]: Without dead ends: 3985 [2024-10-12 16:19:41,835 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:19:41,837 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:41,838 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.4s Time] [2024-10-12 16:19:41,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3985 states. [2024-10-12 16:19:41,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3985 to 3681. [2024-10-12 16:19:41,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3681 states, 3680 states have (on average 1.2201086956521738) internal successors, (4490), 3680 states have internal predecessors, (4490), 0 states have call successors, (0), 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:19:41,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3681 states to 3681 states and 4490 transitions. [2024-10-12 16:19:41,900 INFO L78 Accepts]: Start accepts. Automaton has 3681 states and 4490 transitions. Word has length 205 [2024-10-12 16:19:41,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:41,900 INFO L471 AbstractCegarLoop]: Abstraction has 3681 states and 4490 transitions. [2024-10-12 16:19:41,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 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:19:41,901 INFO L276 IsEmpty]: Start isEmpty. Operand 3681 states and 4490 transitions. [2024-10-12 16:19:41,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2024-10-12 16:19:41,906 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:41,906 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:19:41,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 16:19:41,906 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:41,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:41,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1357926574, now seen corresponding path program 1 times [2024-10-12 16:19:41,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:41,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208737458] [2024-10-12 16:19:41,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:41,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:41,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:42,570 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 16:19:42,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:42,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208737458] [2024-10-12 16:19:42,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208737458] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:42,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:19:42,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:19:42,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777733435] [2024-10-12 16:19:42,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:42,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:19:42,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:42,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:19:42,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:19:42,576 INFO L87 Difference]: Start difference. First operand 3681 states and 4490 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:19:43,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:43,882 INFO L93 Difference]: Finished difference Result 7660 states and 9290 transitions. [2024-10-12 16:19:43,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:19:43,883 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 307 [2024-10-12 16:19:43,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:43,897 INFO L225 Difference]: With dead ends: 7660 [2024-10-12 16:19:43,897 INFO L226 Difference]: Without dead ends: 3980 [2024-10-12 16:19:43,904 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:19:43,906 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.3s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:43,908 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.3s Time] [2024-10-12 16:19:43,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3980 states. [2024-10-12 16:19:43,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3980 to 3980. [2024-10-12 16:19:43,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3980 states, 3979 states have (on average 1.2050766524252325) internal successors, (4795), 3979 states have internal predecessors, (4795), 0 states have call successors, (0), 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:19:43,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3980 states to 3980 states and 4795 transitions. [2024-10-12 16:19:43,988 INFO L78 Accepts]: Start accepts. Automaton has 3980 states and 4795 transitions. Word has length 307 [2024-10-12 16:19:43,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:43,992 INFO L471 AbstractCegarLoop]: Abstraction has 3980 states and 4795 transitions. [2024-10-12 16:19:43,992 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:19:43,992 INFO L276 IsEmpty]: Start isEmpty. Operand 3980 states and 4795 transitions. [2024-10-12 16:19:43,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2024-10-12 16:19:43,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:43,997 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:19:43,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 16:19:43,998 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:43,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:43,998 INFO L85 PathProgramCache]: Analyzing trace with hash 92751737, now seen corresponding path program 1 times [2024-10-12 16:19:43,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:43,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104242350] [2024-10-12 16:19:43,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:43,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:44,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:44,292 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-12 16:19:44,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:44,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104242350] [2024-10-12 16:19:44,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104242350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:44,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:19:44,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:19:44,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074610342] [2024-10-12 16:19:44,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:44,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:19:44,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:44,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:19:44,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:19:44,296 INFO L87 Difference]: Start difference. First operand 3980 states and 4795 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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:19:45,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:45,932 INFO L93 Difference]: Finished difference Result 9464 states and 11673 transitions. [2024-10-12 16:19:45,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:19:45,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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 322 [2024-10-12 16:19:45,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:45,951 INFO L225 Difference]: With dead ends: 9464 [2024-10-12 16:19:45,952 INFO L226 Difference]: Without dead ends: 5784 [2024-10-12 16:19:45,958 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:19:45,959 INFO L432 NwaCegarLoop]: 630 mSDtfsCounter, 280 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:45,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 668 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 16:19:45,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5784 states. [2024-10-12 16:19:46,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5784 to 5782. [2024-10-12 16:19:46,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5782 states, 5781 states have (on average 1.167618059159315) internal successors, (6750), 5781 states have internal predecessors, (6750), 0 states have call successors, (0), 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:19:46,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5782 states to 5782 states and 6750 transitions. [2024-10-12 16:19:46,060 INFO L78 Accepts]: Start accepts. Automaton has 5782 states and 6750 transitions. Word has length 322 [2024-10-12 16:19:46,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:46,061 INFO L471 AbstractCegarLoop]: Abstraction has 5782 states and 6750 transitions. [2024-10-12 16:19:46,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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:19:46,061 INFO L276 IsEmpty]: Start isEmpty. Operand 5782 states and 6750 transitions. [2024-10-12 16:19:46,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2024-10-12 16:19:46,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:46,067 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:19:46,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 16:19:46,067 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:46,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:46,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1272626532, now seen corresponding path program 1 times [2024-10-12 16:19:46,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:46,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508664541] [2024-10-12 16:19:46,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:46,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:46,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:46,473 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-12 16:19:46,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:46,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508664541] [2024-10-12 16:19:46,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508664541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:46,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:19:46,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:19:46,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353689375] [2024-10-12 16:19:46,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:46,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:19:46,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:46,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:19:46,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:19:46,477 INFO L87 Difference]: Start difference. First operand 5782 states and 6750 transitions. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 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:19:48,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:48,038 INFO L93 Difference]: Finished difference Result 13363 states and 15909 transitions. [2024-10-12 16:19:48,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:19:48,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 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 381 [2024-10-12 16:19:48,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:48,060 INFO L225 Difference]: With dead ends: 13363 [2024-10-12 16:19:48,061 INFO L226 Difference]: Without dead ends: 7881 [2024-10-12 16:19:48,068 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:19:48,069 INFO L432 NwaCegarLoop]: 596 mSDtfsCounter, 291 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:48,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 632 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 16:19:48,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7881 states. [2024-10-12 16:19:48,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7881 to 7283. [2024-10-12 16:19:48,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7283 states, 7282 states have (on average 1.148722878330129) internal successors, (8365), 7282 states have internal predecessors, (8365), 0 states have call successors, (0), 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:19:48,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7283 states to 7283 states and 8365 transitions. [2024-10-12 16:19:48,177 INFO L78 Accepts]: Start accepts. Automaton has 7283 states and 8365 transitions. Word has length 381 [2024-10-12 16:19:48,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:48,177 INFO L471 AbstractCegarLoop]: Abstraction has 7283 states and 8365 transitions. [2024-10-12 16:19:48,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 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:19:48,178 INFO L276 IsEmpty]: Start isEmpty. Operand 7283 states and 8365 transitions. [2024-10-12 16:19:48,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2024-10-12 16:19:48,184 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:48,184 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:19:48,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 16:19:48,185 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:48,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:48,185 INFO L85 PathProgramCache]: Analyzing trace with hash 2126128651, now seen corresponding path program 1 times [2024-10-12 16:19:48,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:48,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946404313] [2024-10-12 16:19:48,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:48,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:48,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:48,585 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-12 16:19:48,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:48,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946404313] [2024-10-12 16:19:48,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946404313] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:48,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:19:48,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:19:48,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308337793] [2024-10-12 16:19:48,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:48,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:19:48,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:48,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:19:48,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:19:48,587 INFO L87 Difference]: Start difference. First operand 7283 states and 8365 transitions. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 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:19:50,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:50,018 INFO L93 Difference]: Finished difference Result 16068 states and 18813 transitions. [2024-10-12 16:19:50,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:19:50,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 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 396 [2024-10-12 16:19:50,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:50,041 INFO L225 Difference]: With dead ends: 16068 [2024-10-12 16:19:50,042 INFO L226 Difference]: Without dead ends: 9085 [2024-10-12 16:19:50,050 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:19:50,051 INFO L432 NwaCegarLoop]: 583 mSDtfsCounter, 293 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:50,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 620 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 16:19:50,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9085 states. [2024-10-12 16:19:50,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9085 to 8480. [2024-10-12 16:19:50,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8480 states, 8479 states have (on average 1.1379879702795141) internal successors, (9649), 8479 states have internal predecessors, (9649), 0 states have call successors, (0), 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:19:50,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8480 states to 8480 states and 9649 transitions. [2024-10-12 16:19:50,204 INFO L78 Accepts]: Start accepts. Automaton has 8480 states and 9649 transitions. Word has length 396 [2024-10-12 16:19:50,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:50,205 INFO L471 AbstractCegarLoop]: Abstraction has 8480 states and 9649 transitions. [2024-10-12 16:19:50,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 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:19:50,206 INFO L276 IsEmpty]: Start isEmpty. Operand 8480 states and 9649 transitions. [2024-10-12 16:19:50,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2024-10-12 16:19:50,216 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:50,216 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:50,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 16:19:50,217 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:50,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:50,217 INFO L85 PathProgramCache]: Analyzing trace with hash 699725088, now seen corresponding path program 1 times [2024-10-12 16:19:50,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:50,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429169819] [2024-10-12 16:19:50,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:50,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:50,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:50,573 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 321 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-12 16:19:50,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:50,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429169819] [2024-10-12 16:19:50,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429169819] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:50,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:19:50,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:19:50,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591885334] [2024-10-12 16:19:50,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:50,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:19:50,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:50,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:19:50,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:19:50,578 INFO L87 Difference]: Start difference. First operand 8480 states and 9649 transitions. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 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:19:51,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:51,908 INFO L93 Difference]: Finished difference Result 19650 states and 22542 transitions. [2024-10-12 16:19:51,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:19:51,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 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 486 [2024-10-12 16:19:51,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:51,930 INFO L225 Difference]: With dead ends: 19650 [2024-10-12 16:19:51,931 INFO L226 Difference]: Without dead ends: 11470 [2024-10-12 16:19:51,940 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:19:51,941 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 147 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:51,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 313 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 16:19:51,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11470 states. [2024-10-12 16:19:52,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11470 to 7577. [2024-10-12 16:19:52,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7577 states, 7576 states have (on average 1.1486272439281944) internal successors, (8702), 7576 states have internal predecessors, (8702), 0 states have call successors, (0), 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:19:52,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7577 states to 7577 states and 8702 transitions. [2024-10-12 16:19:52,067 INFO L78 Accepts]: Start accepts. Automaton has 7577 states and 8702 transitions. Word has length 486 [2024-10-12 16:19:52,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:52,068 INFO L471 AbstractCegarLoop]: Abstraction has 7577 states and 8702 transitions. [2024-10-12 16:19:52,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 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:19:52,069 INFO L276 IsEmpty]: Start isEmpty. Operand 7577 states and 8702 transitions. [2024-10-12 16:19:52,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2024-10-12 16:19:52,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:52,078 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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:19:52,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 16:19:52,079 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:52,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:52,080 INFO L85 PathProgramCache]: Analyzing trace with hash -2045678992, now seen corresponding path program 1 times [2024-10-12 16:19:52,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:52,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255363133] [2024-10-12 16:19:52,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:52,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:52,738 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 477 proven. 39 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2024-10-12 16:19:52,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:52,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255363133] [2024-10-12 16:19:52,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255363133] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:19:52,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541164316] [2024-10-12 16:19:52,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:52,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:19:52,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:19:52,742 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:19:52,743 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:19:52,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:52,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:19:52,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:19:53,076 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2024-10-12 16:19:53,076 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:19:53,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541164316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:53,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:19:53,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-12 16:19:53,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566909048] [2024-10-12 16:19:53,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:53,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:19:53,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:53,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:19:53,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:19:53,085 INFO L87 Difference]: Start difference. First operand 7577 states and 8702 transitions. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 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:19:54,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:54,233 INFO L93 Difference]: Finished difference Result 17245 states and 20054 transitions. [2024-10-12 16:19:54,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:19:54,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 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 519 [2024-10-12 16:19:54,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:54,250 INFO L225 Difference]: With dead ends: 17245 [2024-10-12 16:19:54,250 INFO L226 Difference]: Without dead ends: 9968 [2024-10-12 16:19:54,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 518 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:19:54,259 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 381 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 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.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:54,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 444 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 16:19:54,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9968 states. [2024-10-12 16:19:54,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9968 to 9968. [2024-10-12 16:19:54,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9968 states, 9967 states have (on average 1.1499949834453698) internal successors, (11462), 9967 states have internal predecessors, (11462), 0 states have call successors, (0), 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:19:54,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9968 states to 9968 states and 11462 transitions. [2024-10-12 16:19:54,380 INFO L78 Accepts]: Start accepts. Automaton has 9968 states and 11462 transitions. Word has length 519 [2024-10-12 16:19:54,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:54,381 INFO L471 AbstractCegarLoop]: Abstraction has 9968 states and 11462 transitions. [2024-10-12 16:19:54,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 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:19:54,381 INFO L276 IsEmpty]: Start isEmpty. Operand 9968 states and 11462 transitions. [2024-10-12 16:19:54,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2024-10-12 16:19:54,392 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:54,392 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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:19:54,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 16:19:54,593 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,SelfDestructingSolverStorable10 [2024-10-12 16:19:54,594 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:54,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:54,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1253275814, now seen corresponding path program 1 times [2024-10-12 16:19:54,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:54,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573769970] [2024-10-12 16:19:54,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:54,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:55,249 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 371 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-10-12 16:19:55,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:55,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573769970] [2024-10-12 16:19:55,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573769970] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:55,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:19:55,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:19:55,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872842693] [2024-10-12 16:19:55,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:55,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:19:55,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:55,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:19:55,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:19:55,252 INFO L87 Difference]: Start difference. First operand 9968 states and 11462 transitions. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 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:19:56,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:56,488 INFO L93 Difference]: Finished difference Result 24135 states and 28001 transitions. [2024-10-12 16:19:56,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:19:56,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 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 523 [2024-10-12 16:19:56,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:56,506 INFO L225 Difference]: With dead ends: 24135 [2024-10-12 16:19:56,507 INFO L226 Difference]: Without dead ends: 14467 [2024-10-12 16:19:56,518 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:19:56,519 INFO L432 NwaCegarLoop]: 586 mSDtfsCounter, 246 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:56,519 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.2s Time] [2024-10-12 16:19:56,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14467 states. [2024-10-12 16:19:56,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14467 to 14157. [2024-10-12 16:19:56,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14157 states, 14156 states have (on average 1.13485447866629) internal successors, (16065), 14156 states have internal predecessors, (16065), 0 states have call successors, (0), 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:19:56,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14157 states to 14157 states and 16065 transitions. [2024-10-12 16:19:56,673 INFO L78 Accepts]: Start accepts. Automaton has 14157 states and 16065 transitions. Word has length 523 [2024-10-12 16:19:56,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:56,674 INFO L471 AbstractCegarLoop]: Abstraction has 14157 states and 16065 transitions. [2024-10-12 16:19:56,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 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:19:56,674 INFO L276 IsEmpty]: Start isEmpty. Operand 14157 states and 16065 transitions. [2024-10-12 16:19:56,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2024-10-12 16:19:56,688 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:56,688 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, 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, 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:19:56,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 16:19:56,688 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:56,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:56,689 INFO L85 PathProgramCache]: Analyzing trace with hash 41189669, now seen corresponding path program 1 times [2024-10-12 16:19:56,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:56,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436138366] [2024-10-12 16:19:56,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:56,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:56,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:57,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1004 backedges. 634 proven. 39 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2024-10-12 16:19:57,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:57,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436138366] [2024-10-12 16:19:57,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436138366] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:19:57,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976061100] [2024-10-12 16:19:57,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:57,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:19:57,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:19:57,493 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:19:57,495 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:19:57,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:57,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:19:57,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:19:57,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1004 backedges. 480 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2024-10-12 16:19:57,834 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:19:57,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976061100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:57,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:19:57,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-12 16:19:57,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621273932] [2024-10-12 16:19:57,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:57,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:19:57,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:57,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:19:57,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:19:57,836 INFO L87 Difference]: Start difference. First operand 14157 states and 16065 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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:19:59,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:59,103 INFO L93 Difference]: Finished difference Result 27711 states and 31489 transitions. [2024-10-12 16:19:59,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:19:59,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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 598 [2024-10-12 16:19:59,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:59,117 INFO L225 Difference]: With dead ends: 27711 [2024-10-12 16:19:59,118 INFO L226 Difference]: Without dead ends: 13854 [2024-10-12 16:19:59,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 597 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:19:59,129 INFO L432 NwaCegarLoop]: 565 mSDtfsCounter, 252 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:59,130 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.2s Time] [2024-10-12 16:19:59,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13854 states. [2024-10-12 16:19:59,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13854 to 13853. [2024-10-12 16:19:59,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13853 states, 13852 states have (on average 1.081648859370488) internal successors, (14983), 13852 states have internal predecessors, (14983), 0 states have call successors, (0), 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:19:59,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13853 states to 13853 states and 14983 transitions. [2024-10-12 16:19:59,278 INFO L78 Accepts]: Start accepts. Automaton has 13853 states and 14983 transitions. Word has length 598 [2024-10-12 16:19:59,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:59,279 INFO L471 AbstractCegarLoop]: Abstraction has 13853 states and 14983 transitions. [2024-10-12 16:19:59,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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:19:59,279 INFO L276 IsEmpty]: Start isEmpty. Operand 13853 states and 14983 transitions. [2024-10-12 16:19:59,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2024-10-12 16:19:59,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:59,289 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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:19:59,307 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:19:59,489 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,SelfDestructingSolverStorable12 [2024-10-12 16:19:59,490 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:59,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:59,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1363559087, now seen corresponding path program 1 times [2024-10-12 16:19:59,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:59,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142242378] [2024-10-12 16:19:59,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:59,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:20:00,206 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 561 proven. 39 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2024-10-12 16:20:00,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:20:00,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142242378] [2024-10-12 16:20:00,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142242378] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:20:00,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234955487] [2024-10-12 16:20:00,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:20:00,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:20:00,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:20:00,210 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:20:00,212 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:20:00,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:20:00,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 16:20:00,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:20:01,432 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2024-10-12 16:20:01,433 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:20:01,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234955487] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:20:01,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:20:01,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-12 16:20:01,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561229145] [2024-10-12 16:20:01,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:20:01,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:20:01,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:20:01,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:20:01,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:20:01,437 INFO L87 Difference]: Start difference. First operand 13853 states and 14983 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:20:02,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:20:02,962 INFO L93 Difference]: Finished difference Result 28903 states and 31297 transitions. [2024-10-12 16:20:02,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:20:02,963 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 599 [2024-10-12 16:20:02,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:20:02,977 INFO L225 Difference]: With dead ends: 28903 [2024-10-12 16:20:02,977 INFO L226 Difference]: Without dead ends: 15051 [2024-10-12 16:20:02,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 597 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:20:02,988 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 317 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1506 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 1611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:20:02,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 355 Invalid, 1611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1506 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 16:20:02,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15051 states. [2024-10-12 16:20:03,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15051 to 14751. [2024-10-12 16:20:03,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14751 states, 14750 states have (on average 1.079728813559322) internal successors, (15926), 14750 states have internal predecessors, (15926), 0 states have call successors, (0), 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:20:03,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14751 states to 14751 states and 15926 transitions. [2024-10-12 16:20:03,150 INFO L78 Accepts]: Start accepts. Automaton has 14751 states and 15926 transitions. Word has length 599 [2024-10-12 16:20:03,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:20:03,150 INFO L471 AbstractCegarLoop]: Abstraction has 14751 states and 15926 transitions. [2024-10-12 16:20:03,150 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:20:03,151 INFO L276 IsEmpty]: Start isEmpty. Operand 14751 states and 15926 transitions. [2024-10-12 16:20:03,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 637 [2024-10-12 16:20:03,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:20:03,160 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, 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, 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:20:03,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-12 16:20:03,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:20:03,361 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:20:03,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:20:03,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1959120933, now seen corresponding path program 1 times [2024-10-12 16:20:03,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:20:03,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146380501] [2024-10-12 16:20:03,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:20:03,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:20:03,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:20:03,731 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-10-12 16:20:03,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:20:03,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146380501] [2024-10-12 16:20:03,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146380501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:20:03,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:20:03,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:20:03,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97656096] [2024-10-12 16:20:03,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:20:03,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:20:03,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:20:03,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:20:03,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:20:03,733 INFO L87 Difference]: Start difference. First operand 14751 states and 15926 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 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:20:04,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:20:04,965 INFO L93 Difference]: Finished difference Result 37569 states and 40550 transitions. [2024-10-12 16:20:04,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:20:04,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 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 636 [2024-10-12 16:20:04,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:20:04,989 INFO L225 Difference]: With dead ends: 37569 [2024-10-12 16:20:04,990 INFO L226 Difference]: Without dead ends: 18932 [2024-10-12 16:20:05,002 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:20:05,003 INFO L432 NwaCegarLoop]: 605 mSDtfsCounter, 280 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 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:20:05,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 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:20:05,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18932 states. [2024-10-12 16:20:05,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18932 to 17138. [2024-10-12 16:20:05,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17138 states, 17137 states have (on average 1.0516426445702283) internal successors, (18022), 17137 states have internal predecessors, (18022), 0 states have call successors, (0), 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:20:05,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17138 states to 17138 states and 18022 transitions. [2024-10-12 16:20:05,174 INFO L78 Accepts]: Start accepts. Automaton has 17138 states and 18022 transitions. Word has length 636 [2024-10-12 16:20:05,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:20:05,174 INFO L471 AbstractCegarLoop]: Abstraction has 17138 states and 18022 transitions. [2024-10-12 16:20:05,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 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:20:05,175 INFO L276 IsEmpty]: Start isEmpty. Operand 17138 states and 18022 transitions. [2024-10-12 16:20:05,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2024-10-12 16:20:05,185 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:20:05,186 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, 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, 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:20:05,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 16:20:05,186 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:20:05,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:20:05,187 INFO L85 PathProgramCache]: Analyzing trace with hash -150638533, now seen corresponding path program 1 times [2024-10-12 16:20:05,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:20:05,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126652446] [2024-10-12 16:20:05,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:20:05,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:20:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:20:05,761 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 453 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-12 16:20:05,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:20:05,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126652446] [2024-10-12 16:20:05,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126652446] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:20:05,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:20:05,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:20:05,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446677300] [2024-10-12 16:20:05,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:20:05,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:20:05,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:20:05,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:20:05,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:20:05,765 INFO L87 Difference]: Start difference. First operand 17138 states and 18022 transitions. Second operand has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 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:20:06,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:20:06,877 INFO L93 Difference]: Finished difference Result 39664 states and 41722 transitions. [2024-10-12 16:20:06,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:20:06,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 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 660 [2024-10-12 16:20:06,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:20:06,894 INFO L225 Difference]: With dead ends: 39664 [2024-10-12 16:20:06,895 INFO L226 Difference]: Without dead ends: 20135 [2024-10-12 16:20:06,909 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:20:06,909 INFO L432 NwaCegarLoop]: 532 mSDtfsCounter, 90 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:20:06,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 564 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 16:20:06,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20135 states. [2024-10-12 16:20:07,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20135 to 20133. [2024-10-12 16:20:07,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20133 states, 20132 states have (on average 1.0469898668786013) internal successors, (21078), 20132 states have internal predecessors, (21078), 0 states have call successors, (0), 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:20:07,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20133 states to 20133 states and 21078 transitions. [2024-10-12 16:20:07,130 INFO L78 Accepts]: Start accepts. Automaton has 20133 states and 21078 transitions. Word has length 660 [2024-10-12 16:20:07,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:20:07,130 INFO L471 AbstractCegarLoop]: Abstraction has 20133 states and 21078 transitions. [2024-10-12 16:20:07,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 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:20:07,131 INFO L276 IsEmpty]: Start isEmpty. Operand 20133 states and 21078 transitions. [2024-10-12 16:20:07,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 763 [2024-10-12 16:20:07,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:20:07,148 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, 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, 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:20:07,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 16:20:07,148 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:20:07,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:20:07,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1378630746, now seen corresponding path program 1 times [2024-10-12 16:20:07,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:20:07,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725692493] [2024-10-12 16:20:07,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:20:07,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:20:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:20:07,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1197 backedges. 623 proven. 0 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2024-10-12 16:20:07,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:20:07,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725692493] [2024-10-12 16:20:07,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725692493] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:20:07,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:20:07,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:20:07,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407374508] [2024-10-12 16:20:07,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:20:07,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:20:07,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:20:07,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:20:07,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:20:07,552 INFO L87 Difference]: Start difference. First operand 20133 states and 21078 transitions. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 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:20:08,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:20:08,642 INFO L93 Difference]: Finished difference Result 44448 states and 46623 transitions. [2024-10-12 16:20:08,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:20:08,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 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 762 [2024-10-12 16:20:08,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:20:08,675 INFO L225 Difference]: With dead ends: 44448 [2024-10-12 16:20:08,675 INFO L226 Difference]: Without dead ends: 24316 [2024-10-12 16:20:08,692 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:20:08,693 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 184 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:20:08,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 215 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 16:20:08,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24316 states. [2024-10-12 16:20:08,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24316 to 22223. [2024-10-12 16:20:08,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22223 states, 22222 states have (on average 1.046350463504635) internal successors, (23252), 22222 states have internal predecessors, (23252), 0 states have call successors, (0), 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:20:08,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22223 states to 22223 states and 23252 transitions. [2024-10-12 16:20:08,939 INFO L78 Accepts]: Start accepts. Automaton has 22223 states and 23252 transitions. Word has length 762 [2024-10-12 16:20:08,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:20:08,940 INFO L471 AbstractCegarLoop]: Abstraction has 22223 states and 23252 transitions. [2024-10-12 16:20:08,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 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:20:08,940 INFO L276 IsEmpty]: Start isEmpty. Operand 22223 states and 23252 transitions. [2024-10-12 16:20:08,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 821 [2024-10-12 16:20:08,953 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:20:08,953 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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:20:08,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 16:20:08,954 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:20:08,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:20:08,954 INFO L85 PathProgramCache]: Analyzing trace with hash -2014922092, now seen corresponding path program 1 times [2024-10-12 16:20:08,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:20:08,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070992160] [2024-10-12 16:20:08,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:20:08,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:20:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:20:09,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1014 backedges. 517 proven. 0 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2024-10-12 16:20:09,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:20:09,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070992160] [2024-10-12 16:20:09,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070992160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:20:09,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:20:09,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:20:09,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595220583] [2024-10-12 16:20:09,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:20:09,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:20:09,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:20:09,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:20:09,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:20:09,377 INFO L87 Difference]: Start difference. First operand 22223 states and 23252 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:20:10,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:20:10,415 INFO L93 Difference]: Finished difference Result 48327 states and 50592 transitions. [2024-10-12 16:20:10,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:20:10,416 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 820 [2024-10-12 16:20:10,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:20:10,441 INFO L225 Difference]: With dead ends: 48327 [2024-10-12 16:20:10,441 INFO L226 Difference]: Without dead ends: 24909 [2024-10-12 16:20:10,454 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:20:10,455 INFO L432 NwaCegarLoop]: 513 mSDtfsCounter, 317 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 16:20:10,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 551 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 16:20:10,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24909 states. [2024-10-12 16:20:10,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24909 to 21915. [2024-10-12 16:20:10,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21915 states, 21914 states have (on average 1.0428949529980833) internal successors, (22854), 21914 states have internal predecessors, (22854), 0 states have call successors, (0), 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:20:10,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21915 states to 21915 states and 22854 transitions. [2024-10-12 16:20:10,615 INFO L78 Accepts]: Start accepts. Automaton has 21915 states and 22854 transitions. Word has length 820 [2024-10-12 16:20:10,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:20:10,615 INFO L471 AbstractCegarLoop]: Abstraction has 21915 states and 22854 transitions. [2024-10-12 16:20:10,615 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:20:10,615 INFO L276 IsEmpty]: Start isEmpty. Operand 21915 states and 22854 transitions. [2024-10-12 16:20:10,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 842 [2024-10-12 16:20:10,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:20:10,625 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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:20:10,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 16:20:10,625 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:20:10,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:20:10,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1635210182, now seen corresponding path program 1 times [2024-10-12 16:20:10,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:20:10,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782154891] [2024-10-12 16:20:10,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:20:10,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:20:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:20:12,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 587 proven. 269 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2024-10-12 16:20:12,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:20:12,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782154891] [2024-10-12 16:20:12,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782154891] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:20:12,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839738] [2024-10-12 16:20:12,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:20:12,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:20:12,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:20:12,075 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:20:12,077 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:20:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:20:12,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 16:20:12,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:20:12,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2024-10-12 16:20:12,451 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:20:12,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839738] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:20:12,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:20:12,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-12 16:20:12,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199629323] [2024-10-12 16:20:12,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:20:12,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:20:12,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:20:12,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:20:12,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:20:12,455 INFO L87 Difference]: Start difference. First operand 21915 states and 22854 transitions. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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:20:13,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:20:13,520 INFO L93 Difference]: Finished difference Result 49530 states and 51608 transitions. [2024-10-12 16:20:13,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:20:13,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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 841 [2024-10-12 16:20:13,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:20:13,549 INFO L225 Difference]: With dead ends: 49530 [2024-10-12 16:20:13,549 INFO L226 Difference]: Without dead ends: 27616 [2024-10-12 16:20:13,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 844 GetRequests, 840 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:20:13,563 INFO L432 NwaCegarLoop]: 507 mSDtfsCounter, 299 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:20:13,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 536 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 16:20:13,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27616 states. [2024-10-12 16:20:13,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27616 to 24912. [2024-10-12 16:20:13,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24912 states, 24911 states have (on average 1.0418690538316406) internal successors, (25954), 24911 states have internal predecessors, (25954), 0 states have call successors, (0), 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:20:13,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24912 states to 24912 states and 25954 transitions. [2024-10-12 16:20:13,784 INFO L78 Accepts]: Start accepts. Automaton has 24912 states and 25954 transitions. Word has length 841 [2024-10-12 16:20:13,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:20:13,785 INFO L471 AbstractCegarLoop]: Abstraction has 24912 states and 25954 transitions. [2024-10-12 16:20:13,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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:20:13,785 INFO L276 IsEmpty]: Start isEmpty. Operand 24912 states and 25954 transitions. [2024-10-12 16:20:13,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 875 [2024-10-12 16:20:13,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:20:13,797 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, 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, 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, 3, 3, 3, 3, 3, 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] [2024-10-12 16:20:13,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-12 16:20:13,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:20:13,998 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:20:13,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:20:13,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1990153818, now seen corresponding path program 1 times [2024-10-12 16:20:13,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:20:13,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720583417] [2024-10-12 16:20:13,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:20:13,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:20:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:20:14,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1376 backedges. 734 proven. 0 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked. [2024-10-12 16:20:14,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:20:14,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720583417] [2024-10-12 16:20:14,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720583417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:20:14,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:20:14,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:20:14,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284774368] [2024-10-12 16:20:14,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:20:14,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:20:14,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:20:14,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:20:14,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:20:14,959 INFO L87 Difference]: Start difference. First operand 24912 states and 25954 transitions. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 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:20:16,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:20:16,175 INFO L93 Difference]: Finished difference Result 54626 states and 56858 transitions. [2024-10-12 16:20:16,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:20:16,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 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 874 [2024-10-12 16:20:16,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:20:16,204 INFO L225 Difference]: With dead ends: 54626 [2024-10-12 16:20:16,204 INFO L226 Difference]: Without dead ends: 29416 [2024-10-12 16:20:16,221 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:20:16,222 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 147 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:20:16,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 531 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 16:20:16,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29416 states. [2024-10-12 16:20:16,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29416 to 24609. [2024-10-12 16:20:16,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24609 states, 24608 states have (on average 1.0419375812743823) internal successors, (25640), 24608 states have internal predecessors, (25640), 0 states have call successors, (0), 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:20:16,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24609 states to 24609 states and 25640 transitions. [2024-10-12 16:20:16,508 INFO L78 Accepts]: Start accepts. Automaton has 24609 states and 25640 transitions. Word has length 874 [2024-10-12 16:20:16,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:20:16,509 INFO L471 AbstractCegarLoop]: Abstraction has 24609 states and 25640 transitions. [2024-10-12 16:20:16,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 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:20:16,509 INFO L276 IsEmpty]: Start isEmpty. Operand 24609 states and 25640 transitions. [2024-10-12 16:20:16,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 879 [2024-10-12 16:20:16,518 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:20:16,519 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:20:16,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 16:20:16,519 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:20:16,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:20:16,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1905417787, now seen corresponding path program 1 times [2024-10-12 16:20:16,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:20:16,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613644661] [2024-10-12 16:20:16,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:20:16,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:20:16,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:20:17,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 661 proven. 269 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2024-10-12 16:20:17,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:20:17,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613644661] [2024-10-12 16:20:17,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613644661] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:20:17,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686862378] [2024-10-12 16:20:17,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:20:17,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:20:17,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:20:17,972 INFO L229 MonitoredProcess]: Starting monitored process 6 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:20:17,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 16:20:18,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:20:18,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 1011 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:20:18,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:20:27,430 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-10-12 16:20:27,434 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-10-12 16:20:27,439 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-10-12 16:20:27,555 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-10-12 16:20:27,704 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-10-12 16:20:27,799 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-10-12 16:20:27,802 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-10-12 16:20:27,806 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-10-12 16:20:27,895 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-10-12 16:20:29,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-10-12 16:20:29,516 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:20:29,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686862378] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:20:29,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:20:29,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-12 16:20:29,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322628336] [2024-10-12 16:20:29,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:20:29,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:20:29,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:20:29,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:20:29,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:20:29,519 INFO L87 Difference]: Start difference. First operand 24609 states and 25640 transitions. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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:20:30,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:20:30,654 INFO L93 Difference]: Finished difference Result 54321 states and 56556 transitions. [2024-10-12 16:20:30,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:20:30,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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 878 [2024-10-12 16:20:30,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:20:30,682 INFO L225 Difference]: With dead ends: 54321 [2024-10-12 16:20:30,682 INFO L226 Difference]: Without dead ends: 29713 [2024-10-12 16:20:30,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 881 GetRequests, 877 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:20:30,699 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 317 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 929 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:20:30,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 446 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 929 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 16:20:30,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29713 states. [2024-10-12 16:20:30,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29713 to 24016. [2024-10-12 16:20:30,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24016 states, 24015 states have (on average 1.0428898605038517) internal successors, (25045), 24015 states have internal predecessors, (25045), 0 states have call successors, (0), 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:20:30,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24016 states to 24016 states and 25045 transitions. [2024-10-12 16:20:30,892 INFO L78 Accepts]: Start accepts. Automaton has 24016 states and 25045 transitions. Word has length 878 [2024-10-12 16:20:30,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:20:30,892 INFO L471 AbstractCegarLoop]: Abstraction has 24016 states and 25045 transitions. [2024-10-12 16:20:30,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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:20:30,893 INFO L276 IsEmpty]: Start isEmpty. Operand 24016 states and 25045 transitions. [2024-10-12 16:20:30,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1000 [2024-10-12 16:20:30,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:20:30,903 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:20:30,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-12 16:20:31,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:20:31,104 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:20:31,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:20:31,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1596389507, now seen corresponding path program 1 times [2024-10-12 16:20:31,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:20:31,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177476831] [2024-10-12 16:20:31,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:20:31,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:20:31,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:20:32,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 1206 proven. 90 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2024-10-12 16:20:32,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:20:32,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177476831] [2024-10-12 16:20:32,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177476831] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:20:32,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023279413] [2024-10-12 16:20:32,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:20:32,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:20:32,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:20:32,676 INFO L229 MonitoredProcess]: Starting monitored process 7 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:20:32,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-12 16:20:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:20:33,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 1153 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 16:20:33,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:20:33,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 1088 proven. 374 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2024-10-12 16:20:33,598 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 16:20:33,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 808 proven. 0 refuted. 0 times theorem prover too weak. 842 trivial. 0 not checked. [2024-10-12 16:20:33,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023279413] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-12 16:20:33,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-12 16:20:33,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 6] total 10 [2024-10-12 16:20:33,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000025555] [2024-10-12 16:20:33,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:20:33,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:20:33,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:20:33,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:20:33,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-12 16:20:33,827 INFO L87 Difference]: Start difference. First operand 24016 states and 25045 transitions. Second operand has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 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:20:35,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:20:35,110 INFO L93 Difference]: Finished difference Result 50131 states and 52237 transitions. [2024-10-12 16:20:35,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:20:35,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 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 999 [2024-10-12 16:20:35,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:20:35,112 INFO L225 Difference]: With dead ends: 50131 [2024-10-12 16:20:35,113 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 16:20:35,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2003 GetRequests, 1995 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-12 16:20:35,134 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 629 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:20:35,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 49 Invalid, 1298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 16:20:35,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 16:20:35,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 16:20:35,135 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:20:35,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 16:20:35,136 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 999 [2024-10-12 16:20:35,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:20:35,136 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 16:20:35,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 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:20:35,137 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 16:20:35,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 16:20:35,140 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 16:20:35,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-12 16:20:35,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:20:35,344 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] [2024-10-12 16:20:35,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.