./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/token_ring.06.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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/systemc/token_ring.06.cil-2.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 4d0fbec14d1477738cb6d25ea9b61fc7005f787f2c8a0ac2c555d7e4fa1dbf47 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 21:08:35,051 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 21:08:35,148 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 21:08:35,153 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 21:08:35,156 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 21:08:35,193 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 21:08:35,195 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 21:08:35,195 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 21:08:35,196 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 21:08:35,197 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 21:08:35,198 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 21:08:35,198 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 21:08:35,199 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 21:08:35,201 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 21:08:35,201 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 21:08:35,201 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 21:08:35,202 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 21:08:35,202 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 21:08:35,202 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 21:08:35,202 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 21:08:35,203 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 21:08:35,203 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 21:08:35,206 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 21:08:35,206 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 21:08:35,206 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 21:08:35,206 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 21:08:35,207 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 21:08:35,207 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 21:08:35,207 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 21:08:35,207 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 21:08:35,208 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 21:08:35,208 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 21:08:35,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:08:35,208 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 21:08:35,208 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 21:08:35,209 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 21:08:35,209 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 21:08:35,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 21:08:35,210 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 21:08:35,210 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 21:08:35,210 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 21:08:35,212 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 21:08:35,212 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 -> 4d0fbec14d1477738cb6d25ea9b61fc7005f787f2c8a0ac2c555d7e4fa1dbf47 [2024-11-11 21:08:35,486 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 21:08:35,518 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 21:08:35,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 21:08:35,523 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 21:08:35,523 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 21:08:35,525 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.06.cil-2.c [2024-11-11 21:08:37,024 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 21:08:37,234 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 21:08:37,235 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.06.cil-2.c [2024-11-11 21:08:37,250 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65b69c614/bf4b97b38eba413199a7118a48758822/FLAG7f74de922 [2024-11-11 21:08:37,267 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65b69c614/bf4b97b38eba413199a7118a48758822 [2024-11-11 21:08:37,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 21:08:37,271 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 21:08:37,272 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 21:08:37,272 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 21:08:37,278 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 21:08:37,279 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:08:37" (1/1) ... [2024-11-11 21:08:37,282 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@719aff43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:08:37, skipping insertion in model container [2024-11-11 21:08:37,283 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:08:37" (1/1) ... [2024-11-11 21:08:37,328 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 21:08:37,521 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/systemc/token_ring.06.cil-2.c[671,684] [2024-11-11 21:08:37,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:08:37,669 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 21:08:37,683 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/systemc/token_ring.06.cil-2.c[671,684] [2024-11-11 21:08:37,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:08:37,764 INFO L204 MainTranslator]: Completed translation [2024-11-11 21:08:37,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:08:37 WrapperNode [2024-11-11 21:08:37,768 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 21:08:37,769 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 21:08:37,769 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 21:08:37,769 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 21:08:37,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:08:37" (1/1) ... [2024-11-11 21:08:37,793 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:08:37" (1/1) ... [2024-11-11 21:08:37,830 INFO L138 Inliner]: procedures = 40, calls = 49, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 519 [2024-11-11 21:08:37,831 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 21:08:37,832 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 21:08:37,832 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 21:08:37,832 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 21:08:37,841 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:08:37" (1/1) ... [2024-11-11 21:08:37,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:08:37" (1/1) ... [2024-11-11 21:08:37,844 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:08:37" (1/1) ... [2024-11-11 21:08:37,861 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-11 21:08:37,862 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:08:37" (1/1) ... [2024-11-11 21:08:37,862 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:08:37" (1/1) ... [2024-11-11 21:08:37,894 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:08:37" (1/1) ... [2024-11-11 21:08:37,909 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:08:37" (1/1) ... [2024-11-11 21:08:37,915 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:08:37" (1/1) ... [2024-11-11 21:08:37,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:08:37" (1/1) ... [2024-11-11 21:08:37,938 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 21:08:37,939 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 21:08:37,939 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 21:08:37,939 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 21:08:37,940 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:08:37" (1/1) ... [2024-11-11 21:08:37,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:08:37,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:08:37,974 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-11 21:08:37,976 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-11 21:08:38,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 21:08:38,016 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-11 21:08:38,016 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-11 21:08:38,016 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-11 21:08:38,016 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-11 21:08:38,016 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-11 21:08:38,017 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-11 21:08:38,017 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-11 21:08:38,017 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-11 21:08:38,017 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-11 21:08:38,017 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-11 21:08:38,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 21:08:38,017 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-11 21:08:38,017 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-11 21:08:38,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 21:08:38,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 21:08:38,135 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 21:08:38,138 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 21:08:38,729 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2024-11-11 21:08:38,730 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 21:08:38,754 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 21:08:38,756 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-11 21:08:38,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:08:38 BoogieIcfgContainer [2024-11-11 21:08:38,756 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 21:08:38,758 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 21:08:38,759 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 21:08:38,762 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 21:08:38,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:08:37" (1/3) ... [2024-11-11 21:08:38,763 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e2695ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:08:38, skipping insertion in model container [2024-11-11 21:08:38,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:08:37" (2/3) ... [2024-11-11 21:08:38,764 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e2695ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:08:38, skipping insertion in model container [2024-11-11 21:08:38,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:08:38" (3/3) ... [2024-11-11 21:08:38,765 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.06.cil-2.c [2024-11-11 21:08:38,784 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 21:08:38,784 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 21:08:38,860 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 21:08:38,867 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;@84c76ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 21:08:38,868 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 21:08:38,875 INFO L276 IsEmpty]: Start isEmpty. Operand has 239 states, 211 states have (on average 1.6113744075829384) internal successors, (340), 213 states have internal predecessors, (340), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-11 21:08:38,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-11 21:08:38,887 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:08:38,888 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:08:38,889 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:08:38,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:08:38,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1989971987, now seen corresponding path program 1 times [2024-11-11 21:08:38,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:08:38,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321221582] [2024-11-11 21:08:38,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:08:38,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:08:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:39,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:08:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:39,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:08:39,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:39,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 21:08:39,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:39,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 21:08:39,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:39,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 21:08:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:39,428 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-11 21:08:39,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:08:39,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321221582] [2024-11-11 21:08:39,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321221582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:08:39,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:08:39,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:08:39,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445824326] [2024-11-11 21:08:39,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:08:39,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:08:39,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:08:39,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:08:39,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:08:39,496 INFO L87 Difference]: Start difference. First operand has 239 states, 211 states have (on average 1.6113744075829384) internal successors, (340), 213 states have internal predecessors, (340), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:08:40,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:08:40,632 INFO L93 Difference]: Finished difference Result 547 states and 882 transitions. [2024-11-11 21:08:40,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:08:40,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-11-11 21:08:40,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:08:40,649 INFO L225 Difference]: With dead ends: 547 [2024-11-11 21:08:40,650 INFO L226 Difference]: Without dead ends: 310 [2024-11-11 21:08:40,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:08:40,662 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 595 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 21:08:40,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 477 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 21:08:40,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-11-11 21:08:40,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 234. [2024-11-11 21:08:40,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 207 states have (on average 1.5217391304347827) internal successors, (315), 208 states have internal predecessors, (315), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-11 21:08:40,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 355 transitions. [2024-11-11 21:08:40,732 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 355 transitions. Word has length 111 [2024-11-11 21:08:40,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:08:40,732 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 355 transitions. [2024-11-11 21:08:40,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:08:40,733 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 355 transitions. [2024-11-11 21:08:40,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-11 21:08:40,735 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:08:40,735 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:08:40,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 21:08:40,736 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:08:40,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:08:40,737 INFO L85 PathProgramCache]: Analyzing trace with hash 915701295, now seen corresponding path program 1 times [2024-11-11 21:08:40,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:08:40,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208444635] [2024-11-11 21:08:40,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:08:40,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:08:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:40,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:08:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:40,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:08:40,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:41,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 21:08:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:41,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 21:08:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:41,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 21:08:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:41,105 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-11 21:08:41,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:08:41,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208444635] [2024-11-11 21:08:41,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208444635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:08:41,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:08:41,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:08:41,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425527613] [2024-11-11 21:08:41,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:08:41,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:08:41,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:08:41,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:08:41,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:08:41,110 INFO L87 Difference]: Start difference. First operand 234 states and 355 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:08:42,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:08:42,782 INFO L93 Difference]: Finished difference Result 832 states and 1296 transitions. [2024-11-11 21:08:42,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 21:08:42,782 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-11-11 21:08:42,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:08:42,787 INFO L225 Difference]: With dead ends: 832 [2024-11-11 21:08:42,787 INFO L226 Difference]: Without dead ends: 612 [2024-11-11 21:08:42,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-11 21:08:42,789 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 878 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:08:42,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 794 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 21:08:42,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-11-11 21:08:42,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 461. [2024-11-11 21:08:42,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 412 states have (on average 1.5339805825242718) internal successors, (632), 414 states have internal predecessors, (632), 35 states have call successors, (35), 12 states have call predecessors, (35), 13 states have return successors, (38), 35 states have call predecessors, (38), 35 states have call successors, (38) [2024-11-11 21:08:42,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 705 transitions. [2024-11-11 21:08:42,856 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 705 transitions. Word has length 111 [2024-11-11 21:08:42,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:08:42,857 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 705 transitions. [2024-11-11 21:08:42,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:08:42,858 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 705 transitions. [2024-11-11 21:08:42,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-11 21:08:42,860 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:08:42,860 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:08:42,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 21:08:42,864 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:08:42,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:08:42,864 INFO L85 PathProgramCache]: Analyzing trace with hash -2100267341, now seen corresponding path program 1 times [2024-11-11 21:08:42,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:08:42,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115414755] [2024-11-11 21:08:42,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:08:42,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:08:42,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:43,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:08:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:43,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:08:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:43,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 21:08:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:43,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 21:08:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:43,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 21:08:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:43,148 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-11 21:08:43,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:08:43,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115414755] [2024-11-11 21:08:43,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115414755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:08:43,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:08:43,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:08:43,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582382820] [2024-11-11 21:08:43,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:08:43,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:08:43,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:08:43,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:08:43,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:08:43,154 INFO L87 Difference]: Start difference. First operand 461 states and 705 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:08:45,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:08:45,264 INFO L93 Difference]: Finished difference Result 1369 states and 2130 transitions. [2024-11-11 21:08:45,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 21:08:45,265 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-11-11 21:08:45,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:08:45,275 INFO L225 Difference]: With dead ends: 1369 [2024-11-11 21:08:45,275 INFO L226 Difference]: Without dead ends: 922 [2024-11-11 21:08:45,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 21:08:45,281 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 889 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 2005 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 902 SdHoareTripleChecker+Valid, 1516 SdHoareTripleChecker+Invalid, 2054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-11 21:08:45,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [902 Valid, 1516 Invalid, 2054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2005 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-11 21:08:45,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-11-11 21:08:45,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 673. [2024-11-11 21:08:45,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 602 states have (on average 1.526578073089701) internal successors, (919), 605 states have internal predecessors, (919), 50 states have call successors, (50), 18 states have call predecessors, (50), 20 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2024-11-11 21:08:45,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1024 transitions. [2024-11-11 21:08:45,348 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 1024 transitions. Word has length 111 [2024-11-11 21:08:45,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:08:45,349 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 1024 transitions. [2024-11-11 21:08:45,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:08:45,349 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 1024 transitions. [2024-11-11 21:08:45,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-11 21:08:45,354 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:08:45,354 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:08:45,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 21:08:45,355 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:08:45,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:08:45,355 INFO L85 PathProgramCache]: Analyzing trace with hash 575725041, now seen corresponding path program 1 times [2024-11-11 21:08:45,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:08:45,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202660487] [2024-11-11 21:08:45,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:08:45,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:08:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:45,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:08:45,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:45,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:08:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:45,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 21:08:45,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:45,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 21:08:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:45,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 21:08:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:45,572 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-11 21:08:45,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:08:45,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202660487] [2024-11-11 21:08:45,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202660487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:08:45,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:08:45,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:08:45,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261723686] [2024-11-11 21:08:45,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:08:45,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:08:45,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:08:45,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:08:45,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:08:45,576 INFO L87 Difference]: Start difference. First operand 673 states and 1024 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:08:47,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:08:47,516 INFO L93 Difference]: Finished difference Result 2160 states and 3351 transitions. [2024-11-11 21:08:47,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 21:08:47,517 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-11-11 21:08:47,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:08:47,528 INFO L225 Difference]: With dead ends: 2160 [2024-11-11 21:08:47,528 INFO L226 Difference]: Without dead ends: 1501 [2024-11-11 21:08:47,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 21:08:47,534 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 959 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 1696 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 1771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:08:47,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [972 Valid, 987 Invalid, 1771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1696 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 21:08:47,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2024-11-11 21:08:47,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1098. [2024-11-11 21:08:47,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1098 states, 983 states have (on average 1.5198372329603256) internal successors, (1494), 988 states have internal predecessors, (1494), 80 states have call successors, (80), 30 states have call predecessors, (80), 34 states have return successors, (93), 83 states have call predecessors, (93), 80 states have call successors, (93) [2024-11-11 21:08:47,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1667 transitions. [2024-11-11 21:08:47,621 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 1667 transitions. Word has length 111 [2024-11-11 21:08:47,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:08:47,622 INFO L471 AbstractCegarLoop]: Abstraction has 1098 states and 1667 transitions. [2024-11-11 21:08:47,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:08:47,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1667 transitions. [2024-11-11 21:08:47,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-11 21:08:47,625 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:08:47,625 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:08:47,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 21:08:47,625 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:08:47,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:08:47,626 INFO L85 PathProgramCache]: Analyzing trace with hash -307783949, now seen corresponding path program 1 times [2024-11-11 21:08:47,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:08:47,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261515562] [2024-11-11 21:08:47,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:08:47,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:08:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:47,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:08:47,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:47,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:08:47,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:47,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 21:08:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:47,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 21:08:47,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:47,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 21:08:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:47,840 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-11 21:08:47,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:08:47,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261515562] [2024-11-11 21:08:47,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261515562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:08:47,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:08:47,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:08:47,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297992037] [2024-11-11 21:08:47,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:08:47,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:08:47,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:08:47,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:08:47,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:08:47,846 INFO L87 Difference]: Start difference. First operand 1098 states and 1667 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:08:49,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:08:49,923 INFO L93 Difference]: Finished difference Result 3682 states and 5690 transitions. [2024-11-11 21:08:49,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 21:08:49,924 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-11-11 21:08:49,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:08:49,938 INFO L225 Difference]: With dead ends: 3682 [2024-11-11 21:08:49,938 INFO L226 Difference]: Without dead ends: 2598 [2024-11-11 21:08:49,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 21:08:49,947 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 887 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 1975 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 2026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-11 21:08:49,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [900 Valid, 1514 Invalid, 2026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1975 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-11 21:08:49,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2598 states. [2024-11-11 21:08:50,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2598 to 1954. [2024-11-11 21:08:50,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1954 states, 1751 states have (on average 1.515705311250714) internal successors, (2654), 1760 states have internal predecessors, (2654), 140 states have call successors, (140), 54 states have call predecessors, (140), 62 states have return successors, (175), 147 states have call predecessors, (175), 140 states have call successors, (175) [2024-11-11 21:08:50,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2969 transitions. [2024-11-11 21:08:50,111 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2969 transitions. Word has length 111 [2024-11-11 21:08:50,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:08:50,112 INFO L471 AbstractCegarLoop]: Abstraction has 1954 states and 2969 transitions. [2024-11-11 21:08:50,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:08:50,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2969 transitions. [2024-11-11 21:08:50,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-11 21:08:50,115 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:08:50,115 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:08:50,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 21:08:50,116 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:08:50,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:08:50,116 INFO L85 PathProgramCache]: Analyzing trace with hash 2046601333, now seen corresponding path program 1 times [2024-11-11 21:08:50,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:08:50,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070292845] [2024-11-11 21:08:50,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:08:50,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:08:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:50,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:08:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:50,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:08:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:50,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 21:08:50,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:50,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 21:08:50,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:50,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 21:08:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:50,312 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-11 21:08:50,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:08:50,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070292845] [2024-11-11 21:08:50,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070292845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:08:50,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:08:50,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:08:50,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740395072] [2024-11-11 21:08:50,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:08:50,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:08:50,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:08:50,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:08:50,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:08:50,315 INFO L87 Difference]: Start difference. First operand 1954 states and 2969 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:08:52,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:08:52,400 INFO L93 Difference]: Finished difference Result 6736 states and 10402 transitions. [2024-11-11 21:08:52,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 21:08:52,400 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-11-11 21:08:52,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:08:52,425 INFO L225 Difference]: With dead ends: 6736 [2024-11-11 21:08:52,426 INFO L226 Difference]: Without dead ends: 4796 [2024-11-11 21:08:52,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 21:08:52,434 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 886 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 1962 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 2013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:08:52,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 1514 Invalid, 2013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1962 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-11 21:08:52,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4796 states. [2024-11-11 21:08:52,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4796 to 3671. [2024-11-11 21:08:52,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3671 states, 3292 states have (on average 1.5127582017010937) internal successors, (4980), 3309 states have internal predecessors, (4980), 260 states have call successors, (260), 102 states have call predecessors, (260), 118 states have return successors, (357), 275 states have call predecessors, (357), 260 states have call successors, (357) [2024-11-11 21:08:52,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3671 states to 3671 states and 5597 transitions. [2024-11-11 21:08:52,702 INFO L78 Accepts]: Start accepts. Automaton has 3671 states and 5597 transitions. Word has length 111 [2024-11-11 21:08:52,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:08:52,703 INFO L471 AbstractCegarLoop]: Abstraction has 3671 states and 5597 transitions. [2024-11-11 21:08:52,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:08:52,703 INFO L276 IsEmpty]: Start isEmpty. Operand 3671 states and 5597 transitions. [2024-11-11 21:08:52,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-11 21:08:52,707 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:08:52,707 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:08:52,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 21:08:52,707 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:08:52,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:08:52,708 INFO L85 PathProgramCache]: Analyzing trace with hash -371302733, now seen corresponding path program 1 times [2024-11-11 21:08:52,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:08:52,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613052115] [2024-11-11 21:08:52,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:08:52,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:08:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:52,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:08:52,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:52,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:08:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:52,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 21:08:52,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:52,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 21:08:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:52,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 21:08:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:52,894 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-11 21:08:52,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:08:52,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613052115] [2024-11-11 21:08:52,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613052115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:08:52,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:08:52,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:08:52,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329199796] [2024-11-11 21:08:52,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:08:52,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:08:52,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:08:52,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:08:52,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:08:52,897 INFO L87 Difference]: Start difference. First operand 3671 states and 5597 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:08:54,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:08:54,859 INFO L93 Difference]: Finished difference Result 12843 states and 19884 transitions. [2024-11-11 21:08:54,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 21:08:54,860 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-11-11 21:08:54,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:08:54,909 INFO L225 Difference]: With dead ends: 12843 [2024-11-11 21:08:54,909 INFO L226 Difference]: Without dead ends: 9186 [2024-11-11 21:08:54,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 21:08:54,927 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 885 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 1949 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 2000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:08:54,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 1514 Invalid, 2000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1949 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 21:08:54,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9186 states. [2024-11-11 21:08:55,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9186 to 7120. [2024-11-11 21:08:55,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7120 states, 6389 states have (on average 1.5110345907027705) internal successors, (9654), 6422 states have internal predecessors, (9654), 500 states have call successors, (500), 198 states have call predecessors, (500), 230 states have return successors, (775), 531 states have call predecessors, (775), 500 states have call successors, (775) [2024-11-11 21:08:55,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7120 states to 7120 states and 10929 transitions. [2024-11-11 21:08:55,395 INFO L78 Accepts]: Start accepts. Automaton has 7120 states and 10929 transitions. Word has length 111 [2024-11-11 21:08:55,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:08:55,397 INFO L471 AbstractCegarLoop]: Abstraction has 7120 states and 10929 transitions. [2024-11-11 21:08:55,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:08:55,397 INFO L276 IsEmpty]: Start isEmpty. Operand 7120 states and 10929 transitions. [2024-11-11 21:08:55,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-11 21:08:55,410 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:08:55,410 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:08:55,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 21:08:55,410 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:08:55,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:08:55,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1142036299, now seen corresponding path program 1 times [2024-11-11 21:08:55,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:08:55,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360474101] [2024-11-11 21:08:55,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:08:55,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:08:55,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:55,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:08:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:55,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:08:55,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:55,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 21:08:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:55,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 21:08:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:55,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 21:08:55,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:55,596 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-11 21:08:55,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:08:55,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360474101] [2024-11-11 21:08:55,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360474101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:08:55,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:08:55,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:08:55,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2313235] [2024-11-11 21:08:55,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:08:55,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:08:55,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:08:55,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:08:55,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:08:55,598 INFO L87 Difference]: Start difference. First operand 7120 states and 10929 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:08:58,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:08:58,139 INFO L93 Difference]: Finished difference Result 28034 states and 43524 transitions. [2024-11-11 21:08:58,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 21:08:58,140 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-11-11 21:08:58,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:08:58,254 INFO L225 Difference]: With dead ends: 28034 [2024-11-11 21:08:58,255 INFO L226 Difference]: Without dead ends: 20928 [2024-11-11 21:08:58,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-11 21:08:58,287 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 1136 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 1929 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1156 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 1983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:08:58,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1156 Valid, 1504 Invalid, 1983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1929 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 21:08:58,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20928 states. [2024-11-11 21:08:59,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20928 to 13953. [2024-11-11 21:08:59,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13953 states, 12550 states have (on average 1.5126693227091634) internal successors, (18984), 12615 states have internal predecessors, (18984), 948 states have call successors, (948), 390 states have call predecessors, (948), 454 states have return successors, (1741), 1011 states have call predecessors, (1741), 948 states have call successors, (1741) [2024-11-11 21:08:59,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13953 states to 13953 states and 21673 transitions. [2024-11-11 21:08:59,422 INFO L78 Accepts]: Start accepts. Automaton has 13953 states and 21673 transitions. Word has length 111 [2024-11-11 21:08:59,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:08:59,423 INFO L471 AbstractCegarLoop]: Abstraction has 13953 states and 21673 transitions. [2024-11-11 21:08:59,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:08:59,423 INFO L276 IsEmpty]: Start isEmpty. Operand 13953 states and 21673 transitions. [2024-11-11 21:08:59,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-11 21:08:59,439 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:08:59,440 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:08:59,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 21:08:59,441 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:08:59,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:08:59,441 INFO L85 PathProgramCache]: Analyzing trace with hash -2136729997, now seen corresponding path program 1 times [2024-11-11 21:08:59,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:08:59,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238775984] [2024-11-11 21:08:59,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:08:59,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:08:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:59,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:08:59,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:59,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:08:59,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:59,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 21:08:59,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:59,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 21:08:59,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:59,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 21:08:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:08:59,672 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-11 21:08:59,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:08:59,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238775984] [2024-11-11 21:08:59,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238775984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:08:59,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:08:59,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:08:59,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570359525] [2024-11-11 21:08:59,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:08:59,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:08:59,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:08:59,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:08:59,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:08:59,677 INFO L87 Difference]: Start difference. First operand 13953 states and 21673 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:09:03,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:09:03,236 INFO L93 Difference]: Finished difference Result 54385 states and 85322 transitions. [2024-11-11 21:09:03,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 21:09:03,237 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-11-11 21:09:03,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:09:03,421 INFO L225 Difference]: With dead ends: 54385 [2024-11-11 21:09:03,421 INFO L226 Difference]: Without dead ends: 40446 [2024-11-11 21:09:03,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-11 21:09:03,493 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 935 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 2286 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 947 SdHoareTripleChecker+Valid, 1500 SdHoareTripleChecker+Invalid, 2339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:09:03,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [947 Valid, 1500 Invalid, 2339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2286 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-11 21:09:03,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40446 states. [2024-11-11 21:09:05,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40446 to 27266. [2024-11-11 21:09:05,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27266 states, 24551 states have (on average 1.5136654311433342) internal successors, (37162), 24680 states have internal predecessors, (37162), 1812 states have call successors, (1812), 774 states have call predecessors, (1812), 902 states have return successors, (4127), 1939 states have call predecessors, (4127), 1812 states have call successors, (4127) [2024-11-11 21:09:05,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27266 states to 27266 states and 43101 transitions. [2024-11-11 21:09:05,661 INFO L78 Accepts]: Start accepts. Automaton has 27266 states and 43101 transitions. Word has length 111 [2024-11-11 21:09:05,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:09:05,662 INFO L471 AbstractCegarLoop]: Abstraction has 27266 states and 43101 transitions. [2024-11-11 21:09:05,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:09:05,663 INFO L276 IsEmpty]: Start isEmpty. Operand 27266 states and 43101 transitions. [2024-11-11 21:09:05,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-11 21:09:05,684 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:09:05,684 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:09:05,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 21:09:05,684 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:09:05,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:09:05,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1571961077, now seen corresponding path program 1 times [2024-11-11 21:09:05,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:09:05,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964946501] [2024-11-11 21:09:05,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:09:05,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:09:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:09:05,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:09:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:09:05,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:09:05,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:09:05,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 21:09:05,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:09:05,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 21:09:05,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:09:05,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 21:09:05,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:09:05,846 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-11 21:09:05,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:09:05,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964946501] [2024-11-11 21:09:05,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964946501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:09:05,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:09:05,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:09:05,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897346695] [2024-11-11 21:09:05,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:09:05,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:09:05,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:09:05,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:09:05,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:09:05,849 INFO L87 Difference]: Start difference. First operand 27266 states and 43101 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:09:10,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:09:10,892 INFO L93 Difference]: Finished difference Result 104944 states and 167376 transitions. [2024-11-11 21:09:10,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 21:09:10,893 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-11-11 21:09:10,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:09:11,222 INFO L225 Difference]: With dead ends: 104944 [2024-11-11 21:09:11,222 INFO L226 Difference]: Without dead ends: 77692 [2024-11-11 21:09:11,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-11 21:09:11,312 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 1056 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 1903 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1076 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 1957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:09:11,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1076 Valid, 1504 Invalid, 1957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1903 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 21:09:11,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77692 states. [2024-11-11 21:09:14,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77692 to 54147. [2024-11-11 21:09:14,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54147 states, 48872 states have (on average 1.5160419053854968) internal successors, (74092), 49129 states have internal predecessors, (74092), 3476 states have call successors, (3476), 1542 states have call predecessors, (3476), 1798 states have return successors, (10293), 3731 states have call predecessors, (10293), 3476 states have call successors, (10293) [2024-11-11 21:09:15,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54147 states to 54147 states and 87861 transitions. [2024-11-11 21:09:15,037 INFO L78 Accepts]: Start accepts. Automaton has 54147 states and 87861 transitions. Word has length 111 [2024-11-11 21:09:15,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:09:15,038 INFO L471 AbstractCegarLoop]: Abstraction has 54147 states and 87861 transitions. [2024-11-11 21:09:15,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:09:15,039 INFO L276 IsEmpty]: Start isEmpty. Operand 54147 states and 87861 transitions. [2024-11-11 21:09:15,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-11 21:09:15,079 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:09:15,079 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:09:15,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 21:09:15,079 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:09:15,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:09:15,080 INFO L85 PathProgramCache]: Analyzing trace with hash -386613709, now seen corresponding path program 1 times [2024-11-11 21:09:15,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:09:15,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515779483] [2024-11-11 21:09:15,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:09:15,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:09:15,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:09:15,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:09:15,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:09:15,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:09:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:09:15,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 21:09:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:09:15,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 21:09:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:09:15,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 21:09:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:09:15,231 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-11 21:09:15,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:09:15,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515779483] [2024-11-11 21:09:15,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515779483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:09:15,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:09:15,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:09:15,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541343332] [2024-11-11 21:09:15,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:09:15,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:09:15,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:09:15,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:09:15,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:09:15,233 INFO L87 Difference]: Start difference. First operand 54147 states and 87861 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:09:24,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:09:24,204 INFO L93 Difference]: Finished difference Result 204527 states and 334950 transitions. [2024-11-11 21:09:24,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 21:09:24,205 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-11-11 21:09:24,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:09:25,104 INFO L225 Difference]: With dead ends: 204527 [2024-11-11 21:09:25,105 INFO L226 Difference]: Without dead ends: 150394 [2024-11-11 21:09:25,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-11 21:09:25,266 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 1075 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 1631 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1095 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 1709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:09:25,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1095 Valid, 985 Invalid, 1709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1631 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 21:09:25,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150394 states. [2024-11-11 21:09:31,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150394 to 107780. [2024-11-11 21:09:31,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107780 states, 97513 states have (on average 1.5185462451160359) internal successors, (148078), 98026 states have internal predecessors, (148078), 6676 states have call successors, (6676), 3078 states have call predecessors, (6676), 3590 states have return successors, (26871), 7187 states have call predecessors, (26871), 6676 states have call successors, (26871) [2024-11-11 21:09:32,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107780 states to 107780 states and 181625 transitions. [2024-11-11 21:09:32,470 INFO L78 Accepts]: Start accepts. Automaton has 107780 states and 181625 transitions. Word has length 111 [2024-11-11 21:09:32,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:09:32,470 INFO L471 AbstractCegarLoop]: Abstraction has 107780 states and 181625 transitions. [2024-11-11 21:09:32,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:09:32,471 INFO L276 IsEmpty]: Start isEmpty. Operand 107780 states and 181625 transitions. [2024-11-11 21:09:32,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-11 21:09:32,547 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:09:32,547 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:09:32,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 21:09:32,547 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:09:32,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:09:32,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1489869109, now seen corresponding path program 1 times [2024-11-11 21:09:32,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:09:32,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440818403] [2024-11-11 21:09:32,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:09:32,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:09:32,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:09:32,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:09:32,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:09:32,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:09:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:09:32,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 21:09:32,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:09:32,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 21:09:32,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:09:32,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 21:09:32,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:09:32,709 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-11 21:09:32,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:09:32,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440818403] [2024-11-11 21:09:32,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440818403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:09:32,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:09:32,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:09:32,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218078956] [2024-11-11 21:09:32,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:09:32,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:09:32,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:09:32,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:09:32,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:09:32,712 INFO L87 Difference]: Start difference. First operand 107780 states and 181625 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)