./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.03.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.03.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 2f6e67caa8159a722902bebe9d23adade07462f3fac0eb20b485945b97ba6592 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:51:19,944 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:51:19,983 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:51:19,986 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:51:19,986 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:51:20,000 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:51:20,001 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:51:20,001 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:51:20,002 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:51:20,002 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:51:20,002 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:51:20,003 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:51:20,018 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:51:20,019 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:51:20,019 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:51:20,020 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:51:20,020 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:51:20,020 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:51:20,020 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:51:20,020 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:51:20,021 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:51:20,023 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:51:20,023 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:51:20,024 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:51:20,024 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:51:20,024 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:51:20,024 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:51:20,024 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:51:20,024 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:51:20,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:51:20,025 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:51:20,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:51:20,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:51:20,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:51:20,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:51:20,025 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:51:20,025 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:51:20,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:51:20,026 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:51:20,026 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:51:20,026 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:51:20,026 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:51:20,027 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 -> 2f6e67caa8159a722902bebe9d23adade07462f3fac0eb20b485945b97ba6592 [2024-10-12 20:51:20,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:51:20,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:51:20,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:51:20,238 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:51:20,238 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:51:20,239 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.03.cil-2.c [2024-10-12 20:51:21,453 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:51:21,904 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:51:21,905 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.03.cil-2.c [2024-10-12 20:51:21,932 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/152166f0e/2eaec3a150594dc59a5e8d46505398e3/FLAGed0162154 [2024-10-12 20:51:21,945 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/152166f0e/2eaec3a150594dc59a5e8d46505398e3 [2024-10-12 20:51:21,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:51:21,949 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:51:21,951 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:51:21,951 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:51:21,955 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:51:21,956 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:51:21" (1/1) ... [2024-10-12 20:51:21,956 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62effa17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:51:21, skipping insertion in model container [2024-10-12 20:51:21,956 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:51:21" (1/1) ... [2024-10-12 20:51:22,062 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:51:23,110 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.03.cil-2.c[377069,377082] [2024-10-12 20:51:23,134 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.03.cil-2.c[383339,383352] [2024-10-12 20:51:23,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:51:23,249 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:51:23,807 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.03.cil-2.c[377069,377082] [2024-10-12 20:51:23,818 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.03.cil-2.c[383339,383352] [2024-10-12 20:51:23,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:51:23,880 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:51:23,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:51:23 WrapperNode [2024-10-12 20:51:23,881 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:51:23,882 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:51:23,882 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:51:23,882 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:51:23,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:51:23" (1/1) ... [2024-10-12 20:51:23,946 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:51:23" (1/1) ... [2024-10-12 20:51:24,206 INFO L138 Inliner]: procedures = 50, calls = 50, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 12693 [2024-10-12 20:51:24,207 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:51:24,208 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:51:24,208 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:51:24,208 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:51:24,216 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:51:23" (1/1) ... [2024-10-12 20:51:24,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:51:23" (1/1) ... [2024-10-12 20:51:24,253 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:51:23" (1/1) ... [2024-10-12 20:51:24,304 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 20:51:24,304 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:51:23" (1/1) ... [2024-10-12 20:51:24,305 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:51:23" (1/1) ... [2024-10-12 20:51:24,381 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:51:23" (1/1) ... [2024-10-12 20:51:24,498 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:51:23" (1/1) ... [2024-10-12 20:51:24,514 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:51:23" (1/1) ... [2024-10-12 20:51:24,532 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:51:23" (1/1) ... [2024-10-12 20:51:24,602 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:51:24,604 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:51:24,604 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:51:24,604 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:51:24,605 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:51:23" (1/1) ... [2024-10-12 20:51:24,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:51:24,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:51:24,639 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 20:51:24,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 20:51:24,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:51:24,684 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-12 20:51:24,684 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-12 20:51:24,684 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 20:51:24,685 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 20:51:24,689 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-12 20:51:24,689 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-12 20:51:24,689 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-12 20:51:24,689 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-12 20:51:24,689 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-12 20:51:24,690 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-12 20:51:24,690 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-12 20:51:24,690 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-12 20:51:24,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:51:24,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:51:24,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:51:24,815 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:51:24,834 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:51:30,227 INFO L? ?]: Removed 1701 outVars from TransFormulas that were not future-live. [2024-10-12 20:51:30,227 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:51:30,307 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:51:30,307 INFO L314 CfgBuilder]: Removed 7 assume(true) statements. [2024-10-12 20:51:30,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:51:30 BoogieIcfgContainer [2024-10-12 20:51:30,308 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:51:30,309 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:51:30,309 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:51:30,312 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:51:30,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:51:21" (1/3) ... [2024-10-12 20:51:30,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495a973d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:51:30, skipping insertion in model container [2024-10-12 20:51:30,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:51:23" (2/3) ... [2024-10-12 20:51:30,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495a973d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:51:30, skipping insertion in model container [2024-10-12 20:51:30,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:51:30" (3/3) ... [2024-10-12 20:51:30,313 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label40+token_ring.03.cil-2.c [2024-10-12 20:51:30,325 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:51:30,325 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 20:51:30,411 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:51:30,416 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;@2a4c86d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:51:30,416 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 20:51:30,424 INFO L276 IsEmpty]: Start isEmpty. Operand has 2264 states, 2238 states have (on average 1.8847184986595173) internal successors, (4218), 2241 states have internal predecessors, (4218), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-12 20:51:30,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-12 20:51:30,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:51:30,436 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:51:30,436 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:51:30,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:51:30,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1010118271, now seen corresponding path program 1 times [2024-10-12 20:51:30,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:51:30,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153227951] [2024-10-12 20:51:30,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:51:30,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:51:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:30,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:51:30,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:30,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 20:51:30,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:30,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 20:51:30,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:30,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 20:51:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:30,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 20:51:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:30,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:51:30,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:51:30,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153227951] [2024-10-12 20:51:30,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153227951] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:51:30,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:51:30,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:51:30,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412484614] [2024-10-12 20:51:30,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:51:30,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:51:30,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:51:30,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:51:30,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:51:30,893 INFO L87 Difference]: Start difference. First operand has 2264 states, 2238 states have (on average 1.8847184986595173) internal successors, (4218), 2241 states have internal predecessors, (4218), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 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-10-12 20:51:31,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:51:31,824 INFO L93 Difference]: Finished difference Result 4732 states and 8845 transitions. [2024-10-12 20:51:31,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 20:51:31,827 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 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 71 [2024-10-12 20:51:31,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:51:31,853 INFO L225 Difference]: With dead ends: 4732 [2024-10-12 20:51:31,853 INFO L226 Difference]: Without dead ends: 2471 [2024-10-12 20:51:31,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:51:31,866 INFO L432 NwaCegarLoop]: 4074 mSDtfsCounter, 4459 mSDsluCounter, 12195 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4469 SdHoareTripleChecker+Valid, 16269 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:51:31,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4469 Valid, 16269 Invalid, 864 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [72 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 20:51:31,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states. [2024-10-12 20:51:31,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 2392. [2024-10-12 20:51:31,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2392 states, 2348 states have (on average 1.8373083475298126) internal successors, (4314), 2351 states have internal predecessors, (4314), 29 states have call successors, (29), 12 states have call predecessors, (29), 13 states have return successors, (32), 29 states have call predecessors, (32), 29 states have call successors, (32) [2024-10-12 20:51:31,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2392 states to 2392 states and 4375 transitions. [2024-10-12 20:51:31,991 INFO L78 Accepts]: Start accepts. Automaton has 2392 states and 4375 transitions. Word has length 71 [2024-10-12 20:51:31,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:51:31,991 INFO L471 AbstractCegarLoop]: Abstraction has 2392 states and 4375 transitions. [2024-10-12 20:51:31,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 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-10-12 20:51:31,992 INFO L276 IsEmpty]: Start isEmpty. Operand 2392 states and 4375 transitions. [2024-10-12 20:51:31,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-12 20:51:31,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:51:31,997 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:51:31,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:51:31,998 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:51:31,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:51:31,999 INFO L85 PathProgramCache]: Analyzing trace with hash -308869883, now seen corresponding path program 1 times [2024-10-12 20:51:31,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:51:31,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738851147] [2024-10-12 20:51:31,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:51:31,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:51:32,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:32,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:51:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:32,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 20:51:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:32,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 20:51:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:32,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 20:51:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:32,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 20:51:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:32,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:51:32,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:51:32,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738851147] [2024-10-12 20:51:32,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738851147] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:51:32,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:51:32,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:51:32,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208970675] [2024-10-12 20:51:32,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:51:32,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:51:32,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:51:32,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:51:32,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:51:32,196 INFO L87 Difference]: Start difference. First operand 2392 states and 4375 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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-10-12 20:51:33,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:51:33,322 INFO L93 Difference]: Finished difference Result 2906 states and 5181 transitions. [2024-10-12 20:51:33,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:51:33,324 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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 71 [2024-10-12 20:51:33,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:51:33,333 INFO L225 Difference]: With dead ends: 2906 [2024-10-12 20:51:33,334 INFO L226 Difference]: Without dead ends: 2644 [2024-10-12 20:51:33,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:51:33,337 INFO L432 NwaCegarLoop]: 4151 mSDtfsCounter, 4453 mSDsluCounter, 16419 mSDsCounter, 0 mSdLazyCounter, 1286 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4463 SdHoareTripleChecker+Valid, 20570 SdHoareTripleChecker+Invalid, 1329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:51:33,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4463 Valid, 20570 Invalid, 1329 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [43 Valid, 1286 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 20:51:33,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2644 states. [2024-10-12 20:51:33,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2644 to 2515. [2024-10-12 20:51:33,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2515 states, 2452 states have (on average 1.8242251223491028) internal successors, (4473), 2456 states have internal predecessors, (4473), 41 states have call successors, (41), 18 states have call predecessors, (41), 20 states have return successors, (46), 42 states have call predecessors, (46), 41 states have call successors, (46) [2024-10-12 20:51:33,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2515 states to 2515 states and 4560 transitions. [2024-10-12 20:51:33,416 INFO L78 Accepts]: Start accepts. Automaton has 2515 states and 4560 transitions. Word has length 71 [2024-10-12 20:51:33,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:51:33,417 INFO L471 AbstractCegarLoop]: Abstraction has 2515 states and 4560 transitions. [2024-10-12 20:51:33,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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-10-12 20:51:33,417 INFO L276 IsEmpty]: Start isEmpty. Operand 2515 states and 4560 transitions. [2024-10-12 20:51:33,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-12 20:51:33,419 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:51:33,419 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:51:33,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:51:33,419 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:51:33,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:51:33,420 INFO L85 PathProgramCache]: Analyzing trace with hash 124859203, now seen corresponding path program 1 times [2024-10-12 20:51:33,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:51:33,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872554003] [2024-10-12 20:51:33,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:51:33,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:51:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:33,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:51:33,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:33,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 20:51:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:33,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 20:51:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:33,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 20:51:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:33,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 20:51:33,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:33,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:51:33,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:51:33,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872554003] [2024-10-12 20:51:33,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872554003] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:51:33,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:51:33,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:51:33,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115498885] [2024-10-12 20:51:33,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:51:33,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:51:33,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:51:33,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:51:33,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:51:33,560 INFO L87 Difference]: Start difference. First operand 2515 states and 4560 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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-10-12 20:51:34,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:51:34,630 INFO L93 Difference]: Finished difference Result 3352 states and 5868 transitions. [2024-10-12 20:51:34,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:51:34,631 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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 71 [2024-10-12 20:51:34,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:51:34,642 INFO L225 Difference]: With dead ends: 3352 [2024-10-12 20:51:34,643 INFO L226 Difference]: Without dead ends: 2967 [2024-10-12 20:51:34,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:51:34,645 INFO L432 NwaCegarLoop]: 4149 mSDtfsCounter, 4451 mSDsluCounter, 16419 mSDsCounter, 0 mSdLazyCounter, 1282 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4461 SdHoareTripleChecker+Valid, 20568 SdHoareTripleChecker+Invalid, 1327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:51:34,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4461 Valid, 20568 Invalid, 1327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1282 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 20:51:34,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2967 states. [2024-10-12 20:51:34,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2967 to 2762. [2024-10-12 20:51:34,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2762 states, 2661 states have (on average 1.8008267568583238) internal successors, (4792), 2667 states have internal predecessors, (4792), 65 states have call successors, (65), 30 states have call predecessors, (65), 34 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2024-10-12 20:51:34,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2762 states and 4935 transitions. [2024-10-12 20:51:34,739 INFO L78 Accepts]: Start accepts. Automaton has 2762 states and 4935 transitions. Word has length 71 [2024-10-12 20:51:34,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:51:34,740 INFO L471 AbstractCegarLoop]: Abstraction has 2762 states and 4935 transitions. [2024-10-12 20:51:34,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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-10-12 20:51:34,740 INFO L276 IsEmpty]: Start isEmpty. Operand 2762 states and 4935 transitions. [2024-10-12 20:51:34,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-12 20:51:34,741 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:51:34,741 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:51:34,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:51:34,742 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:51:34,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:51:34,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1385776453, now seen corresponding path program 1 times [2024-10-12 20:51:34,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:51:34,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735495703] [2024-10-12 20:51:34,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:51:34,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:51:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:34,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:51:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:34,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 20:51:34,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:34,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 20:51:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:34,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 20:51:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:34,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 20:51:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:34,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:51:34,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:51:34,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735495703] [2024-10-12 20:51:34,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735495703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:51:34,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:51:34,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:51:34,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803376413] [2024-10-12 20:51:34,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:51:34,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:51:34,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:51:34,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:51:34,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:51:34,904 INFO L87 Difference]: Start difference. First operand 2762 states and 4935 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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-10-12 20:51:35,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:51:35,388 INFO L93 Difference]: Finished difference Result 3589 states and 6236 transitions. [2024-10-12 20:51:35,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:51:35,388 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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 71 [2024-10-12 20:51:35,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:51:35,398 INFO L225 Difference]: With dead ends: 3589 [2024-10-12 20:51:35,399 INFO L226 Difference]: Without dead ends: 2957 [2024-10-12 20:51:35,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:51:35,402 INFO L432 NwaCegarLoop]: 4057 mSDtfsCounter, 4387 mSDsluCounter, 12099 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4398 SdHoareTripleChecker+Valid, 16156 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:51:35,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4398 Valid, 16156 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:51:35,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2024-10-12 20:51:35,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 2762. [2024-10-12 20:51:35,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2762 states, 2661 states have (on average 1.7989477639984968) internal successors, (4787), 2667 states have internal predecessors, (4787), 65 states have call successors, (65), 30 states have call predecessors, (65), 34 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2024-10-12 20:51:35,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2762 states and 4930 transitions. [2024-10-12 20:51:35,511 INFO L78 Accepts]: Start accepts. Automaton has 2762 states and 4930 transitions. Word has length 71 [2024-10-12 20:51:35,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:51:35,511 INFO L471 AbstractCegarLoop]: Abstraction has 2762 states and 4930 transitions. [2024-10-12 20:51:35,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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-10-12 20:51:35,512 INFO L276 IsEmpty]: Start isEmpty. Operand 2762 states and 4930 transitions. [2024-10-12 20:51:35,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-12 20:51:35,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:51:35,513 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:51:35,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:51:35,513 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:51:35,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:51:35,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1426451203, now seen corresponding path program 1 times [2024-10-12 20:51:35,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:51:35,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145962749] [2024-10-12 20:51:35,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:51:35,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:51:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:35,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:51:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:35,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 20:51:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:35,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 20:51:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:35,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 20:51:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:35,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 20:51:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:35,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:51:35,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:51:35,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145962749] [2024-10-12 20:51:35,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145962749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:51:35,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:51:35,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:51:35,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188495213] [2024-10-12 20:51:35,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:51:35,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:51:35,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:51:35,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:51:35,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:51:35,629 INFO L87 Difference]: Start difference. First operand 2762 states and 4930 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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-10-12 20:51:36,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:51:36,619 INFO L93 Difference]: Finished difference Result 4380 states and 7425 transitions. [2024-10-12 20:51:36,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:51:36,619 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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 71 [2024-10-12 20:51:36,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:51:36,629 INFO L225 Difference]: With dead ends: 4380 [2024-10-12 20:51:36,629 INFO L226 Difference]: Without dead ends: 3748 [2024-10-12 20:51:36,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:51:36,631 INFO L432 NwaCegarLoop]: 4147 mSDtfsCounter, 4558 mSDsluCounter, 16414 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4572 SdHoareTripleChecker+Valid, 20561 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:51:36,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4572 Valid, 20561 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 20:51:36,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3748 states. [2024-10-12 20:51:36,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3748 to 3253. [2024-10-12 20:51:36,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3253 states, 3080 states have (on average 1.7603896103896104) internal successors, (5422), 3090 states have internal predecessors, (5422), 109 states have call successors, (109), 54 states have call predecessors, (109), 62 states have return successors, (144), 116 states have call predecessors, (144), 109 states have call successors, (144) [2024-10-12 20:51:36,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3253 states to 3253 states and 5675 transitions. [2024-10-12 20:51:36,710 INFO L78 Accepts]: Start accepts. Automaton has 3253 states and 5675 transitions. Word has length 71 [2024-10-12 20:51:36,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:51:36,710 INFO L471 AbstractCegarLoop]: Abstraction has 3253 states and 5675 transitions. [2024-10-12 20:51:36,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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-10-12 20:51:36,710 INFO L276 IsEmpty]: Start isEmpty. Operand 3253 states and 5675 transitions. [2024-10-12 20:51:36,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-12 20:51:36,712 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:51:36,712 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:51:36,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:51:36,712 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:51:36,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:51:36,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1481730683, now seen corresponding path program 1 times [2024-10-12 20:51:36,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:51:36,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933426419] [2024-10-12 20:51:36,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:51:36,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:51:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:36,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:51:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:36,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 20:51:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:36,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 20:51:36,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:36,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 20:51:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:36,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 20:51:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:36,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:51:36,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:51:36,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933426419] [2024-10-12 20:51:36,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933426419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:51:36,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:51:36,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:51:36,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520566315] [2024-10-12 20:51:36,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:51:36,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:51:36,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:51:36,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:51:36,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:51:36,798 INFO L87 Difference]: Start difference. First operand 3253 states and 5675 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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-10-12 20:51:37,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:51:37,774 INFO L93 Difference]: Finished difference Result 6161 states and 10154 transitions. [2024-10-12 20:51:37,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:51:37,774 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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 71 [2024-10-12 20:51:37,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:51:37,791 INFO L225 Difference]: With dead ends: 6161 [2024-10-12 20:51:37,792 INFO L226 Difference]: Without dead ends: 5038 [2024-10-12 20:51:37,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:51:37,796 INFO L432 NwaCegarLoop]: 4146 mSDtfsCounter, 4460 mSDsluCounter, 16411 mSDsCounter, 0 mSdLazyCounter, 1397 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4469 SdHoareTripleChecker+Valid, 20557 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:51:37,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4469 Valid, 20557 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1397 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 20:51:37,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5038 states. [2024-10-12 20:51:37,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5038 to 4191. [2024-10-12 20:51:37,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4191 states, 3878 states have (on average 1.709128416709644) internal successors, (6628), 3896 states have internal predecessors, (6628), 193 states have call successors, (193), 102 states have call predecessors, (193), 118 states have return successors, (290), 208 states have call predecessors, (290), 193 states have call successors, (290) [2024-10-12 20:51:37,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4191 states to 4191 states and 7111 transitions. [2024-10-12 20:51:37,936 INFO L78 Accepts]: Start accepts. Automaton has 4191 states and 7111 transitions. Word has length 71 [2024-10-12 20:51:37,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:51:37,936 INFO L471 AbstractCegarLoop]: Abstraction has 4191 states and 7111 transitions. [2024-10-12 20:51:37,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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-10-12 20:51:37,937 INFO L276 IsEmpty]: Start isEmpty. Operand 4191 states and 7111 transitions. [2024-10-12 20:51:37,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-12 20:51:37,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:51:37,939 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:51:37,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:51:37,939 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:51:37,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:51:37,940 INFO L85 PathProgramCache]: Analyzing trace with hash -605711677, now seen corresponding path program 1 times [2024-10-12 20:51:37,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:51:37,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713349618] [2024-10-12 20:51:37,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:51:37,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:51:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:37,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:51:37,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:37,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 20:51:38,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:38,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 20:51:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:38,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 20:51:38,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:38,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 20:51:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:38,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:51:38,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:51:38,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713349618] [2024-10-12 20:51:38,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713349618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:51:38,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:51:38,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:51:38,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277350079] [2024-10-12 20:51:38,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:51:38,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:51:38,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:51:38,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:51:38,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:51:38,044 INFO L87 Difference]: Start difference. First operand 4191 states and 7111 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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-10-12 20:51:39,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:51:39,026 INFO L93 Difference]: Finished difference Result 9281 states and 14962 transitions. [2024-10-12 20:51:39,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:51:39,027 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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 71 [2024-10-12 20:51:39,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:51:39,049 INFO L225 Difference]: With dead ends: 9281 [2024-10-12 20:51:39,049 INFO L226 Difference]: Without dead ends: 7220 [2024-10-12 20:51:39,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:51:39,055 INFO L432 NwaCegarLoop]: 4147 mSDtfsCounter, 4448 mSDsluCounter, 16414 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4462 SdHoareTripleChecker+Valid, 20561 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:51:39,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4462 Valid, 20561 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:51:39,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7220 states. [2024-10-12 20:51:39,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7220 to 6122. [2024-10-12 20:51:39,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6122 states, 5537 states have (on average 1.6525194148455842) internal successors, (9150), 5571 states have internal predecessors, (9150), 353 states have call successors, (353), 198 states have call predecessors, (353), 230 states have return successors, (628), 384 states have call predecessors, (628), 353 states have call successors, (628) [2024-10-12 20:51:39,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6122 states to 6122 states and 10131 transitions. [2024-10-12 20:51:39,286 INFO L78 Accepts]: Start accepts. Automaton has 6122 states and 10131 transitions. Word has length 71 [2024-10-12 20:51:39,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:51:39,288 INFO L471 AbstractCegarLoop]: Abstraction has 6122 states and 10131 transitions. [2024-10-12 20:51:39,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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-10-12 20:51:39,289 INFO L276 IsEmpty]: Start isEmpty. Operand 6122 states and 10131 transitions. [2024-10-12 20:51:39,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-12 20:51:39,292 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:51:39,292 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:51:39,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:51:39,292 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:51:39,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:51:39,292 INFO L85 PathProgramCache]: Analyzing trace with hash 932628353, now seen corresponding path program 1 times [2024-10-12 20:51:39,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:51:39,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825575936] [2024-10-12 20:51:39,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:51:39,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:51:39,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:39,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:51:39,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:39,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 20:51:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:39,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 20:51:39,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:39,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 20:51:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:39,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 20:51:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:39,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:51:39,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:51:39,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825575936] [2024-10-12 20:51:39,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825575936] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:51:39,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:51:39,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:51:39,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897289538] [2024-10-12 20:51:39,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:51:39,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:51:39,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:51:39,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:51:39,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:51:39,368 INFO L87 Difference]: Start difference. First operand 6122 states and 10131 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 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-10-12 20:51:40,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:51:40,306 INFO L93 Difference]: Finished difference Result 13461 states and 21515 transitions. [2024-10-12 20:51:40,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 20:51:40,306 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 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 71 [2024-10-12 20:51:40,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:51:40,328 INFO L225 Difference]: With dead ends: 13461 [2024-10-12 20:51:40,329 INFO L226 Difference]: Without dead ends: 9470 [2024-10-12 20:51:40,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:51:40,339 INFO L432 NwaCegarLoop]: 4178 mSDtfsCounter, 4606 mSDsluCounter, 12239 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4633 SdHoareTripleChecker+Valid, 16417 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:51:40,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4633 Valid, 16417 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1028 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:51:40,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9470 states. [2024-10-12 20:51:40,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9470 to 8136. [2024-10-12 20:51:40,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8136 states, 7244 states have (on average 1.6114025400331309) internal successors, (11673), 7311 states have internal predecessors, (11673), 542 states have call successors, (542), 300 states have call predecessors, (542), 348 states have return successors, (899), 556 states have call predecessors, (899), 542 states have call successors, (899) [2024-10-12 20:51:40,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8136 states to 8136 states and 13114 transitions. [2024-10-12 20:51:40,622 INFO L78 Accepts]: Start accepts. Automaton has 8136 states and 13114 transitions. Word has length 71 [2024-10-12 20:51:40,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:51:40,623 INFO L471 AbstractCegarLoop]: Abstraction has 8136 states and 13114 transitions. [2024-10-12 20:51:40,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 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-10-12 20:51:40,623 INFO L276 IsEmpty]: Start isEmpty. Operand 8136 states and 13114 transitions. [2024-10-12 20:51:40,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-12 20:51:40,636 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:51:40,636 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:51:40,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:51:40,637 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:51:40,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:51:40,637 INFO L85 PathProgramCache]: Analyzing trace with hash 919759115, now seen corresponding path program 1 times [2024-10-12 20:51:40,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:51:40,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340723774] [2024-10-12 20:51:40,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:51:40,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:51:40,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:40,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:51:40,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:40,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 20:51:40,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:40,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 20:51:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:40,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 20:51:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:40,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 20:51:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:40,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 20:51:40,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:40,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:51:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:40,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 20:51:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:40,727 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-12 20:51:40,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:51:40,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340723774] [2024-10-12 20:51:40,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340723774] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:51:40,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615751581] [2024-10-12 20:51:40,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:51:40,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:51:40,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:51:40,729 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:51:40,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 20:51:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:40,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 20:51:40,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:51:40,880 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-12 20:51:40,881 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:51:40,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615751581] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:51:40,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:51:40,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-12 20:51:40,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458787104] [2024-10-12 20:51:40,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:51:40,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:51:40,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:51:40,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:51:40,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:51:40,882 INFO L87 Difference]: Start difference. First operand 8136 states and 13114 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 20:51:41,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:51:41,685 INFO L93 Difference]: Finished difference Result 19993 states and 31344 transitions. [2024-10-12 20:51:41,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:51:41,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 115 [2024-10-12 20:51:41,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:51:41,729 INFO L225 Difference]: With dead ends: 19993 [2024-10-12 20:51:41,729 INFO L226 Difference]: Without dead ends: 13988 [2024-10-12 20:51:41,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:51:41,751 INFO L432 NwaCegarLoop]: 4149 mSDtfsCounter, 4122 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4122 SdHoareTripleChecker+Valid, 4322 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:51:41,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4122 Valid, 4322 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:51:41,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13988 states. [2024-10-12 20:51:42,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13988 to 13936. [2024-10-12 20:51:42,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13936 states, 12184 states have (on average 1.5635259356533158) internal successors, (19050), 12316 states have internal predecessors, (19050), 1054 states have call successors, (1054), 600 states have call predecessors, (1054), 696 states have return successors, (1737), 1051 states have call predecessors, (1737), 1054 states have call successors, (1737) [2024-10-12 20:51:42,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13936 states to 13936 states and 21841 transitions. [2024-10-12 20:51:42,465 INFO L78 Accepts]: Start accepts. Automaton has 13936 states and 21841 transitions. Word has length 115 [2024-10-12 20:51:42,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:51:42,466 INFO L471 AbstractCegarLoop]: Abstraction has 13936 states and 21841 transitions. [2024-10-12 20:51:42,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 20:51:42,466 INFO L276 IsEmpty]: Start isEmpty. Operand 13936 states and 21841 transitions. [2024-10-12 20:51:42,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-12 20:51:42,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:51:42,482 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:51:42,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 20:51:42,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:51:42,686 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:51:42,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:51:42,687 INFO L85 PathProgramCache]: Analyzing trace with hash 690437961, now seen corresponding path program 1 times [2024-10-12 20:51:42,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:51:42,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906008858] [2024-10-12 20:51:42,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:51:42,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:51:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:42,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:51:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:42,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 20:51:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:42,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 20:51:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:42,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 20:51:42,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:42,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 20:51:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:42,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 20:51:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:42,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:51:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:42,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 20:51:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:42,792 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-12 20:51:42,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:51:42,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906008858] [2024-10-12 20:51:42,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906008858] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:51:42,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796402661] [2024-10-12 20:51:42,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:51:42,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:51:42,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:51:42,794 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:51:42,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 20:51:42,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:42,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 20:51:42,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:51:42,919 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-12 20:51:42,921 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:51:42,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796402661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:51:42,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:51:42,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-12 20:51:42,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225474850] [2024-10-12 20:51:42,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:51:42,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:51:42,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:51:42,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:51:42,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:51:42,923 INFO L87 Difference]: Start difference. First operand 13936 states and 21841 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 20:51:43,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:51:43,833 INFO L93 Difference]: Finished difference Result 37241 states and 57483 transitions. [2024-10-12 20:51:43,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:51:43,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 115 [2024-10-12 20:51:43,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:51:43,910 INFO L225 Difference]: With dead ends: 37241 [2024-10-12 20:51:43,911 INFO L226 Difference]: Without dead ends: 25436 [2024-10-12 20:51:43,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:51:43,944 INFO L432 NwaCegarLoop]: 4149 mSDtfsCounter, 4127 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4127 SdHoareTripleChecker+Valid, 4322 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:51:43,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4127 Valid, 4322 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:51:43,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25436 states. [2024-10-12 20:51:44,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25436 to 25334. [2024-10-12 20:51:44,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25334 states, 21888 states have (on average 1.5295138888888888) internal successors, (33478), 22150 states have internal predecessors, (33478), 2052 states have call successors, (2052), 1200 states have call predecessors, (2052), 1392 states have return successors, (3387), 2015 states have call predecessors, (3387), 2052 states have call successors, (3387) [2024-10-12 20:51:45,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25334 states to 25334 states and 38917 transitions. [2024-10-12 20:51:45,049 INFO L78 Accepts]: Start accepts. Automaton has 25334 states and 38917 transitions. Word has length 115 [2024-10-12 20:51:45,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:51:45,049 INFO L471 AbstractCegarLoop]: Abstraction has 25334 states and 38917 transitions. [2024-10-12 20:51:45,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 20:51:45,049 INFO L276 IsEmpty]: Start isEmpty. Operand 25334 states and 38917 transitions. [2024-10-12 20:51:45,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-12 20:51:45,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:51:45,078 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:51:45,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 20:51:45,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-12 20:51:45,282 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:51:45,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:51:45,283 INFO L85 PathProgramCache]: Analyzing trace with hash 573874123, now seen corresponding path program 1 times [2024-10-12 20:51:45,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:51:45,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290306049] [2024-10-12 20:51:45,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:51:45,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:51:45,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:45,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:51:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:45,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 20:51:45,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:45,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 20:51:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:45,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 20:51:45,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:45,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 20:51:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:45,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 20:51:45,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:45,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:51:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:45,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 20:51:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:45,365 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-12 20:51:45,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:51:45,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290306049] [2024-10-12 20:51:45,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290306049] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:51:45,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757311930] [2024-10-12 20:51:45,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:51:45,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:51:45,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:51:45,367 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:51:45,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 20:51:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:45,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 20:51:45,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:51:45,467 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-12 20:51:45,468 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:51:45,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757311930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:51:45,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:51:45,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-12 20:51:45,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890468301] [2024-10-12 20:51:45,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:51:45,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:51:45,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:51:45,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:51:45,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:51:45,470 INFO L87 Difference]: Start difference. First operand 25334 states and 38917 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 20:51:47,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:51:47,741 INFO L93 Difference]: Finished difference Result 70731 states and 108607 transitions. [2024-10-12 20:51:47,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:51:47,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 115 [2024-10-12 20:51:47,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:51:47,900 INFO L225 Difference]: With dead ends: 70731 [2024-10-12 20:51:47,900 INFO L226 Difference]: Without dead ends: 47529 [2024-10-12 20:51:47,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:51:47,952 INFO L432 NwaCegarLoop]: 4325 mSDtfsCounter, 182 mSDsluCounter, 4149 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 8474 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:51:47,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 8474 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:51:47,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47529 states. [2024-10-12 20:51:50,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47529 to 47529. [2024-10-12 20:51:50,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47529 states, 40776 states have (on average 1.5053217578968021) internal successors, (61381), 41231 states have internal predecessors, (61381), 3967 states have call successors, (3967), 2400 states have call predecessors, (3967), 2784 states have return successors, (7350), 3961 states have call predecessors, (7350), 3967 states have call successors, (7350) [2024-10-12 20:51:50,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47529 states to 47529 states and 72698 transitions. [2024-10-12 20:51:50,243 INFO L78 Accepts]: Start accepts. Automaton has 47529 states and 72698 transitions. Word has length 115 [2024-10-12 20:51:50,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:51:50,243 INFO L471 AbstractCegarLoop]: Abstraction has 47529 states and 72698 transitions. [2024-10-12 20:51:50,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 20:51:50,243 INFO L276 IsEmpty]: Start isEmpty. Operand 47529 states and 72698 transitions. [2024-10-12 20:51:50,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-12 20:51:50,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:51:50,352 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:51:50,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-12 20:51:50,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:51:50,557 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:51:50,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:51:50,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1434672612, now seen corresponding path program 1 times [2024-10-12 20:51:50,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:51:50,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859965381] [2024-10-12 20:51:50,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:51:50,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:51:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:50,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:51:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:50,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 20:51:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:50,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 20:51:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:50,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 20:51:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:50,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 20:51:50,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:50,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 20:51:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:50,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:51:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:50,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 20:51:50,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:50,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:51:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:50,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-12 20:51:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:50,658 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-12 20:51:50,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:51:50,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859965381] [2024-10-12 20:51:50,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859965381] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:51:50,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307629693] [2024-10-12 20:51:50,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:51:50,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:51:50,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:51:50,661 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:51:50,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 20:51:50,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:51:50,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 20:51:50,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:51:50,865 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-12 20:51:50,865 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:51:50,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307629693] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:51:50,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:51:50,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-12 20:51:50,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083589521] [2024-10-12 20:51:50,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:51:50,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:51:50,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:51:50,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:51:50,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:51:50,867 INFO L87 Difference]: Start difference. First operand 47529 states and 72698 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-12 20:51:55,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:51:55,570 INFO L93 Difference]: Finished difference Result 136273 states and 208325 transitions. [2024-10-12 20:51:55,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:51:55,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 148 [2024-10-12 20:51:55,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:51:55,897 INFO L225 Difference]: With dead ends: 136273 [2024-10-12 20:51:55,898 INFO L226 Difference]: Without dead ends: 90881 [2024-10-12 20:51:56,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:51:56,009 INFO L432 NwaCegarLoop]: 4158 mSDtfsCounter, 4081 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4081 SdHoareTripleChecker+Valid, 4331 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:51:56,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4081 Valid, 4331 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:51:56,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90881 states. [2024-10-12 20:52:00,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90881 to 90479. [2024-10-12 20:52:00,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90479 states, 77674 states have (on average 1.4913484563689265) internal successors, (115839), 78581 states have internal predecessors, (115839), 7381 states have call successors, (7381), 4654 states have call predecessors, (7381), 5422 states have return successors, (13774), 7307 states have call predecessors, (13774), 7381 states have call successors, (13774) [2024-10-12 20:52:01,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90479 states to 90479 states and 136994 transitions. [2024-10-12 20:52:01,303 INFO L78 Accepts]: Start accepts. Automaton has 90479 states and 136994 transitions. Word has length 148 [2024-10-12 20:52:01,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:52:01,303 INFO L471 AbstractCegarLoop]: Abstraction has 90479 states and 136994 transitions. [2024-10-12 20:52:01,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-12 20:52:01,304 INFO L276 IsEmpty]: Start isEmpty. Operand 90479 states and 136994 transitions. [2024-10-12 20:52:01,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-12 20:52:01,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:52:01,495 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:52:01,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 20:52:01,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:52:01,696 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:52:01,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:52:01,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1063188102, now seen corresponding path program 1 times [2024-10-12 20:52:01,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:52:01,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304959616] [2024-10-12 20:52:01,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:52:01,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:52:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:01,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:52:01,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:01,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 20:52:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:01,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 20:52:01,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:01,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 20:52:01,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:01,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 20:52:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:01,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 20:52:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:01,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 20:52:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:01,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:52:01,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:01,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-12 20:52:01,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:01,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:52:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:01,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-12 20:52:01,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:01,809 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-12 20:52:01,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:52:01,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304959616] [2024-10-12 20:52:01,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304959616] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:52:01,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130804672] [2024-10-12 20:52:01,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:52:01,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:52:01,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:52:01,811 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:52:01,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 20:52:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:52:01,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 20:52:01,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:52:01,973 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-12 20:52:01,974 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:52:01,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130804672] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:52:01,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:52:01,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-12 20:52:01,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671587805] [2024-10-12 20:52:01,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:52:01,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:52:01,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:52:01,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:52:01,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:52:01,976 INFO L87 Difference]: Start difference. First operand 90479 states and 136994 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-12 20:52:05,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:52:05,298 INFO L93 Difference]: Finished difference Result 137875 states and 209245 transitions. [2024-10-12 20:52:05,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:52:05,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 165 [2024-10-12 20:52:05,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:52:05,546 INFO L225 Difference]: With dead ends: 137875 [2024-10-12 20:52:05,546 INFO L226 Difference]: Without dead ends: 76999 [2024-10-12 20:52:05,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:52:05,654 INFO L432 NwaCegarLoop]: 4146 mSDtfsCounter, 4101 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4101 SdHoareTripleChecker+Valid, 4182 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:52:05,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4101 Valid, 4182 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:52:05,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76999 states.