./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_label42+token_ring.03.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.03.cil-1.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 9ef62c47abda8be3b48c3c090b2cfd60af093668e4aab452f52a0b386786ccc6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:13:12,218 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:13:12,271 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 04:13:12,276 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:13:12,277 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:13:12,298 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:13:12,300 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:13:12,300 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:13:12,301 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:13:12,301 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:13:12,302 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:13:12,302 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:13:12,303 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:13:12,303 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:13:12,303 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:13:12,306 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:13:12,306 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:13:12,306 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:13:12,306 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:13:12,306 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:13:12,306 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:13:12,307 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:13:12,307 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:13:12,308 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:13:12,308 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:13:12,308 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:13:12,308 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:13:12,308 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:13:12,309 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:13:12,309 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:13:12,309 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:13:12,309 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:13:12,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:13:12,310 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:13:12,310 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:13:12,311 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:13:12,311 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:13:12,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:13:12,311 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:13:12,311 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:13:12,311 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:13:12,312 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:13:12,312 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-clean/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-clean/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 -> 9ef62c47abda8be3b48c3c090b2cfd60af093668e4aab452f52a0b386786ccc6 [2024-10-11 04:13:12,514 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:13:12,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:13:12,534 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:13:12,535 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:13:12,536 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:13:12,536 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.03.cil-1.c [2024-10-11 04:13:13,737 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:13:14,194 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:13:14,195 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.03.cil-1.c [2024-10-11 04:13:14,238 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b1929631a/b8a90368ef484207914d0ff276870c4a/FLAG33c6e2c52 [2024-10-11 04:13:14,287 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b1929631a/b8a90368ef484207914d0ff276870c4a [2024-10-11 04:13:14,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:13:14,291 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:13:14,293 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:13:14,294 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:13:14,297 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:13:14,298 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:13:14" (1/1) ... [2024-10-11 04:13:14,299 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47408687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:14, skipping insertion in model container [2024-10-11 04:13:14,299 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:13:14" (1/1) ... [2024-10-11 04:13:14,435 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:13:15,738 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_label42+token_ring.03.cil-1.c[378560,378573] [2024-10-11 04:13:15,763 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_label42+token_ring.03.cil-1.c[383339,383352] [2024-10-11 04:13:15,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:13:15,903 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:13:16,476 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_label42+token_ring.03.cil-1.c[378560,378573] [2024-10-11 04:13:16,482 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_label42+token_ring.03.cil-1.c[383339,383352] [2024-10-11 04:13:16,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:13:16,540 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:13:16,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:16 WrapperNode [2024-10-11 04:13:16,541 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:13:16,542 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:13:16,542 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:13:16,542 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:13:16,547 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:16" (1/1) ... [2024-10-11 04:13:16,629 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:16" (1/1) ... [2024-10-11 04:13:16,883 INFO L138 Inliner]: procedures = 50, calls = 51, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 12699 [2024-10-11 04:13:16,884 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:13:16,885 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:13:16,885 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:13:16,885 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:13:16,894 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:16" (1/1) ... [2024-10-11 04:13:16,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:16" (1/1) ... [2024-10-11 04:13:17,045 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:16" (1/1) ... [2024-10-11 04:13:17,111 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-11 04:13:17,112 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:16" (1/1) ... [2024-10-11 04:13:17,112 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:16" (1/1) ... [2024-10-11 04:13:17,230 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:16" (1/1) ... [2024-10-11 04:13:17,270 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:16" (1/1) ... [2024-10-11 04:13:17,295 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:16" (1/1) ... [2024-10-11 04:13:17,314 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:16" (1/1) ... [2024-10-11 04:13:17,417 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:13:17,418 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:13:17,419 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:13:17,419 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:13:17,420 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:16" (1/1) ... [2024-10-11 04:13:17,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:13:17,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:13:17,447 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 04:13:17,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 04:13:17,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:13:17,483 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 04:13:17,484 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 04:13:17,484 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 04:13:17,485 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 04:13:17,485 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 04:13:17,485 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 04:13:17,485 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-11 04:13:17,485 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-11 04:13:17,485 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 04:13:17,485 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 04:13:17,485 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 04:13:17,485 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 04:13:17,485 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 04:13:17,485 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 04:13:17,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:13:17,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:13:17,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:13:17,567 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:13:17,568 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:13:23,489 INFO L? ?]: Removed 1705 outVars from TransFormulas that were not future-live. [2024-10-11 04:13:23,490 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:13:23,562 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:13:23,562 INFO L314 CfgBuilder]: Removed 7 assume(true) statements. [2024-10-11 04:13:23,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:13:23 BoogieIcfgContainer [2024-10-11 04:13:23,562 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:13:23,564 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:13:23,565 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:13:23,568 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:13:23,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:13:14" (1/3) ... [2024-10-11 04:13:23,569 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a95ef1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:13:23, skipping insertion in model container [2024-10-11 04:13:23,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:16" (2/3) ... [2024-10-11 04:13:23,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a95ef1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:13:23, skipping insertion in model container [2024-10-11 04:13:23,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:13:23" (3/3) ... [2024-10-11 04:13:23,571 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.03.cil-1.c [2024-10-11 04:13:23,584 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:13:23,584 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:13:23,664 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:13:23,668 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;@41316414, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:13:23,669 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:13:23,680 INFO L276 IsEmpty]: Start isEmpty. Operand has 2272 states, 2243 states have (on average 1.8849754792688365) internal successors, (4228), 2248 states have internal predecessors, (4228), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 04:13:23,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 04:13:23,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:13:23,696 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, 1] [2024-10-11 04:13:23,697 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:13:23,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:13:23,701 INFO L85 PathProgramCache]: Analyzing trace with hash 2102361474, now seen corresponding path program 1 times [2024-10-11 04:13:23,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:13:23,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856264891] [2024-10-11 04:13:23,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:13:23,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:13:23,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:24,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:13:24,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:24,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 04:13:24,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:24,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 04:13:24,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:24,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 04:13:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:24,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 04:13:24,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:24,124 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-11 04:13:24,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:13:24,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856264891] [2024-10-11 04:13:24,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856264891] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:13:24,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:13:24,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:13:24,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788914332] [2024-10-11 04:13:24,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:13:24,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:13:24,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:13:24,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:13:24,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:13:24,161 INFO L87 Difference]: Start difference. First operand has 2272 states, 2243 states have (on average 1.8849754792688365) internal successors, (4228), 2248 states have internal predecessors, (4228), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:13:25,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:13:25,107 INFO L93 Difference]: Finished difference Result 4754 states and 8887 transitions. [2024-10-11 04:13:25,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:13:25,109 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2024-10-11 04:13:25,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:13:25,128 INFO L225 Difference]: With dead ends: 4754 [2024-10-11 04:13:25,128 INFO L226 Difference]: Without dead ends: 2485 [2024-10-11 04:13:25,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:13:25,138 INFO L432 NwaCegarLoop]: 4085 mSDtfsCounter, 4475 mSDsluCounter, 12233 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4485 SdHoareTripleChecker+Valid, 16318 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:13:25,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4485 Valid, 16318 Invalid, 877 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [80 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 04:13:25,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2485 states. [2024-10-11 04:13:25,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2485 to 2404. [2024-10-11 04:13:25,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2404 states, 2358 states have (on average 1.8379983036471585) internal successors, (4334), 2362 states have internal predecessors, (4334), 31 states have call successors, (31), 13 states have call predecessors, (31), 13 states have return successors, (32), 29 states have call predecessors, (32), 29 states have call successors, (32) [2024-10-11 04:13:25,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2404 states to 2404 states and 4397 transitions. [2024-10-11 04:13:25,321 INFO L78 Accepts]: Start accepts. Automaton has 2404 states and 4397 transitions. Word has length 72 [2024-10-11 04:13:25,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:13:25,322 INFO L471 AbstractCegarLoop]: Abstraction has 2404 states and 4397 transitions. [2024-10-11 04:13:25,322 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:13:25,322 INFO L276 IsEmpty]: Start isEmpty. Operand 2404 states and 4397 transitions. [2024-10-11 04:13:25,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 04:13:25,324 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:13:25,325 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, 1] [2024-10-11 04:13:25,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:13:25,325 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:13:25,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:13:25,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1928742274, now seen corresponding path program 1 times [2024-10-11 04:13:25,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:13:25,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949512456] [2024-10-11 04:13:25,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:13:25,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:13:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:25,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:13:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:25,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 04:13:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:25,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 04:13:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:25,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 04:13:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:25,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 04:13:25,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:25,504 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-11 04:13:25,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:13:25,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949512456] [2024-10-11 04:13:25,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949512456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:13:25,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:13:25,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:13:25,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507450296] [2024-10-11 04:13:25,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:13:25,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:13:25,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:13:25,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:13:25,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:13:25,507 INFO L87 Difference]: Start difference. First operand 2404 states and 4397 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:13:26,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:13:26,535 INFO L93 Difference]: Finished difference Result 2937 states and 5237 transitions. [2024-10-11 04:13:26,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:13:26,536 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2024-10-11 04:13:26,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:13:26,545 INFO L225 Difference]: With dead ends: 2937 [2024-10-11 04:13:26,546 INFO L226 Difference]: Without dead ends: 2663 [2024-10-11 04:13:26,548 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-11 04:13:26,548 INFO L432 NwaCegarLoop]: 4173 mSDtfsCounter, 4467 mSDsluCounter, 16502 mSDsCounter, 0 mSdLazyCounter, 1301 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4477 SdHoareTripleChecker+Valid, 20675 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:13:26,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4477 Valid, 20675 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1301 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 04:13:26,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2663 states. [2024-10-11 04:13:26,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2663 to 2532. [2024-10-11 04:13:26,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2532 states, 2467 states have (on average 1.8252938792055127) internal successors, (4503), 2472 states have internal predecessors, (4503), 43 states have call successors, (43), 19 states have call predecessors, (43), 20 states have return successors, (46), 42 states have call predecessors, (46), 41 states have call successors, (46) [2024-10-11 04:13:26,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2532 states to 2532 states and 4592 transitions. [2024-10-11 04:13:26,605 INFO L78 Accepts]: Start accepts. Automaton has 2532 states and 4592 transitions. Word has length 72 [2024-10-11 04:13:26,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:13:26,605 INFO L471 AbstractCegarLoop]: Abstraction has 2532 states and 4592 transitions. [2024-10-11 04:13:26,605 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:13:26,606 INFO L276 IsEmpty]: Start isEmpty. Operand 2532 states and 4592 transitions. [2024-10-11 04:13:26,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 04:13:26,607 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:13:26,608 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, 1] [2024-10-11 04:13:26,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:13:26,608 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:13:26,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:13:26,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1368042496, now seen corresponding path program 1 times [2024-10-11 04:13:26,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:13:26,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458826627] [2024-10-11 04:13:26,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:13:26,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:13:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:26,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:13:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:26,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 04:13:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:26,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 04:13:26,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:26,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 04:13:26,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:26,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 04:13:26,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:26,734 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-11 04:13:26,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:13:26,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458826627] [2024-10-11 04:13:26,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458826627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:13:26,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:13:26,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:13:26,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032473866] [2024-10-11 04:13:26,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:13:26,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:13:26,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:13:26,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:13:26,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:13:26,738 INFO L87 Difference]: Start difference. First operand 2532 states and 4592 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:13:27,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:13:27,735 INFO L93 Difference]: Finished difference Result 3398 states and 5954 transitions. [2024-10-11 04:13:27,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:13:27,735 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2024-10-11 04:13:27,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:13:27,745 INFO L225 Difference]: With dead ends: 3398 [2024-10-11 04:13:27,745 INFO L226 Difference]: Without dead ends: 2996 [2024-10-11 04:13:27,747 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-11 04:13:27,748 INFO L432 NwaCegarLoop]: 4171 mSDtfsCounter, 4465 mSDsluCounter, 16502 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4475 SdHoareTripleChecker+Valid, 20673 SdHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:13:27,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4475 Valid, 20673 Invalid, 1346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 04:13:27,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2996 states. [2024-10-11 04:13:27,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2996 to 2789. [2024-10-11 04:13:27,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2789 states, 2686 states have (on average 1.802680565897245) internal successors, (4842), 2693 states have internal predecessors, (4842), 67 states have call successors, (67), 31 states have call predecessors, (67), 34 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2024-10-11 04:13:27,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 4987 transitions. [2024-10-11 04:13:27,809 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 4987 transitions. Word has length 72 [2024-10-11 04:13:27,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:13:27,809 INFO L471 AbstractCegarLoop]: Abstraction has 2789 states and 4987 transitions. [2024-10-11 04:13:27,809 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:13:27,810 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 4987 transitions. [2024-10-11 04:13:27,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 04:13:27,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:13:27,813 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, 1] [2024-10-11 04:13:27,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:13:27,813 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:13:27,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:13:27,813 INFO L85 PathProgramCache]: Analyzing trace with hash -934313410, now seen corresponding path program 1 times [2024-10-11 04:13:27,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:13:27,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168829895] [2024-10-11 04:13:27,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:13:27,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:13:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:27,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:13:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:27,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 04:13:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:27,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 04:13:27,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:27,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 04:13:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:27,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 04:13:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:27,930 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-11 04:13:27,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:13:27,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168829895] [2024-10-11 04:13:27,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168829895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:13:27,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:13:27,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:13:27,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034053647] [2024-10-11 04:13:27,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:13:27,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:13:27,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:13:27,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:13:27,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:13:27,932 INFO L87 Difference]: Start difference. First operand 2789 states and 4987 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:13:28,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:13:28,482 INFO L93 Difference]: Finished difference Result 3643 states and 6340 transitions. [2024-10-11 04:13:28,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:13:28,482 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2024-10-11 04:13:28,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:13:28,494 INFO L225 Difference]: With dead ends: 3643 [2024-10-11 04:13:28,494 INFO L226 Difference]: Without dead ends: 2984 [2024-10-11 04:13:28,497 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-11 04:13:28,497 INFO L432 NwaCegarLoop]: 4068 mSDtfsCounter, 4402 mSDsluCounter, 12126 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4413 SdHoareTripleChecker+Valid, 16194 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:13:28,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4413 Valid, 16194 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 04:13:28,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states. [2024-10-11 04:13:28,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 2789. [2024-10-11 04:13:28,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2789 states, 2686 states have (on average 1.800819061801936) internal successors, (4837), 2693 states have internal predecessors, (4837), 67 states have call successors, (67), 31 states have call predecessors, (67), 34 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2024-10-11 04:13:28,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 4982 transitions. [2024-10-11 04:13:28,570 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 4982 transitions. Word has length 72 [2024-10-11 04:13:28,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:13:28,571 INFO L471 AbstractCegarLoop]: Abstraction has 2789 states and 4982 transitions. [2024-10-11 04:13:28,571 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:13:28,571 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 4982 transitions. [2024-10-11 04:13:28,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 04:13:28,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:13:28,572 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, 1] [2024-10-11 04:13:28,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:13:28,573 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:13:28,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:13:28,573 INFO L85 PathProgramCache]: Analyzing trace with hash 326603840, now seen corresponding path program 1 times [2024-10-11 04:13:28,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:13:28,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340616930] [2024-10-11 04:13:28,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:13:28,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:13:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:28,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:13:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:28,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 04:13:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:28,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 04:13:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:28,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 04:13:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:28,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 04:13:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:28,680 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-11 04:13:28,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:13:28,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340616930] [2024-10-11 04:13:28,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340616930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:13:28,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:13:28,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:13:28,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121126033] [2024-10-11 04:13:28,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:13:28,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:13:28,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:13:28,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:13:28,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:13:28,686 INFO L87 Difference]: Start difference. First operand 2789 states and 4982 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:13:29,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:13:29,680 INFO L93 Difference]: Finished difference Result 4456 states and 7571 transitions. [2024-10-11 04:13:29,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:13:29,681 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2024-10-11 04:13:29,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:13:29,692 INFO L225 Difference]: With dead ends: 4456 [2024-10-11 04:13:29,693 INFO L226 Difference]: Without dead ends: 3797 [2024-10-11 04:13:29,695 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-11 04:13:29,697 INFO L432 NwaCegarLoop]: 4169 mSDtfsCounter, 4572 mSDsluCounter, 16497 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4586 SdHoareTripleChecker+Valid, 20666 SdHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:13:29,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4586 Valid, 20666 Invalid, 1306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 04:13:29,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3797 states. [2024-10-11 04:13:29,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3797 to 3300. [2024-10-11 04:13:29,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3300 states, 3125 states have (on average 1.76384) internal successors, (5512), 3136 states have internal predecessors, (5512), 111 states have call successors, (111), 55 states have call predecessors, (111), 62 states have return successors, (144), 116 states have call predecessors, (144), 109 states have call successors, (144) [2024-10-11 04:13:29,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3300 states to 3300 states and 5767 transitions. [2024-10-11 04:13:29,796 INFO L78 Accepts]: Start accepts. Automaton has 3300 states and 5767 transitions. Word has length 72 [2024-10-11 04:13:29,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:13:29,796 INFO L471 AbstractCegarLoop]: Abstraction has 3300 states and 5767 transitions. [2024-10-11 04:13:29,796 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:13:29,796 INFO L276 IsEmpty]: Start isEmpty. Operand 3300 states and 5767 transitions. [2024-10-11 04:13:29,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 04:13:29,798 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:13:29,799 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, 1] [2024-10-11 04:13:29,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:13:29,799 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:13:29,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:13:29,799 INFO L85 PathProgramCache]: Analyzing trace with hash 367278590, now seen corresponding path program 1 times [2024-10-11 04:13:29,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:13:29,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136825999] [2024-10-11 04:13:29,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:13:29,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:13:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:29,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:13:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:29,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 04:13:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:29,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 04:13:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:29,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 04:13:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:29,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 04:13:29,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:29,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:13:29,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:13:29,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136825999] [2024-10-11 04:13:29,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136825999] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:13:29,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:13:29,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:13:29,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955987537] [2024-10-11 04:13:29,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:13:29,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:13:29,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:13:29,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:13:29,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:13:29,927 INFO L87 Difference]: Start difference. First operand 3300 states and 5767 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:13:31,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:13:31,100 INFO L93 Difference]: Finished difference Result 6297 states and 10420 transitions. [2024-10-11 04:13:31,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:13:31,101 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2024-10-11 04:13:31,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:13:31,123 INFO L225 Difference]: With dead ends: 6297 [2024-10-11 04:13:31,123 INFO L226 Difference]: Without dead ends: 5127 [2024-10-11 04:13:31,129 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-11 04:13:31,130 INFO L432 NwaCegarLoop]: 4168 mSDtfsCounter, 4474 mSDsluCounter, 16494 mSDsCounter, 0 mSdLazyCounter, 1412 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4483 SdHoareTripleChecker+Valid, 20662 SdHoareTripleChecker+Invalid, 1463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:13:31,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4483 Valid, 20662 Invalid, 1463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1412 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 04:13:31,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5127 states. [2024-10-11 04:13:31,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5127 to 4238. [2024-10-11 04:13:31,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4238 states, 3923 states have (on average 1.712464950293143) internal successors, (6718), 3942 states have internal predecessors, (6718), 195 states have call successors, (195), 103 states have call predecessors, (195), 118 states have return successors, (290), 208 states have call predecessors, (290), 193 states have call successors, (290) [2024-10-11 04:13:31,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4238 states to 4238 states and 7203 transitions. [2024-10-11 04:13:31,325 INFO L78 Accepts]: Start accepts. Automaton has 4238 states and 7203 transitions. Word has length 72 [2024-10-11 04:13:31,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:13:31,326 INFO L471 AbstractCegarLoop]: Abstraction has 4238 states and 7203 transitions. [2024-10-11 04:13:31,326 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:13:31,326 INFO L276 IsEmpty]: Start isEmpty. Operand 4238 states and 7203 transitions. [2024-10-11 04:13:31,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 04:13:31,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:13:31,329 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, 1] [2024-10-11 04:13:31,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:13:31,329 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:13:31,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:13:31,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1754064000, now seen corresponding path program 1 times [2024-10-11 04:13:31,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:13:31,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120008203] [2024-10-11 04:13:31,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:13:31,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:13:31,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:31,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:13:31,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:31,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 04:13:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:31,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 04:13:31,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:31,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 04:13:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:31,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 04:13:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:31,444 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-11 04:13:31,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:13:31,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120008203] [2024-10-11 04:13:31,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120008203] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:13:31,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:13:31,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:13:31,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022209618] [2024-10-11 04:13:31,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:13:31,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:13:31,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:13:31,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:13:31,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:13:31,446 INFO L87 Difference]: Start difference. First operand 4238 states and 7203 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:13:32,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:13:32,631 INFO L93 Difference]: Finished difference Result 9417 states and 15228 transitions. [2024-10-11 04:13:32,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:13:32,632 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2024-10-11 04:13:32,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:13:32,659 INFO L225 Difference]: With dead ends: 9417 [2024-10-11 04:13:32,659 INFO L226 Difference]: Without dead ends: 7309 [2024-10-11 04:13:32,672 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-11 04:13:32,673 INFO L432 NwaCegarLoop]: 4169 mSDtfsCounter, 4462 mSDsluCounter, 16497 mSDsCounter, 0 mSdLazyCounter, 1210 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4476 SdHoareTripleChecker+Valid, 20666 SdHoareTripleChecker+Invalid, 1263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:13:32,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4476 Valid, 20666 Invalid, 1263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1210 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 04:13:32,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7309 states. [2024-10-11 04:13:32,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7309 to 6209. [2024-10-11 04:13:32,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6209 states, 5622 states have (on average 1.6577730345072927) internal successors, (9320), 5657 states have internal predecessors, (9320), 355 states have call successors, (355), 199 states have call predecessors, (355), 230 states have return successors, (628), 384 states have call predecessors, (628), 353 states have call successors, (628) [2024-10-11 04:13:32,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6209 states to 6209 states and 10303 transitions. [2024-10-11 04:13:32,916 INFO L78 Accepts]: Start accepts. Automaton has 6209 states and 10303 transitions. Word has length 72 [2024-10-11 04:13:32,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:13:32,917 INFO L471 AbstractCegarLoop]: Abstraction has 6209 states and 10303 transitions. [2024-10-11 04:13:32,917 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:13:32,917 INFO L276 IsEmpty]: Start isEmpty. Operand 6209 states and 10303 transitions. [2024-10-11 04:13:32,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 04:13:32,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:13:32,921 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, 1] [2024-10-11 04:13:32,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:13:32,921 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:13:32,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:13:32,921 INFO L85 PathProgramCache]: Analyzing trace with hash -2097002622, now seen corresponding path program 1 times [2024-10-11 04:13:32,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:13:32,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140357948] [2024-10-11 04:13:32,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:13:32,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:13:32,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:32,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:13:32,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:32,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 04:13:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:32,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 04:13:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:32,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 04:13:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:32,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 04:13:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:32,988 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-11 04:13:32,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:13:32,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140357948] [2024-10-11 04:13:32,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140357948] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:13:32,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:13:32,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:13:32,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000059992] [2024-10-11 04:13:32,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:13:32,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:13:32,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:13:32,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:13:32,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:13:32,990 INFO L87 Difference]: Start difference. First operand 6209 states and 10303 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:13:33,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:13:33,960 INFO L93 Difference]: Finished difference Result 13635 states and 21859 transitions. [2024-10-11 04:13:33,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:13:33,961 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2024-10-11 04:13:33,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:13:33,988 INFO L225 Difference]: With dead ends: 13635 [2024-10-11 04:13:33,988 INFO L226 Difference]: Without dead ends: 9557 [2024-10-11 04:13:33,999 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-11 04:13:34,001 INFO L432 NwaCegarLoop]: 4189 mSDtfsCounter, 4620 mSDsluCounter, 12266 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4647 SdHoareTripleChecker+Valid, 16455 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:13:34,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4647 Valid, 16455 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 04:13:34,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9557 states. [2024-10-11 04:13:34,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9557 to 8223. [2024-10-11 04:13:34,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8223 states, 7329 states have (on average 1.6159094010096875) internal successors, (11843), 7397 states have internal predecessors, (11843), 544 states have call successors, (544), 301 states have call predecessors, (544), 348 states have return successors, (899), 556 states have call predecessors, (899), 542 states have call successors, (899) [2024-10-11 04:13:34,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8223 states to 8223 states and 13286 transitions. [2024-10-11 04:13:34,318 INFO L78 Accepts]: Start accepts. Automaton has 8223 states and 13286 transitions. Word has length 72 [2024-10-11 04:13:34,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:13:34,318 INFO L471 AbstractCegarLoop]: Abstraction has 8223 states and 13286 transitions. [2024-10-11 04:13:34,319 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:13:34,319 INFO L276 IsEmpty]: Start isEmpty. Operand 8223 states and 13286 transitions. [2024-10-11 04:13:34,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 04:13:34,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:13:34,331 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, 1] [2024-10-11 04:13:34,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:13:34,331 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:13:34,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:13:34,332 INFO L85 PathProgramCache]: Analyzing trace with hash -454887285, now seen corresponding path program 1 times [2024-10-11 04:13:34,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:13:34,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214230479] [2024-10-11 04:13:34,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:13:34,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:13:34,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:34,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:13:34,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:34,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 04:13:34,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:34,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 04:13:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:34,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 04:13:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:34,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 04:13:34,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:34,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:13:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:34,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:13:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:34,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 04:13:34,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:34,461 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-11 04:13:34,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:13:34,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214230479] [2024-10-11 04:13:34,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214230479] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:13:34,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500824625] [2024-10-11 04:13:34,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:13:34,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:13:34,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:13:34,464 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:13:34,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 04:13:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:34,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:13:34,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:13:34,622 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-11 04:13:34,622 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:13:34,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500824625] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:13:34,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:13:34,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 04:13:34,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046471936] [2024-10-11 04:13:34,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:13:34,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:13:34,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:13:34,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:13:34,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:13:34,626 INFO L87 Difference]: Start difference. First operand 8223 states and 13286 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 04:13:35,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:13:35,138 INFO L93 Difference]: Finished difference Result 20254 states and 31860 transitions. [2024-10-11 04:13:35,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:13:35,140 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 116 [2024-10-11 04:13:35,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:13:35,179 INFO L225 Difference]: With dead ends: 20254 [2024-10-11 04:13:35,179 INFO L226 Difference]: Without dead ends: 14162 [2024-10-11 04:13:35,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 131 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-11 04:13:35,197 INFO L432 NwaCegarLoop]: 4161 mSDtfsCounter, 4134 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4134 SdHoareTripleChecker+Valid, 4346 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-11 04:13:35,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4134 Valid, 4346 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:13:35,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14162 states. [2024-10-11 04:13:35,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14162 to 14108. [2024-10-11 04:13:35,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14108 states, 12354 states have (on average 1.5695321353407803) internal successors, (19390), 12487 states have internal predecessors, (19390), 1056 states have call successors, (1056), 601 states have call predecessors, (1056), 696 states have return successors, (1737), 1051 states have call predecessors, (1737), 1054 states have call successors, (1737) [2024-10-11 04:13:35,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14108 states to 14108 states and 22183 transitions. [2024-10-11 04:13:35,750 INFO L78 Accepts]: Start accepts. Automaton has 14108 states and 22183 transitions. Word has length 116 [2024-10-11 04:13:35,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:13:35,750 INFO L471 AbstractCegarLoop]: Abstraction has 14108 states and 22183 transitions. [2024-10-11 04:13:35,751 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 04:13:35,751 INFO L276 IsEmpty]: Start isEmpty. Operand 14108 states and 22183 transitions. [2024-10-11 04:13:35,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 04:13:35,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:13:35,882 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, 1] [2024-10-11 04:13:35,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 04:13:36,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:13:36,083 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:13:36,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:13:36,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1026091533, now seen corresponding path program 1 times [2024-10-11 04:13:36,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:13:36,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770926015] [2024-10-11 04:13:36,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:13:36,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:13:36,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:36,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:13:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:36,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 04:13:36,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:36,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 04:13:36,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:36,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 04:13:36,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:36,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 04:13:36,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:36,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:13:36,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:36,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:13:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:36,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 04:13:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:36,201 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-11 04:13:36,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:13:36,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770926015] [2024-10-11 04:13:36,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770926015] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:13:36,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575857] [2024-10-11 04:13:36,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:13:36,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:13:36,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:13:36,205 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:13:36,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 04:13:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:36,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:13:36,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:13:36,358 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-11 04:13:36,360 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:13:36,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575857] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:13:36,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:13:36,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 04:13:36,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745518700] [2024-10-11 04:13:36,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:13:36,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:13:36,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:13:36,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:13:36,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:13:36,362 INFO L87 Difference]: Start difference. First operand 14108 states and 22183 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 04:13:37,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:13:37,505 INFO L93 Difference]: Finished difference Result 37757 states and 58509 transitions. [2024-10-11 04:13:37,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:13:37,505 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 116 [2024-10-11 04:13:37,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:13:37,569 INFO L225 Difference]: With dead ends: 37757 [2024-10-11 04:13:37,569 INFO L226 Difference]: Without dead ends: 25780 [2024-10-11 04:13:37,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 131 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-11 04:13:37,597 INFO L432 NwaCegarLoop]: 4161 mSDtfsCounter, 4139 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4139 SdHoareTripleChecker+Valid, 4346 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-11 04:13:37,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4139 Valid, 4346 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:13:37,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25780 states. [2024-10-11 04:13:38,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25780 to 25676. [2024-10-11 04:13:38,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25676 states, 22228 states have (on average 1.5367104552816269) internal successors, (34158), 22491 states have internal predecessors, (34158), 2054 states have call successors, (2054), 1201 states have call predecessors, (2054), 1392 states have return successors, (3387), 2015 states have call predecessors, (3387), 2052 states have call successors, (3387) [2024-10-11 04:13:38,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25676 states to 25676 states and 39599 transitions. [2024-10-11 04:13:38,794 INFO L78 Accepts]: Start accepts. Automaton has 25676 states and 39599 transitions. Word has length 116 [2024-10-11 04:13:38,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:13:38,795 INFO L471 AbstractCegarLoop]: Abstraction has 25676 states and 39599 transitions. [2024-10-11 04:13:38,795 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 04:13:38,795 INFO L276 IsEmpty]: Start isEmpty. Operand 25676 states and 39599 transitions. [2024-10-11 04:13:38,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 04:13:38,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:13:38,825 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, 1] [2024-10-11 04:13:38,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 04:13:39,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:13:39,026 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:13:39,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:13:39,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1707579851, now seen corresponding path program 1 times [2024-10-11 04:13:39,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:13:39,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760512508] [2024-10-11 04:13:39,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:13:39,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:13:39,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:39,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:13:39,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:39,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 04:13:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:39,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 04:13:39,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:39,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 04:13:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:39,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 04:13:39,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:39,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:13:39,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:39,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:13:39,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:39,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 04:13:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:39,126 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-11 04:13:39,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:13:39,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760512508] [2024-10-11 04:13:39,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760512508] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:13:39,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902164008] [2024-10-11 04:13:39,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:13:39,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:13:39,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:13:39,129 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:13:39,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 04:13:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:39,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:13:39,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:13:39,224 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-11 04:13:39,224 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:13:39,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902164008] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:13:39,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:13:39,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 04:13:39,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106508562] [2024-10-11 04:13:39,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:13:39,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:13:39,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:13:39,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:13:39,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:13:39,226 INFO L87 Difference]: Start difference. First operand 25676 states and 39599 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 04:13:41,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:13:41,328 INFO L93 Difference]: Finished difference Result 71415 states and 109971 transitions. [2024-10-11 04:13:41,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:13:41,329 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), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 116 [2024-10-11 04:13:41,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:13:41,507 INFO L225 Difference]: With dead ends: 71415 [2024-10-11 04:13:41,507 INFO L226 Difference]: Without dead ends: 47871 [2024-10-11 04:13:41,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 131 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-11 04:13:41,568 INFO L432 NwaCegarLoop]: 4338 mSDtfsCounter, 182 mSDsluCounter, 4162 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 8500 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-11 04:13:41,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 8500 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:13:41,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47871 states. [2024-10-11 04:13:44,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47871 to 47871. [2024-10-11 04:13:44,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47871 states, 41116 states have (on average 1.5094123942017705) internal successors, (62061), 41572 states have internal predecessors, (62061), 3969 states have call successors, (3969), 2401 states have call predecessors, (3969), 2784 states have return successors, (7350), 3961 states have call predecessors, (7350), 3967 states have call successors, (7350) [2024-10-11 04:13:44,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47871 states to 47871 states and 73380 transitions. [2024-10-11 04:13:44,570 INFO L78 Accepts]: Start accepts. Automaton has 47871 states and 73380 transitions. Word has length 116 [2024-10-11 04:13:44,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:13:44,571 INFO L471 AbstractCegarLoop]: Abstraction has 47871 states and 73380 transitions. [2024-10-11 04:13:44,571 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), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 04:13:44,571 INFO L276 IsEmpty]: Start isEmpty. Operand 47871 states and 73380 transitions. [2024-10-11 04:13:44,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-11 04:13:44,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:13:44,692 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, 1] [2024-10-11 04:13:44,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 04:13:44,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:13:44,893 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:13:44,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:13:44,894 INFO L85 PathProgramCache]: Analyzing trace with hash 508947190, now seen corresponding path program 1 times [2024-10-11 04:13:44,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:13:44,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929836272] [2024-10-11 04:13:44,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:13:44,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:13:44,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:44,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:13:44,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:44,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 04:13:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:44,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 04:13:44,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:44,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 04:13:44,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:44,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 04:13:44,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:44,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:13:44,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:44,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:13:45,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:45,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 04:13:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:45,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:13:45,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:45,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 04:13:45,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:45,013 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-11 04:13:45,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:13:45,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929836272] [2024-10-11 04:13:45,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929836272] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:13:45,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016372361] [2024-10-11 04:13:45,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:13:45,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:13:45,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:13:45,016 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:13:45,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 04:13:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:45,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:13:45,109 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:13:45,223 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-11 04:13:45,223 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:13:45,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016372361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:13:45,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:13:45,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 04:13:45,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609599193] [2024-10-11 04:13:45,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:13:45,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:13:45,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:13:45,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:13:45,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:13:45,224 INFO L87 Difference]: Start difference. First operand 47871 states and 73380 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 04:13:49,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:13:49,574 INFO L93 Difference]: Finished difference Result 137299 states and 210371 transitions. [2024-10-11 04:13:49,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:13:49,575 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 149 [2024-10-11 04:13:49,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:13:50,104 INFO L225 Difference]: With dead ends: 137299 [2024-10-11 04:13:50,104 INFO L226 Difference]: Without dead ends: 91565 [2024-10-11 04:13:50,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 168 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-11 04:13:50,209 INFO L432 NwaCegarLoop]: 4164 mSDtfsCounter, 4093 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4093 SdHoareTripleChecker+Valid, 4349 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-11 04:13:50,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4093 Valid, 4349 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:13:50,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91565 states. [2024-10-11 04:13:55,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91565 to 91161. [2024-10-11 04:13:55,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91161 states, 78354 states have (on average 1.4957628200219517) internal successors, (117199), 79262 states have internal predecessors, (117199), 7383 states have call successors, (7383), 4655 states have call predecessors, (7383), 5422 states have return successors, (13774), 7307 states have call predecessors, (13774), 7381 states have call successors, (13774) [2024-10-11 04:13:55,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91161 states to 91161 states and 138356 transitions. [2024-10-11 04:13:55,930 INFO L78 Accepts]: Start accepts. Automaton has 91161 states and 138356 transitions. Word has length 149 [2024-10-11 04:13:55,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:13:55,930 INFO L471 AbstractCegarLoop]: Abstraction has 91161 states and 138356 transitions. [2024-10-11 04:13:55,931 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 04:13:55,931 INFO L276 IsEmpty]: Start isEmpty. Operand 91161 states and 138356 transitions. [2024-10-11 04:13:56,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 04:13:56,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:13:56,199 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:13:56,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 04:13:56,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 04:13:56,400 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:13:56,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:13:56,400 INFO L85 PathProgramCache]: Analyzing trace with hash 2109099657, now seen corresponding path program 1 times [2024-10-11 04:13:56,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:13:56,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506566476] [2024-10-11 04:13:56,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:13:56,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:13:56,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:56,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:13:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:56,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 04:13:56,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:56,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 04:13:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:56,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 04:13:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:56,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 04:13:56,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:56,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 04:13:56,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:56,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 04:13:56,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:56,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:13:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:56,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 04:13:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:56,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:13:56,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:56,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 04:13:56,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:56,499 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-11 04:13:56,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:13:56,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506566476] [2024-10-11 04:13:56,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506566476] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:13:56,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426912596] [2024-10-11 04:13:56,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:13:56,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:13:56,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:13:56,501 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:13:56,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 04:13:56,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:56,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:13:56,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:13:56,668 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 04:13:56,668 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:13:56,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426912596] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:13:56,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:13:56,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 04:13:56,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582371215] [2024-10-11 04:13:56,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:13:56,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:13:56,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:13:56,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:13:56,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:13:56,670 INFO L87 Difference]: Start difference. First operand 91161 states and 138356 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 04:14:00,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:14:00,673 INFO L93 Difference]: Finished difference Result 139099 states and 211689 transitions. [2024-10-11 04:14:00,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:14:00,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 166 [2024-10-11 04:14:00,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:14:01,146 INFO L225 Difference]: With dead ends: 139099 [2024-10-11 04:14:01,147 INFO L226 Difference]: Without dead ends: 77541 [2024-10-11 04:14:01,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 187 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-11 04:14:01,257 INFO L432 NwaCegarLoop]: 4158 mSDtfsCounter, 4113 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4113 SdHoareTripleChecker+Valid, 4194 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-11 04:14:01,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4113 Valid, 4194 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:14:01,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77541 states.