./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label40.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label40.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 5822f6dcecb89719be961a38493299a8716c4a47f733fff54adb51e7e48a109b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 11:22:39,299 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 11:22:39,369 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 11:22:39,376 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 11:22:39,378 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 11:22:39,400 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 11:22:39,401 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 11:22:39,402 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 11:22:39,402 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 11:22:39,403 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 11:22:39,404 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 11:22:39,404 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 11:22:39,405 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 11:22:39,407 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 11:22:39,407 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 11:22:39,408 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 11:22:39,408 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 11:22:39,408 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 11:22:39,408 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 11:22:39,409 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 11:22:39,409 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 11:22:39,413 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 11:22:39,414 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 11:22:39,414 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 11:22:39,414 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 11:22:39,414 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 11:22:39,414 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 11:22:39,415 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 11:22:39,415 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 11:22:39,415 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 11:22:39,415 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 11:22:39,416 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 11:22:39,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:22:39,416 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 11:22:39,416 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 11:22:39,417 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 11:22:39,417 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 11:22:39,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 11:22:39,417 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 11:22:39,418 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 11:22:39,418 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 11:22:39,420 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 11:22:39,420 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 -> 5822f6dcecb89719be961a38493299a8716c4a47f733fff54adb51e7e48a109b [2024-11-08 11:22:39,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 11:22:39,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 11:22:39,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 11:22:39,721 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 11:22:39,722 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 11:22:39,724 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label40.c [2024-11-08 11:22:41,220 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 11:22:41,648 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 11:22:41,649 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label40.c [2024-11-08 11:22:41,703 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5cbb3d1c/9dd6235d644648dbb77cb33c24e393a2/FLAG0fba2ad52 [2024-11-08 11:22:41,792 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5cbb3d1c/9dd6235d644648dbb77cb33c24e393a2 [2024-11-08 11:22:41,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 11:22:41,796 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 11:22:41,798 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 11:22:41,798 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 11:22:41,803 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 11:22:41,804 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:22:41" (1/1) ... [2024-11-08 11:22:41,805 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24126645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:22:41, skipping insertion in model container [2024-11-08 11:22:41,805 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:22:41" (1/1) ... [2024-11-08 11:22:41,919 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 11:22:42,216 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label40.c[4201,4214] [2024-11-08 11:22:43,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:22:43,117 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 11:22:43,141 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label40.c[4201,4214] [2024-11-08 11:22:43,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:22:43,697 INFO L204 MainTranslator]: Completed translation [2024-11-08 11:22:43,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:22:43 WrapperNode [2024-11-08 11:22:43,698 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 11:22:43,699 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 11:22:43,699 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 11:22:43,699 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 11:22:43,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:22:43" (1/1) ... [2024-11-08 11:22:43,765 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:22:43" (1/1) ... [2024-11-08 11:22:44,460 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-11-08 11:22:44,461 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 11:22:44,461 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 11:22:44,461 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 11:22:44,462 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 11:22:44,485 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:22:43" (1/1) ... [2024-11-08 11:22:44,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:22:43" (1/1) ... [2024-11-08 11:22:44,727 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:22:43" (1/1) ... [2024-11-08 11:22:44,993 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 11:22:44,994 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:22:43" (1/1) ... [2024-11-08 11:22:44,994 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:22:43" (1/1) ... [2024-11-08 11:22:45,269 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:22:43" (1/1) ... [2024-11-08 11:22:45,295 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:22:43" (1/1) ... [2024-11-08 11:22:45,341 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:22:43" (1/1) ... [2024-11-08 11:22:45,365 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:22:43" (1/1) ... [2024-11-08 11:22:45,433 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 11:22:45,434 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 11:22:45,434 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 11:22:45,434 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 11:22:45,435 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:22:43" (1/1) ... [2024-11-08 11:22:45,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:22:45,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:22:45,470 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 11:22:45,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 11:22:45,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 11:22:45,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 11:22:45,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 11:22:45,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 11:22:45,599 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 11:22:45,601 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 11:22:51,572 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-11-08 11:22:51,572 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 11:22:51,622 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 11:22:51,623 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 11:22:51,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:22:51 BoogieIcfgContainer [2024-11-08 11:22:51,624 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 11:22:51,625 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 11:22:51,626 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 11:22:51,629 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 11:22:51,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:22:41" (1/3) ... [2024-11-08 11:22:51,630 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3607324a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:22:51, skipping insertion in model container [2024-11-08 11:22:51,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:22:43" (2/3) ... [2024-11-08 11:22:51,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3607324a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:22:51, skipping insertion in model container [2024-11-08 11:22:51,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:22:51" (3/3) ... [2024-11-08 11:22:51,632 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label40.c [2024-11-08 11:22:51,649 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 11:22:51,649 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 11:22:51,752 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 11:22:51,759 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;@77d92237, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 11:22:51,760 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 11:22:51,769 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:51,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 11:22:51,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:22:51,777 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] [2024-11-08 11:22:51,777 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:22:51,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:22:51,782 INFO L85 PathProgramCache]: Analyzing trace with hash -716875070, now seen corresponding path program 1 times [2024-11-08 11:22:51,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:22:51,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429720260] [2024-11-08 11:22:51,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:22:51,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:22:51,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:22:52,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:22:52,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:22:52,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429720260] [2024-11-08 11:22:52,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429720260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:22:52,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:22:52,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:22:52,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618090308] [2024-11-08 11:22:52,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:22:52,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:22:52,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:22:52,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:22:52,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:22:52,148 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 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 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:56,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:22:56,289 INFO L93 Difference]: Finished difference Result 3147 states and 5806 transitions. [2024-11-08 11:22:56,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:22:56,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-08 11:22:56,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:22:56,328 INFO L225 Difference]: With dead ends: 3147 [2024-11-08 11:22:56,329 INFO L226 Difference]: Without dead ends: 1964 [2024-11-08 11:22:56,339 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-11-08 11:22:56,344 INFO L432 NwaCegarLoop]: 764 mSDtfsCounter, 1151 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 584 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 3298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 584 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:22:56,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 992 Invalid, 3298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [584 Valid, 2714 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-08 11:22:56,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2024-11-08 11:22:56,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1951. [2024-11-08 11:22:56,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1951 states, 1950 states have (on average 1.6538461538461537) internal successors, (3225), 1950 states have internal predecessors, (3225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:56,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1951 states and 3225 transitions. [2024-11-08 11:22:56,480 INFO L78 Accepts]: Start accepts. Automaton has 1951 states and 3225 transitions. Word has length 28 [2024-11-08 11:22:56,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:22:56,480 INFO L471 AbstractCegarLoop]: Abstraction has 1951 states and 3225 transitions. [2024-11-08 11:22:56,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:56,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 3225 transitions. [2024-11-08 11:22:56,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 11:22:56,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:22:56,484 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:22:56,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 11:22:56,484 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:22:56,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:22:56,485 INFO L85 PathProgramCache]: Analyzing trace with hash 215513083, now seen corresponding path program 1 times [2024-11-08 11:22:56,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:22:56,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476060254] [2024-11-08 11:22:56,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:22:56,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:22:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:22:56,706 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:22:56,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:22:56,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476060254] [2024-11-08 11:22:56,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476060254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:22:56,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:22:56,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:22:56,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639988759] [2024-11-08 11:22:56,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:22:56,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:22:56,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:22:56,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:22:56,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:22:56,711 INFO L87 Difference]: Start difference. First operand 1951 states and 3225 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:23:00,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:23:00,739 INFO L93 Difference]: Finished difference Result 5542 states and 9222 transitions. [2024-11-08 11:23:00,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:23:00,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2024-11-08 11:23:00,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:23:00,754 INFO L225 Difference]: With dead ends: 5542 [2024-11-08 11:23:00,755 INFO L226 Difference]: Without dead ends: 3593 [2024-11-08 11:23:00,759 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-11-08 11:23:00,761 INFO L432 NwaCegarLoop]: 872 mSDtfsCounter, 924 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2592 mSolverCounterSat, 749 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 3341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 749 IncrementalHoareTripleChecker+Valid, 2592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-08 11:23:00,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 1009 Invalid, 3341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [749 Valid, 2592 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-08 11:23:00,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3593 states. [2024-11-08 11:23:00,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3593 to 3581. [2024-11-08 11:23:00,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3581 states, 3580 states have (on average 1.5050279329608938) internal successors, (5388), 3580 states have internal predecessors, (5388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:23:00,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3581 states to 3581 states and 5388 transitions. [2024-11-08 11:23:00,846 INFO L78 Accepts]: Start accepts. Automaton has 3581 states and 5388 transitions. Word has length 99 [2024-11-08 11:23:00,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:23:00,847 INFO L471 AbstractCegarLoop]: Abstraction has 3581 states and 5388 transitions. [2024-11-08 11:23:00,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:23:00,848 INFO L276 IsEmpty]: Start isEmpty. Operand 3581 states and 5388 transitions. [2024-11-08 11:23:00,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 11:23:00,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:23:00,851 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:23:00,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 11:23:00,851 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:23:00,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:23:00,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1129801848, now seen corresponding path program 1 times [2024-11-08 11:23:00,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:23:00,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302602222] [2024-11-08 11:23:00,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:23:00,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:23:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:23:01,043 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:23:01,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:23:01,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302602222] [2024-11-08 11:23:01,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302602222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:23:01,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:23:01,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:23:01,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230797024] [2024-11-08 11:23:01,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:23:01,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:23:01,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:23:01,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:23:01,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:23:01,048 INFO L87 Difference]: Start difference. First operand 3581 states and 5388 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:23:04,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:23:04,332 INFO L93 Difference]: Finished difference Result 10352 states and 15625 transitions. [2024-11-08 11:23:04,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:23:04,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2024-11-08 11:23:04,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:23:04,357 INFO L225 Difference]: With dead ends: 10352 [2024-11-08 11:23:04,358 INFO L226 Difference]: Without dead ends: 6773 [2024-11-08 11:23:04,363 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-11-08 11:23:04,364 INFO L432 NwaCegarLoop]: 1021 mSDtfsCounter, 786 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 2491 mSolverCounterSat, 786 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 3277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 786 IncrementalHoareTripleChecker+Valid, 2491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:23:04,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 1171 Invalid, 3277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [786 Valid, 2491 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-08 11:23:04,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6773 states. [2024-11-08 11:23:04,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6773 to 6749. [2024-11-08 11:23:04,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6749 states, 6748 states have (on average 1.3255779490219324) internal successors, (8945), 6748 states have internal predecessors, (8945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:23:04,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6749 states to 6749 states and 8945 transitions. [2024-11-08 11:23:04,480 INFO L78 Accepts]: Start accepts. Automaton has 6749 states and 8945 transitions. Word has length 113 [2024-11-08 11:23:04,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:23:04,480 INFO L471 AbstractCegarLoop]: Abstraction has 6749 states and 8945 transitions. [2024-11-08 11:23:04,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:23:04,484 INFO L276 IsEmpty]: Start isEmpty. Operand 6749 states and 8945 transitions. [2024-11-08 11:23:04,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 11:23:04,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:23:04,487 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:23:04,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 11:23:04,491 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:23:04,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:23:04,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1928986802, now seen corresponding path program 1 times [2024-11-08 11:23:04,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:23:04,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805088066] [2024-11-08 11:23:04,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:23:04,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:23:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:23:04,752 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:23:04,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:23:04,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805088066] [2024-11-08 11:23:04,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805088066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:23:04,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:23:04,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:23:04,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887386852] [2024-11-08 11:23:04,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:23:04,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:23:04,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:23:04,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:23:04,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:23:04,755 INFO L87 Difference]: Start difference. First operand 6749 states and 8945 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:23:07,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:23:07,885 INFO L93 Difference]: Finished difference Result 19804 states and 26226 transitions. [2024-11-08 11:23:07,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:23:07,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2024-11-08 11:23:07,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:23:07,922 INFO L225 Difference]: With dead ends: 19804 [2024-11-08 11:23:07,923 INFO L226 Difference]: Without dead ends: 13057 [2024-11-08 11:23:07,931 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-11-08 11:23:07,933 INFO L432 NwaCegarLoop]: 883 mSDtfsCounter, 865 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 2330 mSolverCounterSat, 875 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 3205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 875 IncrementalHoareTripleChecker+Valid, 2330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-08 11:23:07,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 1035 Invalid, 3205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [875 Valid, 2330 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-08 11:23:07,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13057 states. [2024-11-08 11:23:08,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13057 to 13052. [2024-11-08 11:23:08,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13052 states, 13051 states have (on average 1.2182208259903455) internal successors, (15899), 13051 states have internal predecessors, (15899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:23:08,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13052 states to 13052 states and 15899 transitions. [2024-11-08 11:23:08,172 INFO L78 Accepts]: Start accepts. Automaton has 13052 states and 15899 transitions. Word has length 142 [2024-11-08 11:23:08,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:23:08,172 INFO L471 AbstractCegarLoop]: Abstraction has 13052 states and 15899 transitions. [2024-11-08 11:23:08,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:23:08,174 INFO L276 IsEmpty]: Start isEmpty. Operand 13052 states and 15899 transitions. [2024-11-08 11:23:08,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 11:23:08,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:23:08,175 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:23:08,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 11:23:08,177 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:23:08,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:23:08,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1888751763, now seen corresponding path program 1 times [2024-11-08 11:23:08,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:23:08,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659335647] [2024-11-08 11:23:08,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:23:08,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:23:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:23:08,396 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:23:08,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:23:08,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659335647] [2024-11-08 11:23:08,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659335647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:23:08,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:23:08,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:23:08,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539357993] [2024-11-08 11:23:08,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:23:08,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:23:08,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:23:08,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:23:08,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:23:08,402 INFO L87 Difference]: Start difference. First operand 13052 states and 15899 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:23:15,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:23:15,477 INFO L93 Difference]: Finished difference Result 47613 states and 58541 transitions. [2024-11-08 11:23:15,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:23:15,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 153 [2024-11-08 11:23:15,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:23:15,553 INFO L225 Difference]: With dead ends: 47613 [2024-11-08 11:23:15,554 INFO L226 Difference]: Without dead ends: 34563 [2024-11-08 11:23:15,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:23:15,570 INFO L432 NwaCegarLoop]: 1010 mSDtfsCounter, 1651 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 7510 mSolverCounterSat, 602 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1651 SdHoareTripleChecker+Valid, 1300 SdHoareTripleChecker+Invalid, 8112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 602 IncrementalHoareTripleChecker+Valid, 7510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:23:15,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1651 Valid, 1300 Invalid, 8112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [602 Valid, 7510 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2024-11-08 11:23:15,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34563 states. [2024-11-08 11:23:15,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34563 to 34360. [2024-11-08 11:23:16,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34360 states, 34359 states have (on average 1.1786431502663057) internal successors, (40497), 34359 states have internal predecessors, (40497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:23:16,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34360 states to 34360 states and 40497 transitions. [2024-11-08 11:23:16,064 INFO L78 Accepts]: Start accepts. Automaton has 34360 states and 40497 transitions. Word has length 153 [2024-11-08 11:23:16,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:23:16,065 INFO L471 AbstractCegarLoop]: Abstraction has 34360 states and 40497 transitions. [2024-11-08 11:23:16,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:23:16,067 INFO L276 IsEmpty]: Start isEmpty. Operand 34360 states and 40497 transitions. [2024-11-08 11:23:16,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-08 11:23:16,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:23:16,070 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:23:16,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 11:23:16,071 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:23:16,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:23:16,072 INFO L85 PathProgramCache]: Analyzing trace with hash 245627492, now seen corresponding path program 1 times [2024-11-08 11:23:16,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:23:16,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301973066] [2024-11-08 11:23:16,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:23:16,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:23:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:23:16,495 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-08 11:23:16,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:23:16,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301973066] [2024-11-08 11:23:16,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301973066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:23:16,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:23:16,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:23:16,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403096116] [2024-11-08 11:23:16,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:23:16,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:23:16,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:23:16,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:23:16,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:23:16,497 INFO L87 Difference]: Start difference. First operand 34360 states and 40497 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:23:19,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:23:19,573 INFO L93 Difference]: Finished difference Result 69505 states and 81794 transitions. [2024-11-08 11:23:19,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:23:19,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 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 218 [2024-11-08 11:23:19,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:23:19,650 INFO L225 Difference]: With dead ends: 69505 [2024-11-08 11:23:19,650 INFO L226 Difference]: Without dead ends: 35147 [2024-11-08 11:23:19,685 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-11-08 11:23:19,687 INFO L432 NwaCegarLoop]: 1083 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2520 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 2529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:23:19,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1212 Invalid, 2529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2520 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-08 11:23:19,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35147 states. [2024-11-08 11:23:20,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35147 to 35147. [2024-11-08 11:23:20,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35147 states, 35146 states have (on average 1.1747851818130086) internal successors, (41289), 35146 states have internal predecessors, (41289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:23:20,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35147 states to 35147 states and 41289 transitions. [2024-11-08 11:23:20,278 INFO L78 Accepts]: Start accepts. Automaton has 35147 states and 41289 transitions. Word has length 218 [2024-11-08 11:23:20,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:23:20,278 INFO L471 AbstractCegarLoop]: Abstraction has 35147 states and 41289 transitions. [2024-11-08 11:23:20,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:23:20,279 INFO L276 IsEmpty]: Start isEmpty. Operand 35147 states and 41289 transitions. [2024-11-08 11:23:20,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-08 11:23:20,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:23:20,283 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:23:20,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 11:23:20,283 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:23:20,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:23:20,284 INFO L85 PathProgramCache]: Analyzing trace with hash 518295855, now seen corresponding path program 1 times [2024-11-08 11:23:20,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:23:20,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761778825] [2024-11-08 11:23:20,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:23:20,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:23:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:23:20,567 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:23:20,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:23:20,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761778825] [2024-11-08 11:23:20,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761778825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:23:20,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:23:20,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:23:20,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688300088] [2024-11-08 11:23:20,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:23:20,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:23:20,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:23:20,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:23:20,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:23:20,571 INFO L87 Difference]: Start difference. First operand 35147 states and 41289 transitions. Second operand has 4 states, 4 states have (on average 56.25) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:23:26,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:23:26,964 INFO L93 Difference]: Finished difference Result 94992 states and 112854 transitions. [2024-11-08 11:23:26,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:23:26,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 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 225 [2024-11-08 11:23:26,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:23:27,042 INFO L225 Difference]: With dead ends: 94992 [2024-11-08 11:23:27,042 INFO L226 Difference]: Without dead ends: 60634 [2024-11-08 11:23:27,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:23:27,076 INFO L432 NwaCegarLoop]: 632 mSDtfsCounter, 1724 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 6854 mSolverCounterSat, 1090 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1724 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 7944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1090 IncrementalHoareTripleChecker+Valid, 6854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:23:27,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1724 Valid, 884 Invalid, 7944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1090 Valid, 6854 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-11-08 11:23:27,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60634 states. [2024-11-08 11:23:27,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60634 to 60455. [2024-11-08 11:23:27,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60455 states, 60454 states have (on average 1.1679624177060244) internal successors, (70608), 60454 states have internal predecessors, (70608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:23:27,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60455 states to 60455 states and 70608 transitions. [2024-11-08 11:23:27,876 INFO L78 Accepts]: Start accepts. Automaton has 60455 states and 70608 transitions. Word has length 225 [2024-11-08 11:23:27,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:23:27,877 INFO L471 AbstractCegarLoop]: Abstraction has 60455 states and 70608 transitions. [2024-11-08 11:23:27,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:23:27,877 INFO L276 IsEmpty]: Start isEmpty. Operand 60455 states and 70608 transitions. [2024-11-08 11:23:27,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-08 11:23:27,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:23:27,880 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:23:27,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 11:23:27,880 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:23:27,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:23:27,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1054166602, now seen corresponding path program 1 times [2024-11-08 11:23:27,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:23:27,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621079117] [2024-11-08 11:23:27,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:23:27,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:23:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:23:28,239 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:23:28,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:23:28,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621079117] [2024-11-08 11:23:28,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621079117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:23:28,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:23:28,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:23:28,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141844772] [2024-11-08 11:23:28,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:23:28,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:23:28,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:23:28,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:23:28,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:23:28,243 INFO L87 Difference]: Start difference. First operand 60455 states and 70608 transitions. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:23:32,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:23:32,394 INFO L93 Difference]: Finished difference Result 146103 states and 173484 transitions. [2024-11-08 11:23:32,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:23:32,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 235 [2024-11-08 11:23:32,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:23:32,573 INFO L225 Difference]: With dead ends: 146103 [2024-11-08 11:23:32,574 INFO L226 Difference]: Without dead ends: 86437 [2024-11-08 11:23:32,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:23:32,630 INFO L432 NwaCegarLoop]: 964 mSDtfsCounter, 811 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 2449 mSolverCounterSat, 877 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 3326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 877 IncrementalHoareTripleChecker+Valid, 2449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:23:32,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 1083 Invalid, 3326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [877 Valid, 2449 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-08 11:23:32,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86437 states. [2024-11-08 11:23:33,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86437 to 84851. [2024-11-08 11:23:33,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84851 states, 84850 states have (on average 1.1580907483794933) internal successors, (98264), 84850 states have internal predecessors, (98264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:23:33,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84851 states to 84851 states and 98264 transitions. [2024-11-08 11:23:33,942 INFO L78 Accepts]: Start accepts. Automaton has 84851 states and 98264 transitions. Word has length 235 [2024-11-08 11:23:33,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:23:33,943 INFO L471 AbstractCegarLoop]: Abstraction has 84851 states and 98264 transitions. [2024-11-08 11:23:33,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:23:33,943 INFO L276 IsEmpty]: Start isEmpty. Operand 84851 states and 98264 transitions. [2024-11-08 11:23:33,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-08 11:23:33,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:23:33,946 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:23:33,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 11:23:33,946 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:23:33,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:23:33,956 INFO L85 PathProgramCache]: Analyzing trace with hash 945283299, now seen corresponding path program 1 times [2024-11-08 11:23:33,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:23:33,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174169700] [2024-11-08 11:23:33,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:23:33,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:23:33,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:23:34,101 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:23:34,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:23:34,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174169700] [2024-11-08 11:23:34,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174169700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:23:34,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:23:34,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:23:34,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193893330] [2024-11-08 11:23:34,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:23:34,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:23:34,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:23:34,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:23:34,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:23:34,105 INFO L87 Difference]: Start difference. First operand 84851 states and 98264 transitions. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:23:37,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:23:37,597 INFO L93 Difference]: Finished difference Result 166365 states and 192910 transitions. [2024-11-08 11:23:37,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:23:37,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 242 [2024-11-08 11:23:37,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:23:37,701 INFO L225 Difference]: With dead ends: 166365 [2024-11-08 11:23:37,701 INFO L226 Difference]: Without dead ends: 82303 [2024-11-08 11:23:37,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:23:37,748 INFO L432 NwaCegarLoop]: 1512 mSDtfsCounter, 1036 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 2354 mSolverCounterSat, 595 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 1648 SdHoareTripleChecker+Invalid, 2949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 595 IncrementalHoareTripleChecker+Valid, 2354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:23:37,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1036 Valid, 1648 Invalid, 2949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [595 Valid, 2354 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-08 11:23:37,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82303 states. [2024-11-08 11:23:38,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82303 to 75995. [2024-11-08 11:23:38,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75995 states, 75994 states have (on average 1.1166802642313867) internal successors, (84861), 75994 states have internal predecessors, (84861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:23:38,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75995 states to 75995 states and 84861 transitions. [2024-11-08 11:23:38,764 INFO L78 Accepts]: Start accepts. Automaton has 75995 states and 84861 transitions. Word has length 242 [2024-11-08 11:23:38,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:23:38,764 INFO L471 AbstractCegarLoop]: Abstraction has 75995 states and 84861 transitions. [2024-11-08 11:23:38,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:23:38,764 INFO L276 IsEmpty]: Start isEmpty. Operand 75995 states and 84861 transitions. [2024-11-08 11:23:38,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2024-11-08 11:23:38,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:23:38,769 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:23:38,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 11:23:38,770 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:23:38,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:23:38,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1755959963, now seen corresponding path program 1 times [2024-11-08 11:23:38,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:23:38,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694316027] [2024-11-08 11:23:38,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:23:38,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:23:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:23:39,160 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-08 11:23:39,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:23:39,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694316027] [2024-11-08 11:23:39,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694316027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:23:39,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:23:39,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:23:39,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373388880] [2024-11-08 11:23:39,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:23:39,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:23:39,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:23:39,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:23:39,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:23:39,167 INFO L87 Difference]: Start difference. First operand 75995 states and 84861 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:23:42,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:23:42,591 INFO L93 Difference]: Finished difference Result 153566 states and 171314 transitions. [2024-11-08 11:23:42,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:23:42,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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 314 [2024-11-08 11:23:42,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:23:42,682 INFO L225 Difference]: With dead ends: 153566 [2024-11-08 11:23:42,683 INFO L226 Difference]: Without dead ends: 78360 [2024-11-08 11:23:42,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:23:42,718 INFO L432 NwaCegarLoop]: 1391 mSDtfsCounter, 939 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 2487 mSolverCounterSat, 606 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 3093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 606 IncrementalHoareTripleChecker+Valid, 2487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:23:42,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 1477 Invalid, 3093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [606 Valid, 2487 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-08 11:23:42,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78360 states. [2024-11-08 11:23:43,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78360 to 75988. [2024-11-08 11:23:43,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75988 states, 75987 states have (on average 1.0957400607998737) internal successors, (83262), 75987 states have internal predecessors, (83262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:23:43,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75988 states to 75988 states and 83262 transitions. [2024-11-08 11:23:43,614 INFO L78 Accepts]: Start accepts. Automaton has 75988 states and 83262 transitions. Word has length 314 [2024-11-08 11:23:43,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:23:43,614 INFO L471 AbstractCegarLoop]: Abstraction has 75988 states and 83262 transitions. [2024-11-08 11:23:43,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:23:43,615 INFO L276 IsEmpty]: Start isEmpty. Operand 75988 states and 83262 transitions. [2024-11-08 11:23:43,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2024-11-08 11:23:43,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:23:43,617 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:23:43,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 11:23:43,617 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:23:43,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:23:43,618 INFO L85 PathProgramCache]: Analyzing trace with hash -444136852, now seen corresponding path program 1 times [2024-11-08 11:23:43,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:23:43,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926164767] [2024-11-08 11:23:43,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:23:43,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:23:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:23:44,246 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-08 11:23:44,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:23:44,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926164767] [2024-11-08 11:23:44,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926164767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:23:44,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:23:44,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:23:44,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134441803] [2024-11-08 11:23:44,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:23:44,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:23:44,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:23:44,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:23:44,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:23:44,249 INFO L87 Difference]: Start difference. First operand 75988 states and 83262 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-11-08 11:23:47,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:23:47,693 INFO L93 Difference]: Finished difference Result 173236 states and 190620 transitions. [2024-11-08 11:23:47,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:23:47,694 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 324 [2024-11-08 11:23:47,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:23:47,802 INFO L225 Difference]: With dead ends: 173236 [2024-11-08 11:23:47,803 INFO L226 Difference]: Without dead ends: 98037 [2024-11-08 11:23:47,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:23:47,844 INFO L432 NwaCegarLoop]: 765 mSDtfsCounter, 894 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 2402 mSolverCounterSat, 774 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 3176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 774 IncrementalHoareTripleChecker+Valid, 2402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:23:47,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 846 Invalid, 3176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [774 Valid, 2402 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-08 11:23:47,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98037 states. [2024-11-08 11:23:48,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98037 to 96447. [2024-11-08 11:23:48,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96447 states, 96446 states have (on average 1.0905791842067063) internal successors, (105182), 96446 states have internal predecessors, (105182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:23:49,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96447 states to 96447 states and 105182 transitions. [2024-11-08 11:23:49,089 INFO L78 Accepts]: Start accepts. Automaton has 96447 states and 105182 transitions. Word has length 324 [2024-11-08 11:23:49,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:23:49,089 INFO L471 AbstractCegarLoop]: Abstraction has 96447 states and 105182 transitions. [2024-11-08 11:23:49,089 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-11-08 11:23:49,089 INFO L276 IsEmpty]: Start isEmpty. Operand 96447 states and 105182 transitions. [2024-11-08 11:23:49,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2024-11-08 11:23:49,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:23:49,094 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:23:49,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 11:23:49,094 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:23:49,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:23:49,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1192441845, now seen corresponding path program 1 times [2024-11-08 11:23:49,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:23:49,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044083951] [2024-11-08 11:23:49,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:23:49,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:23:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:23:49,423 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-11-08 11:23:49,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:23:49,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044083951] [2024-11-08 11:23:49,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044083951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:23:49,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:23:49,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:23:49,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317533763] [2024-11-08 11:23:49,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:23:49,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:23:49,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:23:49,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:23:49,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:23:49,425 INFO L87 Difference]: Start difference. First operand 96447 states and 105182 transitions. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 2 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:23:53,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:23:53,252 INFO L93 Difference]: Finished difference Result 209437 states and 227970 transitions. [2024-11-08 11:23:53,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:23:53,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 2 states have internal predecessors, (222), 0 states have call successors, (0), 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 341 [2024-11-08 11:23:53,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:23:53,393 INFO L225 Difference]: With dead ends: 209437 [2024-11-08 11:23:53,393 INFO L226 Difference]: Without dead ends: 113779 [2024-11-08 11:23:53,427 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-11-08 11:23:53,427 INFO L432 NwaCegarLoop]: 1023 mSDtfsCounter, 724 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 2684 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 2824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 2684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:23:53,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 1197 Invalid, 2824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 2684 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-08 11:23:53,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113779 states. [2024-11-08 11:23:54,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113779 to 112982. [2024-11-08 11:23:54,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112982 states, 112981 states have (on average 1.081836769014259) internal successors, (122227), 112981 states have internal predecessors, (122227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:23:54,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112982 states to 112982 states and 122227 transitions. [2024-11-08 11:23:54,608 INFO L78 Accepts]: Start accepts. Automaton has 112982 states and 122227 transitions. Word has length 341 [2024-11-08 11:23:54,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:23:54,609 INFO L471 AbstractCegarLoop]: Abstraction has 112982 states and 122227 transitions. [2024-11-08 11:23:54,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 2 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:23:54,609 INFO L276 IsEmpty]: Start isEmpty. Operand 112982 states and 122227 transitions. [2024-11-08 11:23:54,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2024-11-08 11:23:54,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:23:54,613 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:23:54,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 11:23:54,613 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:23:54,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:23:54,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1539895112, now seen corresponding path program 1 times [2024-11-08 11:23:54,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:23:54,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883370458] [2024-11-08 11:23:54,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:23:54,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:23:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:23:55,366 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-08 11:23:55,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:23:55,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883370458] [2024-11-08 11:23:55,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883370458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:23:55,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:23:55,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:23:55,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352973949] [2024-11-08 11:23:55,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:23:55,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:23:55,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:23:55,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:23:55,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:23:55,369 INFO L87 Difference]: Start difference. First operand 112982 states and 122227 transitions. Second operand has 4 states, 4 states have (on average 43.25) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)