./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label15.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_label15.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 9fbc20983083f465b3eede57a226cc56a0e48515578e64c31c2db7f869f449ac --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 11:20:10,638 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 11:20:10,707 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 11:20:10,715 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 11:20:10,716 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 11:20:10,749 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 11:20:10,750 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 11:20:10,750 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 11:20:10,751 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 11:20:10,753 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 11:20:10,754 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 11:20:10,754 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 11:20:10,754 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 11:20:10,755 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 11:20:10,756 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 11:20:10,757 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 11:20:10,757 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 11:20:10,757 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 11:20:10,758 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 11:20:10,758 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 11:20:10,758 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 11:20:10,759 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 11:20:10,761 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 11:20:10,761 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 11:20:10,761 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 11:20:10,762 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 11:20:10,762 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 11:20:10,762 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 11:20:10,762 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 11:20:10,763 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 11:20:10,763 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 11:20:10,763 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 11:20:10,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:20:10,764 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 11:20:10,764 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 11:20:10,764 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 11:20:10,765 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 11:20:10,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 11:20:10,765 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 11:20:10,766 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 11:20:10,766 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 11:20:10,767 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 11:20:10,767 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 -> 9fbc20983083f465b3eede57a226cc56a0e48515578e64c31c2db7f869f449ac [2024-11-08 11:20:11,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 11:20:11,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 11:20:11,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 11:20:11,067 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 11:20:11,067 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 11:20:11,069 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label15.c [2024-11-08 11:20:12,548 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 11:20:13,043 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 11:20:13,045 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label15.c [2024-11-08 11:20:13,077 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc67c27c5/9de9f0e3084346ac80d57edcfcb72889/FLAG3e74f0ce2 [2024-11-08 11:20:13,094 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc67c27c5/9de9f0e3084346ac80d57edcfcb72889 [2024-11-08 11:20:13,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 11:20:13,097 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 11:20:13,100 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 11:20:13,101 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 11:20:13,106 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 11:20:13,106 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:20:13" (1/1) ... [2024-11-08 11:20:13,107 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c39c8a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:13, skipping insertion in model container [2024-11-08 11:20:13,108 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:20:13" (1/1) ... [2024-11-08 11:20:13,273 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 11:20:13,555 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_label15.c[5297,5310] [2024-11-08 11:20:14,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:20:14,455 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 11:20:14,480 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_label15.c[5297,5310] [2024-11-08 11:20:14,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:20:14,988 INFO L204 MainTranslator]: Completed translation [2024-11-08 11:20:14,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:14 WrapperNode [2024-11-08 11:20:14,989 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 11:20:14,990 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 11:20:14,991 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 11:20:14,991 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 11:20:14,997 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:20:14" (1/1) ... [2024-11-08 11:20:15,080 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:20:14" (1/1) ... [2024-11-08 11:20:15,613 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-11-08 11:20:15,614 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 11:20:15,615 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 11:20:15,615 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 11:20:15,615 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 11:20:15,626 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:14" (1/1) ... [2024-11-08 11:20:15,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:14" (1/1) ... [2024-11-08 11:20:15,735 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:14" (1/1) ... [2024-11-08 11:20:16,008 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:20:16,009 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:14" (1/1) ... [2024-11-08 11:20:16,009 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:14" (1/1) ... [2024-11-08 11:20:16,211 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:14" (1/1) ... [2024-11-08 11:20:16,251 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:14" (1/1) ... [2024-11-08 11:20:16,279 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:14" (1/1) ... [2024-11-08 11:20:16,307 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:14" (1/1) ... [2024-11-08 11:20:16,373 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 11:20:16,375 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 11:20:16,375 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 11:20:16,376 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 11:20:16,377 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:14" (1/1) ... [2024-11-08 11:20:16,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:20:16,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:20:16,409 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:20:16,416 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:20:16,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 11:20:16,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 11:20:16,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 11:20:16,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 11:20:16,537 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 11:20:16,539 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 11:20:22,336 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-11-08 11:20:22,336 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 11:20:22,382 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 11:20:22,382 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 11:20:22,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:20:22 BoogieIcfgContainer [2024-11-08 11:20:22,383 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 11:20:22,385 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 11:20:22,386 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 11:20:22,389 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 11:20:22,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:20:13" (1/3) ... [2024-11-08 11:20:22,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@623acafd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:20:22, skipping insertion in model container [2024-11-08 11:20:22,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:14" (2/3) ... [2024-11-08 11:20:22,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@623acafd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:20:22, skipping insertion in model container [2024-11-08 11:20:22,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:20:22" (3/3) ... [2024-11-08 11:20:22,392 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label15.c [2024-11-08 11:20:22,413 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 11:20:22,414 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 11:20:22,511 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 11:20:22,517 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;@1461e280, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 11:20:22,517 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 11:20:22,524 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:20:22,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 11:20:22,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:20:22,531 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:20:22,531 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:20:22,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:20:22,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1318097310, now seen corresponding path program 1 times [2024-11-08 11:20:22,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:20:22,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618206003] [2024-11-08 11:20:22,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:20:22,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:20:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:20:22,923 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:20:22,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:20:22,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618206003] [2024-11-08 11:20:22,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618206003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:20:22,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:20:22,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:20:22,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790234875] [2024-11-08 11:20:22,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:20:22,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:20:22,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:20:22,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:20:22,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:20:22,963 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 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 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:20:27,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:20:27,418 INFO L93 Difference]: Finished difference Result 3160 states and 5843 transitions. [2024-11-08 11:20:27,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:20:27,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2024-11-08 11:20:27,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:20:27,450 INFO L225 Difference]: With dead ends: 3160 [2024-11-08 11:20:27,451 INFO L226 Difference]: Without dead ends: 1983 [2024-11-08 11:20:27,456 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:20:27,459 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 1067 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 3030 mSolverCounterSat, 974 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1067 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 4004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 974 IncrementalHoareTripleChecker+Valid, 3030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:20:27,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1067 Valid, 340 Invalid, 4004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [974 Valid, 3030 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-08 11:20:27,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1983 states. [2024-11-08 11:20:27,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1983 to 1930. [2024-11-08 11:20:27,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1929 states have (on average 1.7973043027475375) internal successors, (3467), 1929 states have internal predecessors, (3467), 0 states have call successors, (0), 0 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:20:27,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 3467 transitions. [2024-11-08 11:20:27,605 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 3467 transitions. Word has length 36 [2024-11-08 11:20:27,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:20:27,605 INFO L471 AbstractCegarLoop]: Abstraction has 1930 states and 3467 transitions. [2024-11-08 11:20:27,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 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:20:27,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 3467 transitions. [2024-11-08 11:20:27,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-08 11:20:27,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:20:27,609 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:20:27,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 11:20:27,610 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:20:27,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:20:27,611 INFO L85 PathProgramCache]: Analyzing trace with hash -853326582, now seen corresponding path program 1 times [2024-11-08 11:20:27,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:20:27,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962865251] [2024-11-08 11:20:27,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:20:27,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:20:27,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:20:27,910 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:20:27,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:20:27,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962865251] [2024-11-08 11:20:27,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962865251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:20:27,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:20:27,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:20:27,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702509799] [2024-11-08 11:20:27,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:20:27,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:20:27,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:20:27,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:20:27,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:20:27,915 INFO L87 Difference]: Start difference. First operand 1930 states and 3467 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 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:20:35,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 11:20:35,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:20:35,917 INFO L93 Difference]: Finished difference Result 5456 states and 9917 transitions. [2024-11-08 11:20:35,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:20:35,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2024-11-08 11:20:35,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:20:35,931 INFO L225 Difference]: With dead ends: 5456 [2024-11-08 11:20:35,931 INFO L226 Difference]: Without dead ends: 3528 [2024-11-08 11:20:35,933 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:20:35,935 INFO L432 NwaCegarLoop]: 856 mSDtfsCounter, 923 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 2308 mSolverCounterSat, 878 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 3187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 878 IncrementalHoareTripleChecker+Valid, 2308 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:20:35,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 1008 Invalid, 3187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [878 Valid, 2308 Invalid, 1 Unknown, 0 Unchecked, 7.8s Time] [2024-11-08 11:20:35,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3528 states. [2024-11-08 11:20:35,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3528 to 3526. [2024-11-08 11:20:35,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3526 states, 3525 states have (on average 1.5670921985815602) internal successors, (5524), 3525 states have internal predecessors, (5524), 0 states have call successors, (0), 0 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:20:35,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3526 states to 3526 states and 5524 transitions. [2024-11-08 11:20:35,997 INFO L78 Accepts]: Start accepts. Automaton has 3526 states and 5524 transitions. Word has length 101 [2024-11-08 11:20:35,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:20:35,997 INFO L471 AbstractCegarLoop]: Abstraction has 3526 states and 5524 transitions. [2024-11-08 11:20:35,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 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:20:35,998 INFO L276 IsEmpty]: Start isEmpty. Operand 3526 states and 5524 transitions. [2024-11-08 11:20:36,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 11:20:36,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:20:36,001 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:20:36,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 11:20:36,001 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:20:36,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:20:36,002 INFO L85 PathProgramCache]: Analyzing trace with hash -97090789, now seen corresponding path program 1 times [2024-11-08 11:20:36,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:20:36,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254615051] [2024-11-08 11:20:36,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:20:36,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:20:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:20:36,137 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:20:36,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:20:36,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254615051] [2024-11-08 11:20:36,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254615051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:20:36,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:20:36,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:20:36,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887399758] [2024-11-08 11:20:36,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:20:36,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:20:36,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:20:36,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:20:36,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:20:36,140 INFO L87 Difference]: Start difference. First operand 3526 states and 5524 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 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:20:39,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:20:39,385 INFO L93 Difference]: Finished difference Result 10232 states and 16097 transitions. [2024-11-08 11:20:39,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:20:39,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2024-11-08 11:20:39,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:20:39,413 INFO L225 Difference]: With dead ends: 10232 [2024-11-08 11:20:39,414 INFO L226 Difference]: Without dead ends: 6708 [2024-11-08 11:20:39,421 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:20:39,422 INFO L432 NwaCegarLoop]: 717 mSDtfsCounter, 972 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2534 mSolverCounterSat, 775 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 3309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 775 IncrementalHoareTripleChecker+Valid, 2534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:20:39,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [972 Valid, 850 Invalid, 3309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [775 Valid, 2534 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-08 11:20:39,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6708 states. [2024-11-08 11:20:39,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6708 to 6700. [2024-11-08 11:20:39,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6700 states, 6699 states have (on average 1.413046723391551) internal successors, (9466), 6699 states have internal predecessors, (9466), 0 states have call successors, (0), 0 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:20:39,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6700 states to 6700 states and 9466 transitions. [2024-11-08 11:20:39,632 INFO L78 Accepts]: Start accepts. Automaton has 6700 states and 9466 transitions. Word has length 107 [2024-11-08 11:20:39,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:20:39,633 INFO L471 AbstractCegarLoop]: Abstraction has 6700 states and 9466 transitions. [2024-11-08 11:20:39,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 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:20:39,633 INFO L276 IsEmpty]: Start isEmpty. Operand 6700 states and 9466 transitions. [2024-11-08 11:20:39,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 11:20:39,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:20:39,637 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:39,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 11:20:39,638 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:20:39,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:20:39,639 INFO L85 PathProgramCache]: Analyzing trace with hash -456177296, now seen corresponding path program 1 times [2024-11-08 11:20:39,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:20:39,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746194936] [2024-11-08 11:20:39,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:20:39,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:20:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:20:39,861 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:20:39,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:20:39,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746194936] [2024-11-08 11:20:39,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746194936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:20:39,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:20:39,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:20:39,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630544168] [2024-11-08 11:20:39,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:20:39,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:20:39,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:20:39,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:20:39,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:20:39,863 INFO L87 Difference]: Start difference. First operand 6700 states and 9466 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 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:20:43,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:20:43,220 INFO L93 Difference]: Finished difference Result 17443 states and 24479 transitions. [2024-11-08 11:20:43,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:20:43,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2024-11-08 11:20:43,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:20:43,249 INFO L225 Difference]: With dead ends: 17443 [2024-11-08 11:20:43,250 INFO L226 Difference]: Without dead ends: 10745 [2024-11-08 11:20:43,259 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:20:43,261 INFO L432 NwaCegarLoop]: 834 mSDtfsCounter, 844 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 3291 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 3741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 3291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:20:43,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 965 Invalid, 3741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 3291 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-08 11:20:43,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10745 states. [2024-11-08 11:20:43,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10745 to 10669. [2024-11-08 11:20:43,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10669 states, 10668 states have (on average 1.3562992125984252) internal successors, (14469), 10668 states have internal predecessors, (14469), 0 states have call successors, (0), 0 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:20:43,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10669 states to 10669 states and 14469 transitions. [2024-11-08 11:20:43,454 INFO L78 Accepts]: Start accepts. Automaton has 10669 states and 14469 transitions. Word has length 137 [2024-11-08 11:20:43,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:20:43,456 INFO L471 AbstractCegarLoop]: Abstraction has 10669 states and 14469 transitions. [2024-11-08 11:20:43,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 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:20:43,456 INFO L276 IsEmpty]: Start isEmpty. Operand 10669 states and 14469 transitions. [2024-11-08 11:20:43,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-08 11:20:43,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:20:43,459 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:43,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 11:20:43,460 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:20:43,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:20:43,460 INFO L85 PathProgramCache]: Analyzing trace with hash -2032460361, now seen corresponding path program 1 times [2024-11-08 11:20:43,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:20:43,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131704933] [2024-11-08 11:20:43,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:20:43,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:20:43,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:20:43,942 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:20:43,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:20:43,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131704933] [2024-11-08 11:20:43,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131704933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:20:43,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:20:43,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:20:43,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21255639] [2024-11-08 11:20:43,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:20:43,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:20:43,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:20:43,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:20:43,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:20:43,948 INFO L87 Difference]: Start difference. First operand 10669 states and 14469 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 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:20:46,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:20:46,448 INFO L93 Difference]: Finished difference Result 20549 states and 28119 transitions. [2024-11-08 11:20:46,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:20:46,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 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 147 [2024-11-08 11:20:46,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:20:46,482 INFO L225 Difference]: With dead ends: 20549 [2024-11-08 11:20:46,483 INFO L226 Difference]: Without dead ends: 10669 [2024-11-08 11:20:46,493 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:20:46,494 INFO L432 NwaCegarLoop]: 1083 mSDtfsCounter, 678 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2520 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 2544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:20:46,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1212 Invalid, 2544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2520 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-08 11:20:46,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10669 states. [2024-11-08 11:20:46,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10669 to 10669. [2024-11-08 11:20:46,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10669 states, 10668 states have (on average 1.3539557555305586) internal successors, (14444), 10668 states have internal predecessors, (14444), 0 states have call successors, (0), 0 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:20:46,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10669 states to 10669 states and 14444 transitions. [2024-11-08 11:20:46,645 INFO L78 Accepts]: Start accepts. Automaton has 10669 states and 14444 transitions. Word has length 147 [2024-11-08 11:20:46,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:20:46,645 INFO L471 AbstractCegarLoop]: Abstraction has 10669 states and 14444 transitions. [2024-11-08 11:20:46,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 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:20:46,646 INFO L276 IsEmpty]: Start isEmpty. Operand 10669 states and 14444 transitions. [2024-11-08 11:20:46,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-08 11:20:46,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:20:46,647 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:46,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 11:20:46,648 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:20:46,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:20:46,649 INFO L85 PathProgramCache]: Analyzing trace with hash 475465869, now seen corresponding path program 1 times [2024-11-08 11:20:46,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:20:46,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866896675] [2024-11-08 11:20:46,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:20:46,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:20:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:20:47,334 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:20:47,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:20:47,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866896675] [2024-11-08 11:20:47,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866896675] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:20:47,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812595179] [2024-11-08 11:20:47,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:20:47,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:20:47,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:20:47,339 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:20:47,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 11:20:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:20:47,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:20:47,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:20:47,692 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-08 11:20:47,692 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:20:47,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812595179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:20:47,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:20:47,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-08 11:20:47,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110845250] [2024-11-08 11:20:47,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:20:47,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:20:47,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:20:47,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:20:47,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:20:47,699 INFO L87 Difference]: Start difference. First operand 10669 states and 14444 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 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:20:51,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:20:51,175 INFO L93 Difference]: Finished difference Result 30031 states and 41217 transitions. [2024-11-08 11:20:51,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:20:51,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 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 161 [2024-11-08 11:20:51,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:20:51,217 INFO L225 Difference]: With dead ends: 30031 [2024-11-08 11:20:51,218 INFO L226 Difference]: Without dead ends: 20151 [2024-11-08 11:20:51,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:20:51,236 INFO L432 NwaCegarLoop]: 1071 mSDtfsCounter, 736 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 2527 mSolverCounterSat, 779 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 3306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 779 IncrementalHoareTripleChecker+Valid, 2527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:20:51,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 1221 Invalid, 3306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [779 Valid, 2527 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-08 11:20:51,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20151 states. [2024-11-08 11:20:51,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20151 to 19337. [2024-11-08 11:20:51,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19337 states, 19336 states have (on average 1.24244931733554) internal successors, (24024), 19336 states have internal predecessors, (24024), 0 states have call successors, (0), 0 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:20:51,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19337 states to 19337 states and 24024 transitions. [2024-11-08 11:20:51,488 INFO L78 Accepts]: Start accepts. Automaton has 19337 states and 24024 transitions. Word has length 161 [2024-11-08 11:20:51,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:20:51,488 INFO L471 AbstractCegarLoop]: Abstraction has 19337 states and 24024 transitions. [2024-11-08 11:20:51,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 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:20:51,489 INFO L276 IsEmpty]: Start isEmpty. Operand 19337 states and 24024 transitions. [2024-11-08 11:20:51,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-08 11:20:51,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:20:51,493 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:20:51,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 11:20:51,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-08 11:20:51,698 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:20:51,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:20:51,698 INFO L85 PathProgramCache]: Analyzing trace with hash 106432199, now seen corresponding path program 1 times [2024-11-08 11:20:51,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:20:51,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373097069] [2024-11-08 11:20:51,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:20:51,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:20:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:20:52,082 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-11-08 11:20:52,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:20:52,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373097069] [2024-11-08 11:20:52,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373097069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:20:52,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:20:52,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:20:52,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299962554] [2024-11-08 11:20:52,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:20:52,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:20:52,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:20:52,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:20:52,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:20:52,085 INFO L87 Difference]: Start difference. First operand 19337 states and 24024 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 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:20:55,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:20:55,447 INFO L93 Difference]: Finished difference Result 44989 states and 55628 transitions. [2024-11-08 11:20:55,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:20:55,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 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 248 [2024-11-08 11:20:55,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:20:55,498 INFO L225 Difference]: With dead ends: 44989 [2024-11-08 11:20:55,498 INFO L226 Difference]: Without dead ends: 26441 [2024-11-08 11:20:55,520 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:20:55,521 INFO L432 NwaCegarLoop]: 1029 mSDtfsCounter, 728 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 2895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:20:55,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1213 Invalid, 2895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 2714 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-08 11:20:55,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26441 states. [2024-11-08 11:20:55,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26441 to 26434. [2024-11-08 11:20:55,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26434 states, 26433 states have (on average 1.200582605076987) internal successors, (31735), 26433 states have internal predecessors, (31735), 0 states have call successors, (0), 0 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:20:55,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26434 states to 26434 states and 31735 transitions. [2024-11-08 11:20:55,851 INFO L78 Accepts]: Start accepts. Automaton has 26434 states and 31735 transitions. Word has length 248 [2024-11-08 11:20:55,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:20:55,852 INFO L471 AbstractCegarLoop]: Abstraction has 26434 states and 31735 transitions. [2024-11-08 11:20:55,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 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:20:55,852 INFO L276 IsEmpty]: Start isEmpty. Operand 26434 states and 31735 transitions. [2024-11-08 11:20:55,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-11-08 11:20:55,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:20:55,856 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:55,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 11:20:55,856 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:20:55,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:20:55,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1619127421, now seen corresponding path program 1 times [2024-11-08 11:20:55,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:20:55,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791467023] [2024-11-08 11:20:55,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:20:55,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:20:55,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:20:56,005 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:20:56,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:20:56,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791467023] [2024-11-08 11:20:56,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791467023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:20:56,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:20:56,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:20:56,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499891427] [2024-11-08 11:20:56,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:20:56,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:20:56,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:20:56,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:20:56,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:20:56,008 INFO L87 Difference]: Start difference. First operand 26434 states and 31735 transitions. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 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:20:59,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:20:59,904 INFO L93 Difference]: Finished difference Result 72535 states and 87971 transitions. [2024-11-08 11:20:59,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:20:59,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 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 250 [2024-11-08 11:20:59,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:20:59,967 INFO L225 Difference]: With dead ends: 72535 [2024-11-08 11:20:59,967 INFO L226 Difference]: Without dead ends: 46103 [2024-11-08 11:20:59,984 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:20:59,985 INFO L432 NwaCegarLoop]: 1848 mSDtfsCounter, 841 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 2479 mSolverCounterSat, 806 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 1984 SdHoareTripleChecker+Invalid, 3285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 806 IncrementalHoareTripleChecker+Valid, 2479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:20:59,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 1984 Invalid, 3285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [806 Valid, 2479 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-08 11:21:00,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46103 states. [2024-11-08 11:21:00,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46103 to 43733. [2024-11-08 11:21:00,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43733 states, 43732 states have (on average 1.1691210097868838) internal successors, (51128), 43732 states have internal predecessors, (51128), 0 states have call successors, (0), 0 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:21:00,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43733 states to 43733 states and 51128 transitions. [2024-11-08 11:21:00,484 INFO L78 Accepts]: Start accepts. Automaton has 43733 states and 51128 transitions. Word has length 250 [2024-11-08 11:21:00,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:21:00,485 INFO L471 AbstractCegarLoop]: Abstraction has 43733 states and 51128 transitions. [2024-11-08 11:21:00,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 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:21:00,486 INFO L276 IsEmpty]: Start isEmpty. Operand 43733 states and 51128 transitions. [2024-11-08 11:21:00,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-08 11:21:00,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:21:00,490 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:21:00,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 11:21:00,490 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:21:00,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:21:00,491 INFO L85 PathProgramCache]: Analyzing trace with hash -2125069961, now seen corresponding path program 1 times [2024-11-08 11:21:00,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:21:00,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666763291] [2024-11-08 11:21:00,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:21:00,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:21:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:21:00,679 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:21:00,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:21:00,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666763291] [2024-11-08 11:21:00,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666763291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:21:00,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:21:00,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:21:00,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638268049] [2024-11-08 11:21:00,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:21:00,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:21:00,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:21:00,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:21:00,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:21:00,685 INFO L87 Difference]: Start difference. First operand 43733 states and 51128 transitions. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 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:21:04,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:21:04,157 INFO L93 Difference]: Finished difference Result 106364 states and 126458 transitions. [2024-11-08 11:21:04,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:21:04,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 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 263 [2024-11-08 11:21:04,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:21:04,232 INFO L225 Difference]: With dead ends: 106364 [2024-11-08 11:21:04,232 INFO L226 Difference]: Without dead ends: 63420 [2024-11-08 11:21:04,273 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:21:04,274 INFO L432 NwaCegarLoop]: 812 mSDtfsCounter, 823 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 2385 mSolverCounterSat, 900 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 823 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 3285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 900 IncrementalHoareTripleChecker+Valid, 2385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:21:04,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [823 Valid, 930 Invalid, 3285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [900 Valid, 2385 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-08 11:21:04,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63420 states. [2024-11-08 11:21:04,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63420 to 61048. [2024-11-08 11:21:05,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61048 states, 61047 states have (on average 1.1609579504316347) internal successors, (70873), 61047 states have internal predecessors, (70873), 0 states have call successors, (0), 0 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:21:05,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61048 states to 61048 states and 70873 transitions. [2024-11-08 11:21:05,068 INFO L78 Accepts]: Start accepts. Automaton has 61048 states and 70873 transitions. Word has length 263 [2024-11-08 11:21:05,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:21:05,068 INFO L471 AbstractCegarLoop]: Abstraction has 61048 states and 70873 transitions. [2024-11-08 11:21:05,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 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:21:05,069 INFO L276 IsEmpty]: Start isEmpty. Operand 61048 states and 70873 transitions. [2024-11-08 11:21:05,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2024-11-08 11:21:05,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:21:05,074 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:21:05,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 11:21:05,075 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:21:05,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:21:05,075 INFO L85 PathProgramCache]: Analyzing trace with hash 405212956, now seen corresponding path program 1 times [2024-11-08 11:21:05,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:21:05,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599416571] [2024-11-08 11:21:05,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:21:05,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:21:05,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:21:05,331 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 11:21:05,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:21:05,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599416571] [2024-11-08 11:21:05,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599416571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:21:05,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:21:05,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:21:05,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630542918] [2024-11-08 11:21:05,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:21:05,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:21:05,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:21:05,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:21:05,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:21:05,335 INFO L87 Difference]: Start difference. First operand 61048 states and 70873 transitions. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 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:21:12,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:21:12,302 INFO L93 Difference]: Finished difference Result 160082 states and 186750 transitions. [2024-11-08 11:21:12,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:21:12,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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:21:12,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:21:12,422 INFO L225 Difference]: With dead ends: 160082 [2024-11-08 11:21:12,422 INFO L226 Difference]: Without dead ends: 99823 [2024-11-08 11:21:12,462 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:21:12,463 INFO L432 NwaCegarLoop]: 860 mSDtfsCounter, 1689 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 7042 mSolverCounterSat, 939 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1689 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 7981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 939 IncrementalHoareTripleChecker+Valid, 7042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:21:12,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1689 Valid, 1113 Invalid, 7981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [939 Valid, 7042 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-11-08 11:21:12,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99823 states. [2024-11-08 11:21:13,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99823 to 76803. [2024-11-08 11:21:13,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76803 states, 76802 states have (on average 1.1463763964480091) internal successors, (88044), 76802 states have internal predecessors, (88044), 0 states have call successors, (0), 0 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:21:13,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76803 states to 76803 states and 88044 transitions. [2024-11-08 11:21:13,564 INFO L78 Accepts]: Start accepts. Automaton has 76803 states and 88044 transitions. Word has length 324 [2024-11-08 11:21:13,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:21:13,565 INFO L471 AbstractCegarLoop]: Abstraction has 76803 states and 88044 transitions. [2024-11-08 11:21:13,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 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:21:13,566 INFO L276 IsEmpty]: Start isEmpty. Operand 76803 states and 88044 transitions. [2024-11-08 11:21:13,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2024-11-08 11:21:13,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:21:13,573 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:21:13,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 11:21:13,574 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:21:13,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:21:13,574 INFO L85 PathProgramCache]: Analyzing trace with hash -269962597, now seen corresponding path program 1 times [2024-11-08 11:21:13,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:21:13,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973623962] [2024-11-08 11:21:13,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:21:13,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:21:13,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:21:15,144 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 196 proven. 113 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 11:21:15,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:21:15,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973623962] [2024-11-08 11:21:15,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973623962] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:21:15,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154039203] [2024-11-08 11:21:15,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:21:15,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:21:15,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:21:15,148 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:21:15,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 11:21:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:21:15,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:21:15,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:21:15,431 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-08 11:21:15,432 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:21:15,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154039203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:21:15,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:21:15,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-08 11:21:15,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844789745] [2024-11-08 11:21:15,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:21:15,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:21:15,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:21:15,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:21:15,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-08 11:21:15,435 INFO L87 Difference]: Start difference. First operand 76803 states and 88044 transitions. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 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:21:18,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:21:18,460 INFO L93 Difference]: Finished difference Result 152806 states and 175284 transitions. [2024-11-08 11:21:18,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:21:18,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 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 342 [2024-11-08 11:21:18,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:21:18,538 INFO L225 Difference]: With dead ends: 152806 [2024-11-08 11:21:18,538 INFO L226 Difference]: Without dead ends: 76792 [2024-11-08 11:21:18,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-08 11:21:18,566 INFO L432 NwaCegarLoop]: 681 mSDtfsCounter, 1073 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2388 mSolverCounterSat, 532 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 2920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 532 IncrementalHoareTripleChecker+Valid, 2388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:21:18,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 814 Invalid, 2920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [532 Valid, 2388 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-08 11:21:18,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76792 states. [2024-11-08 11:21:19,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76792 to 76789. [2024-11-08 11:21:19,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76789 states, 76788 states have (on average 1.1087149033703183) internal successors, (85136), 76788 states have internal predecessors, (85136), 0 states have call successors, (0), 0 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:21:19,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76789 states to 76789 states and 85136 transitions. [2024-11-08 11:21:19,702 INFO L78 Accepts]: Start accepts. Automaton has 76789 states and 85136 transitions. Word has length 342 [2024-11-08 11:21:19,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:21:19,703 INFO L471 AbstractCegarLoop]: Abstraction has 76789 states and 85136 transitions. [2024-11-08 11:21:19,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 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:21:19,703 INFO L276 IsEmpty]: Start isEmpty. Operand 76789 states and 85136 transitions. [2024-11-08 11:21:19,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2024-11-08 11:21:19,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:21:19,712 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:21:19,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 11:21:19,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-08 11:21:19,917 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:21:19,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:21:19,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1322459551, now seen corresponding path program 1 times [2024-11-08 11:21:19,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:21:19,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441511584] [2024-11-08 11:21:19,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:21:19,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:21:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:21:21,036 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 293 proven. 110 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 11:21:21,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:21:21,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441511584] [2024-11-08 11:21:21,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441511584] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:21:21,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27541318] [2024-11-08 11:21:21,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:21:21,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:21:21,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:21:21,039 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:21:21,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 11:21:21,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:21:21,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:21:21,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:21:21,413 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2024-11-08 11:21:21,413 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:21:21,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27541318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:21:21,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:21:21,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-08 11:21:21,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234297152] [2024-11-08 11:21:21,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:21:21,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:21:21,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:21:21,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:21:21,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:21:21,415 INFO L87 Difference]: Start difference. First operand 76789 states and 85136 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 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:21:24,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:21:24,368 INFO L93 Difference]: Finished difference Result 152787 states and 169477 transitions. [2024-11-08 11:21:24,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:21:24,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 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 391 [2024-11-08 11:21:24,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:21:24,447 INFO L225 Difference]: With dead ends: 152787 [2024-11-08 11:21:24,448 INFO L226 Difference]: Without dead ends: 76787 [2024-11-08 11:21:24,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:21:24,480 INFO L432 NwaCegarLoop]: 1343 mSDtfsCounter, 1084 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 2462 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1084 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 2906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 2462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:21:24,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1084 Valid, 1422 Invalid, 2906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 2462 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-08 11:21:24,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76787 states. [2024-11-08 11:21:25,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76787 to 76786. [2024-11-08 11:21:25,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76786 states, 76785 states have (on average 1.0866184801719085) internal successors, (83436), 76785 states have internal predecessors, (83436), 0 states have call successors, (0), 0 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:21:25,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76786 states to 76786 states and 83436 transitions. [2024-11-08 11:21:25,617 INFO L78 Accepts]: Start accepts. Automaton has 76786 states and 83436 transitions. Word has length 391 [2024-11-08 11:21:25,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:21:25,618 INFO L471 AbstractCegarLoop]: Abstraction has 76786 states and 83436 transitions. [2024-11-08 11:21:25,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 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:21:25,618 INFO L276 IsEmpty]: Start isEmpty. Operand 76786 states and 83436 transitions. [2024-11-08 11:21:25,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2024-11-08 11:21:25,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:21:25,624 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-11-08 11:21:25,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 11:21:25,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:21:25,825 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:21:25,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:21:25,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1571282055, now seen corresponding path program 1 times [2024-11-08 11:21:25,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:21:25,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727825218] [2024-11-08 11:21:25,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:21:25,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:21:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:21:26,062 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2024-11-08 11:21:26,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:21:26,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727825218] [2024-11-08 11:21:26,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727825218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:21:26,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:21:26,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:21:26,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289624652] [2024-11-08 11:21:26,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:21:26,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:21:26,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:21:26,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:21:26,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:21:26,067 INFO L87 Difference]: Start difference. First operand 76786 states and 83436 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)