./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/pc_sfifo_2.cil-1+token_ring.03.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4c3aab1156afcb98b97b027e9b66004d54025f3b89e95d6d35dc2e84fdb640d2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 05:11:35,673 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 05:11:35,747 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 05:11:35,751 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 05:11:35,752 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 05:11:35,773 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 05:11:35,774 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 05:11:35,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 05:11:35,775 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 05:11:35,775 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 05:11:35,776 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 05:11:35,776 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 05:11:35,777 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 05:11:35,777 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 05:11:35,777 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 05:11:35,778 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 05:11:35,778 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 05:11:35,778 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 05:11:35,779 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 05:11:35,779 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 05:11:35,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 05:11:35,780 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 05:11:35,781 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 05:11:35,781 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 05:11:35,781 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 05:11:35,782 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 05:11:35,782 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 05:11:35,782 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 05:11:35,783 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 05:11:35,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 05:11:35,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 05:11:35,784 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 05:11:35,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:11:35,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 05:11:35,785 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 05:11:35,785 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 05:11:35,785 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 05:11:35,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 05:11:35,786 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 05:11:35,786 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 05:11:35,786 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 05:11:35,792 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 05:11:35,792 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4c3aab1156afcb98b97b027e9b66004d54025f3b89e95d6d35dc2e84fdb640d2 [2024-10-14 05:11:36,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 05:11:36,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 05:11:36,088 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 05:11:36,089 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 05:11:36,090 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 05:11:36,091 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c [2024-10-14 05:11:37,645 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 05:11:37,853 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 05:11:37,854 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c [2024-10-14 05:11:37,873 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/694c93f52/201c08f639f54cb98f4901fe0ff1278b/FLAG96c4a2ec5 [2024-10-14 05:11:37,886 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/694c93f52/201c08f639f54cb98f4901fe0ff1278b [2024-10-14 05:11:37,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 05:11:37,890 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 05:11:37,891 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 05:11:37,891 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 05:11:37,896 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 05:11:37,898 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:11:37" (1/1) ... [2024-10-14 05:11:37,901 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b76f95d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:37, skipping insertion in model container [2024-10-14 05:11:37,901 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:11:37" (1/1) ... [2024-10-14 05:11:37,942 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 05:11:38,127 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/pc_sfifo_2.cil-1+token_ring.03.cil-2.c[914,927] [2024-10-14 05:11:38,187 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/pc_sfifo_2.cil-1+token_ring.03.cil-2.c[7115,7128] [2024-10-14 05:11:38,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:11:38,257 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 05:11:38,271 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/pc_sfifo_2.cil-1+token_ring.03.cil-2.c[914,927] [2024-10-14 05:11:38,293 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/pc_sfifo_2.cil-1+token_ring.03.cil-2.c[7115,7128] [2024-10-14 05:11:38,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:11:38,348 INFO L204 MainTranslator]: Completed translation [2024-10-14 05:11:38,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:38 WrapperNode [2024-10-14 05:11:38,348 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 05:11:38,350 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 05:11:38,350 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 05:11:38,350 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 05:11:38,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:38" (1/1) ... [2024-10-14 05:11:38,371 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:38" (1/1) ... [2024-10-14 05:11:38,421 INFO L138 Inliner]: procedures = 59, calls = 66, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 528 [2024-10-14 05:11:38,422 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 05:11:38,423 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 05:11:38,423 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 05:11:38,423 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 05:11:38,440 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:38" (1/1) ... [2024-10-14 05:11:38,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:38" (1/1) ... [2024-10-14 05:11:38,448 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:38" (1/1) ... [2024-10-14 05:11:38,475 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-14 05:11:38,476 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:38" (1/1) ... [2024-10-14 05:11:38,476 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:38" (1/1) ... [2024-10-14 05:11:38,484 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:38" (1/1) ... [2024-10-14 05:11:38,495 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:38" (1/1) ... [2024-10-14 05:11:38,498 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:38" (1/1) ... [2024-10-14 05:11:38,500 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:38" (1/1) ... [2024-10-14 05:11:38,505 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 05:11:38,512 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 05:11:38,512 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 05:11:38,512 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 05:11:38,513 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:38" (1/1) ... [2024-10-14 05:11:38,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:11:38,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:11:38,557 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 05:11:38,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 05:11:38,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 05:11:38,613 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-14 05:11:38,614 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-14 05:11:38,614 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-14 05:11:38,615 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-14 05:11:38,616 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-14 05:11:38,616 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-14 05:11:38,616 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-14 05:11:38,616 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-14 05:11:38,617 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-10-14 05:11:38,617 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-10-14 05:11:38,617 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-14 05:11:38,617 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-14 05:11:38,618 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-14 05:11:38,618 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-14 05:11:38,618 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-10-14 05:11:38,618 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-10-14 05:11:38,619 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-14 05:11:38,619 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-14 05:11:38,619 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-10-14 05:11:38,619 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-10-14 05:11:38,619 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-14 05:11:38,619 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-14 05:11:38,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 05:11:38,620 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-14 05:11:38,620 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-14 05:11:38,620 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-10-14 05:11:38,620 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-10-14 05:11:38,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 05:11:38,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 05:11:38,620 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-14 05:11:38,620 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-14 05:11:38,741 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 05:11:38,777 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 05:11:39,470 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2024-10-14 05:11:39,470 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 05:11:39,532 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 05:11:39,533 INFO L314 CfgBuilder]: Removed 10 assume(true) statements. [2024-10-14 05:11:39,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:11:39 BoogieIcfgContainer [2024-10-14 05:11:39,533 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 05:11:39,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 05:11:39,536 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 05:11:39,539 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 05:11:39,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:11:37" (1/3) ... [2024-10-14 05:11:39,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ecdab3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:11:39, skipping insertion in model container [2024-10-14 05:11:39,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:38" (2/3) ... [2024-10-14 05:11:39,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ecdab3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:11:39, skipping insertion in model container [2024-10-14 05:11:39,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:11:39" (3/3) ... [2024-10-14 05:11:39,542 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.03.cil-2.c [2024-10-14 05:11:39,560 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 05:11:39,561 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 05:11:39,641 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 05:11:39,648 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;@322a6793, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 05:11:39,648 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 05:11:39,654 INFO L276 IsEmpty]: Start isEmpty. Operand has 232 states, 184 states have (on average 1.6521739130434783) internal successors, (304), 190 states have internal predecessors, (304), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-14 05:11:39,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 05:11:39,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:39,669 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] [2024-10-14 05:11:39,669 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:39,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:39,674 INFO L85 PathProgramCache]: Analyzing trace with hash -917654171, now seen corresponding path program 1 times [2024-10-14 05:11:39,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:39,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897327222] [2024-10-14 05:11:39,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:39,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:40,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:40,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:11:40,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:40,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:11:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:40,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:11:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:40,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:11:40,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:40,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:11:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:40,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:11:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:40,263 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-14 05:11:40,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:40,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897327222] [2024-10-14 05:11:40,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897327222] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:40,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:40,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 05:11:40,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265837599] [2024-10-14 05:11:40,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:40,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:11:40,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:40,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:11:40,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:11:40,301 INFO L87 Difference]: Start difference. First operand has 232 states, 184 states have (on average 1.6521739130434783) internal successors, (304), 190 states have internal predecessors, (304), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:11:41,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:41,472 INFO L93 Difference]: Finished difference Result 573 states and 901 transitions. [2024-10-14 05:11:41,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:11:41,475 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2024-10-14 05:11:41,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:41,492 INFO L225 Difference]: With dead ends: 573 [2024-10-14 05:11:41,493 INFO L226 Difference]: Without dead ends: 352 [2024-10-14 05:11:41,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:11:41,503 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 464 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:41,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 1007 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 05:11:41,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-10-14 05:11:41,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 315. [2024-10-14 05:11:41,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 249 states have (on average 1.502008032128514) internal successors, (374), 255 states have internal predecessors, (374), 42 states have call successors, (42), 21 states have call predecessors, (42), 22 states have return successors, (45), 41 states have call predecessors, (45), 40 states have call successors, (45) [2024-10-14 05:11:41,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 461 transitions. [2024-10-14 05:11:41,615 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 461 transitions. Word has length 58 [2024-10-14 05:11:41,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:41,616 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 461 transitions. [2024-10-14 05:11:41,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:11:41,617 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 461 transitions. [2024-10-14 05:11:41,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 05:11:41,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:41,624 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] [2024-10-14 05:11:41,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 05:11:41,625 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:41,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:41,625 INFO L85 PathProgramCache]: Analyzing trace with hash -2008816218, now seen corresponding path program 1 times [2024-10-14 05:11:41,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:41,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452005133] [2024-10-14 05:11:41,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:41,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:41,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:41,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:41,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:11:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:41,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:11:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:41,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:11:41,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:41,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:11:41,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:41,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:11:41,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:41,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:11:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:41,878 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-14 05:11:41,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:41,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452005133] [2024-10-14 05:11:41,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452005133] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:41,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:41,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 05:11:41,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275702825] [2024-10-14 05:11:41,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:41,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:11:41,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:41,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:11:41,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:11:41,885 INFO L87 Difference]: Start difference. First operand 315 states and 461 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:11:43,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:43,025 INFO L93 Difference]: Finished difference Result 635 states and 911 transitions. [2024-10-14 05:11:43,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 05:11:43,026 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2024-10-14 05:11:43,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:43,035 INFO L225 Difference]: With dead ends: 635 [2024-10-14 05:11:43,037 INFO L226 Difference]: Without dead ends: 473 [2024-10-14 05:11:43,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-10-14 05:11:43,043 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 674 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:43,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 1111 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 05:11:43,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-10-14 05:11:43,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 403. [2024-10-14 05:11:43,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 317 states have (on average 1.4826498422712935) internal successors, (470), 325 states have internal predecessors, (470), 53 states have call successors, (53), 28 states have call predecessors, (53), 31 states have return successors, (64), 53 states have call predecessors, (64), 51 states have call successors, (64) [2024-10-14 05:11:43,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 587 transitions. [2024-10-14 05:11:43,110 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 587 transitions. Word has length 58 [2024-10-14 05:11:43,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:43,110 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 587 transitions. [2024-10-14 05:11:43,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:11:43,111 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 587 transitions. [2024-10-14 05:11:43,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 05:11:43,116 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:43,116 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] [2024-10-14 05:11:43,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 05:11:43,117 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:43,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:43,118 INFO L85 PathProgramCache]: Analyzing trace with hash -80543516, now seen corresponding path program 1 times [2024-10-14 05:11:43,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:43,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047402729] [2024-10-14 05:11:43,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:43,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:43,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:43,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:11:43,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:43,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:11:43,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:43,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:11:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:43,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:11:43,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:43,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:11:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:43,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:11:43,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:43,298 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-14 05:11:43,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:43,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047402729] [2024-10-14 05:11:43,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047402729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:43,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:43,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 05:11:43,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066098108] [2024-10-14 05:11:43,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:43,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:11:43,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:43,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:11:43,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:11:43,301 INFO L87 Difference]: Start difference. First operand 403 states and 587 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:11:44,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:44,112 INFO L93 Difference]: Finished difference Result 677 states and 973 transitions. [2024-10-14 05:11:44,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:11:44,117 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2024-10-14 05:11:44,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:44,121 INFO L225 Difference]: With dead ends: 677 [2024-10-14 05:11:44,124 INFO L226 Difference]: Without dead ends: 433 [2024-10-14 05:11:44,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-14 05:11:44,126 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 397 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:44,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 1076 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 05:11:44,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-10-14 05:11:44,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 407. [2024-10-14 05:11:44,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 320 states have (on average 1.471875) internal successors, (471), 328 states have internal predecessors, (471), 53 states have call successors, (53), 28 states have call predecessors, (53), 32 states have return successors, (65), 54 states have call predecessors, (65), 51 states have call successors, (65) [2024-10-14 05:11:44,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 589 transitions. [2024-10-14 05:11:44,173 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 589 transitions. Word has length 58 [2024-10-14 05:11:44,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:44,173 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 589 transitions. [2024-10-14 05:11:44,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:11:44,173 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 589 transitions. [2024-10-14 05:11:44,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 05:11:44,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:44,175 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] [2024-10-14 05:11:44,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 05:11:44,176 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:44,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:44,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1970440482, now seen corresponding path program 1 times [2024-10-14 05:11:44,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:44,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588414132] [2024-10-14 05:11:44,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:44,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:44,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:44,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:44,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:44,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:11:44,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:44,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:11:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:44,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:11:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:44,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:11:44,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:44,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:11:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:44,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:11:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:44,348 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-14 05:11:44,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:44,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588414132] [2024-10-14 05:11:44,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588414132] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:44,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:44,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 05:11:44,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339314410] [2024-10-14 05:11:44,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:44,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:11:44,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:44,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:11:44,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:11:44,353 INFO L87 Difference]: Start difference. First operand 407 states and 589 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:11:45,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:45,178 INFO L93 Difference]: Finished difference Result 695 states and 991 transitions. [2024-10-14 05:11:45,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 05:11:45,178 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2024-10-14 05:11:45,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:45,184 INFO L225 Difference]: With dead ends: 695 [2024-10-14 05:11:45,184 INFO L226 Difference]: Without dead ends: 447 [2024-10-14 05:11:45,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:11:45,187 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 403 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:45,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 1075 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 05:11:45,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2024-10-14 05:11:45,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 419. [2024-10-14 05:11:45,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 329 states have (on average 1.458966565349544) internal successors, (480), 337 states have internal predecessors, (480), 53 states have call successors, (53), 28 states have call predecessors, (53), 35 states have return successors, (68), 57 states have call predecessors, (68), 51 states have call successors, (68) [2024-10-14 05:11:45,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 601 transitions. [2024-10-14 05:11:45,237 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 601 transitions. Word has length 58 [2024-10-14 05:11:45,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:45,237 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 601 transitions. [2024-10-14 05:11:45,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:11:45,238 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 601 transitions. [2024-10-14 05:11:45,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 05:11:45,240 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:45,240 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] [2024-10-14 05:11:45,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 05:11:45,241 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:45,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:45,242 INFO L85 PathProgramCache]: Analyzing trace with hash 2032480096, now seen corresponding path program 1 times [2024-10-14 05:11:45,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:45,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117673731] [2024-10-14 05:11:45,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:45,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:45,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:45,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:11:45,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:45,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:11:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:45,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:11:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:45,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:11:45,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:45,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:11:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:45,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:11:45,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:45,409 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-14 05:11:45,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:45,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117673731] [2024-10-14 05:11:45,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117673731] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:45,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:45,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 05:11:45,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146175867] [2024-10-14 05:11:45,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:45,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:11:45,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:45,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:11:45,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:11:45,411 INFO L87 Difference]: Start difference. First operand 419 states and 601 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:11:46,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:46,391 INFO L93 Difference]: Finished difference Result 775 states and 1076 transitions. [2024-10-14 05:11:46,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 05:11:46,392 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2024-10-14 05:11:46,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:46,395 INFO L225 Difference]: With dead ends: 775 [2024-10-14 05:11:46,396 INFO L226 Difference]: Without dead ends: 517 [2024-10-14 05:11:46,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-10-14 05:11:46,398 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 668 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 1163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:46,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 913 Invalid, 1163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 05:11:46,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2024-10-14 05:11:46,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 429. [2024-10-14 05:11:46,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 337 states have (on average 1.4480712166172107) internal successors, (488), 345 states have internal predecessors, (488), 54 states have call successors, (54), 29 states have call predecessors, (54), 36 states have return successors, (67), 58 states have call predecessors, (67), 52 states have call successors, (67) [2024-10-14 05:11:46,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 609 transitions. [2024-10-14 05:11:46,454 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 609 transitions. Word has length 58 [2024-10-14 05:11:46,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:46,455 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 609 transitions. [2024-10-14 05:11:46,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:11:46,455 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 609 transitions. [2024-10-14 05:11:46,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 05:11:46,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:46,456 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] [2024-10-14 05:11:46,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 05:11:46,457 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:46,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:46,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1839785374, now seen corresponding path program 1 times [2024-10-14 05:11:46,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:46,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939132929] [2024-10-14 05:11:46,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:46,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:46,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:46,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:46,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:46,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:11:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:46,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:11:46,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:46,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:11:46,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:46,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:11:46,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:46,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:11:46,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:46,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:11:46,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:46,565 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-14 05:11:46,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:46,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939132929] [2024-10-14 05:11:46,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939132929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:46,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:46,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:11:46,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932715805] [2024-10-14 05:11:46,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:46,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:11:46,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:46,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:11:46,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:11:46,569 INFO L87 Difference]: Start difference. First operand 429 states and 609 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 4 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:11:47,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:47,195 INFO L93 Difference]: Finished difference Result 1011 states and 1396 transitions. [2024-10-14 05:11:47,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 05:11:47,195 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 4 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2024-10-14 05:11:47,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:47,201 INFO L225 Difference]: With dead ends: 1011 [2024-10-14 05:11:47,201 INFO L226 Difference]: Without dead ends: 744 [2024-10-14 05:11:47,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-10-14 05:11:47,205 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 809 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 832 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:47,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [832 Valid, 607 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 05:11:47,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2024-10-14 05:11:47,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 690. [2024-10-14 05:11:47,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 532 states have (on average 1.4022556390977443) internal successors, (746), 547 states have internal predecessors, (746), 89 states have call successors, (89), 51 states have call predecessors, (89), 67 states have return successors, (124), 98 states have call predecessors, (124), 87 states have call successors, (124) [2024-10-14 05:11:47,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 959 transitions. [2024-10-14 05:11:47,269 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 959 transitions. Word has length 58 [2024-10-14 05:11:47,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:47,270 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 959 transitions. [2024-10-14 05:11:47,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 4 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:11:47,270 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 959 transitions. [2024-10-14 05:11:47,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 05:11:47,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:47,272 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] [2024-10-14 05:11:47,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 05:11:47,272 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:47,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:47,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1289341817, now seen corresponding path program 1 times [2024-10-14 05:11:47,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:47,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106745995] [2024-10-14 05:11:47,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:47,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:47,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:47,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:47,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:11:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:47,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:11:47,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:47,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:11:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:47,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:11:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:47,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:11:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:47,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:11:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:47,390 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-14 05:11:47,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:47,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106745995] [2024-10-14 05:11:47,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106745995] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:47,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:47,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:11:47,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787635542] [2024-10-14 05:11:47,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:47,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:11:47,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:47,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:11:47,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:11:47,393 INFO L87 Difference]: Start difference. First operand 690 states and 959 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:11:48,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:48,030 INFO L93 Difference]: Finished difference Result 1774 states and 2405 transitions. [2024-10-14 05:11:48,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 05:11:48,031 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2024-10-14 05:11:48,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:48,038 INFO L225 Difference]: With dead ends: 1774 [2024-10-14 05:11:48,038 INFO L226 Difference]: Without dead ends: 1255 [2024-10-14 05:11:48,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-14 05:11:48,042 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 643 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:48,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 631 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 05:11:48,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2024-10-14 05:11:48,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1101. [2024-10-14 05:11:48,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1101 states, 843 states have (on average 1.3594306049822065) internal successors, (1146), 865 states have internal predecessors, (1146), 138 states have call successors, (138), 93 states have call predecessors, (138), 118 states have return successors, (194), 149 states have call predecessors, (194), 136 states have call successors, (194) [2024-10-14 05:11:48,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1478 transitions. [2024-10-14 05:11:48,162 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1478 transitions. Word has length 59 [2024-10-14 05:11:48,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:48,162 INFO L471 AbstractCegarLoop]: Abstraction has 1101 states and 1478 transitions. [2024-10-14 05:11:48,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:11:48,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1478 transitions. [2024-10-14 05:11:48,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 05:11:48,166 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:48,166 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] [2024-10-14 05:11:48,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 05:11:48,166 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:48,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:48,167 INFO L85 PathProgramCache]: Analyzing trace with hash -574964482, now seen corresponding path program 1 times [2024-10-14 05:11:48,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:48,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401658285] [2024-10-14 05:11:48,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:48,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:48,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:48,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:11:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:48,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:11:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:48,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:11:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:48,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:11:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:48,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:11:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:48,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:11:48,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:48,252 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-14 05:11:48,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:48,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401658285] [2024-10-14 05:11:48,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401658285] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:48,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:48,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:11:48,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731030483] [2024-10-14 05:11:48,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:48,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:11:48,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:48,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:11:48,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:11:48,254 INFO L87 Difference]: Start difference. First operand 1101 states and 1478 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:11:48,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:48,979 INFO L93 Difference]: Finished difference Result 3061 states and 4041 transitions. [2024-10-14 05:11:48,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:11:48,980 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 60 [2024-10-14 05:11:48,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:48,993 INFO L225 Difference]: With dead ends: 3061 [2024-10-14 05:11:48,994 INFO L226 Difference]: Without dead ends: 2101 [2024-10-14 05:11:48,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:11:48,998 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 450 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:48,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 698 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 05:11:49,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2101 states. [2024-10-14 05:11:49,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2101 to 1917. [2024-10-14 05:11:49,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1917 states, 1461 states have (on average 1.326488706365503) internal successors, (1938), 1489 states have internal predecessors, (1938), 232 states have call successors, (232), 179 states have call predecessors, (232), 222 states have return successors, (332), 255 states have call predecessors, (332), 230 states have call successors, (332) [2024-10-14 05:11:49,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1917 states to 1917 states and 2502 transitions. [2024-10-14 05:11:49,147 INFO L78 Accepts]: Start accepts. Automaton has 1917 states and 2502 transitions. Word has length 60 [2024-10-14 05:11:49,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:49,148 INFO L471 AbstractCegarLoop]: Abstraction has 1917 states and 2502 transitions. [2024-10-14 05:11:49,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:11:49,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1917 states and 2502 transitions. [2024-10-14 05:11:49,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-14 05:11:49,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:49,153 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] [2024-10-14 05:11:49,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 05:11:49,180 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:49,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:49,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1978334883, now seen corresponding path program 1 times [2024-10-14 05:11:49,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:49,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645061530] [2024-10-14 05:11:49,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:49,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:49,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:49,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:49,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:11:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:49,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:11:49,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:49,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:11:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:49,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:11:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:49,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:11:49,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:49,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:11:49,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:49,268 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-14 05:11:49,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:49,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645061530] [2024-10-14 05:11:49,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645061530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:49,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:49,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:11:49,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496248426] [2024-10-14 05:11:49,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:49,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:11:49,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:49,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:11:49,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:11:49,271 INFO L87 Difference]: Start difference. First operand 1917 states and 2502 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:11:50,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:50,027 INFO L93 Difference]: Finished difference Result 4581 states and 5906 transitions. [2024-10-14 05:11:50,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:11:50,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2024-10-14 05:11:50,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:50,044 INFO L225 Difference]: With dead ends: 4581 [2024-10-14 05:11:50,045 INFO L226 Difference]: Without dead ends: 2825 [2024-10-14 05:11:50,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:11:50,050 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 793 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:50,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 507 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 05:11:50,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2825 states. [2024-10-14 05:11:50,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2825 to 2583. [2024-10-14 05:11:50,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2583 states, 1963 states have (on average 1.3122771268466633) internal successors, (2576), 1999 states have internal predecessors, (2576), 312 states have call successors, (312), 249 states have call predecessors, (312), 306 states have return successors, (441), 341 states have call predecessors, (441), 310 states have call successors, (441) [2024-10-14 05:11:50,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2583 states to 2583 states and 3329 transitions. [2024-10-14 05:11:50,279 INFO L78 Accepts]: Start accepts. Automaton has 2583 states and 3329 transitions. Word has length 66 [2024-10-14 05:11:50,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:50,280 INFO L471 AbstractCegarLoop]: Abstraction has 2583 states and 3329 transitions. [2024-10-14 05:11:50,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:11:50,280 INFO L276 IsEmpty]: Start isEmpty. Operand 2583 states and 3329 transitions. [2024-10-14 05:11:50,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-14 05:11:50,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:50,283 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:50,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 05:11:50,283 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:50,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:50,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1715112493, now seen corresponding path program 1 times [2024-10-14 05:11:50,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:50,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975687360] [2024-10-14 05:11:50,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:50,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:50,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:50,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:50,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:11:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:50,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:11:50,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:50,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:11:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:50,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:11:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:50,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:11:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:50,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:11:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:50,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:11:50,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:50,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975687360] [2024-10-14 05:11:50,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975687360] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:50,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:50,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:11:50,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126182962] [2024-10-14 05:11:50,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:50,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:11:50,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:50,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:11:50,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:11:50,381 INFO L87 Difference]: Start difference. First operand 2583 states and 3329 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-14 05:11:51,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:51,299 INFO L93 Difference]: Finished difference Result 3303 states and 4206 transitions. [2024-10-14 05:11:51,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 05:11:51,300 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 67 [2024-10-14 05:11:51,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:51,318 INFO L225 Difference]: With dead ends: 3303 [2024-10-14 05:11:51,319 INFO L226 Difference]: Without dead ends: 3300 [2024-10-14 05:11:51,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2024-10-14 05:11:51,321 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 970 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:51,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [980 Valid, 617 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 05:11:51,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3300 states. [2024-10-14 05:11:51,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3300 to 3033. [2024-10-14 05:11:51,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3033 states, 2304 states have (on average 1.3038194444444444) internal successors, (3004), 2345 states have internal predecessors, (3004), 362 states have call successors, (362), 293 states have call predecessors, (362), 365 states have return successors, (520), 401 states have call predecessors, (520), 361 states have call successors, (520) [2024-10-14 05:11:51,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3033 states to 3033 states and 3886 transitions. [2024-10-14 05:11:51,668 INFO L78 Accepts]: Start accepts. Automaton has 3033 states and 3886 transitions. Word has length 67 [2024-10-14 05:11:51,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:51,668 INFO L471 AbstractCegarLoop]: Abstraction has 3033 states and 3886 transitions. [2024-10-14 05:11:51,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-14 05:11:51,669 INFO L276 IsEmpty]: Start isEmpty. Operand 3033 states and 3886 transitions. [2024-10-14 05:11:51,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 05:11:51,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:51,670 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:51,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 05:11:51,671 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:51,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:51,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1629656985, now seen corresponding path program 1 times [2024-10-14 05:11:51,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:51,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558635585] [2024-10-14 05:11:51,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:51,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:51,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:51,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:51,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:11:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:51,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:11:51,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:51,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:11:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:51,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:11:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:51,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:11:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:51,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:11:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:51,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:11:51,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:51,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558635585] [2024-10-14 05:11:51,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558635585] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:11:51,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232468307] [2024-10-14 05:11:51,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:51,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:11:51,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:11:51,841 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:11:51,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 05:11:51,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:51,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 05:11:51,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:11:52,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:11:52,209 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 05:11:52,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:11:52,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232468307] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 05:11:52,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 05:11:52,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2024-10-14 05:11:52,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129094112] [2024-10-14 05:11:52,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 05:11:52,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 05:11:52,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:52,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 05:11:52,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-14 05:11:52,321 INFO L87 Difference]: Start difference. First operand 3033 states and 3886 transitions. Second operand has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-14 05:11:54,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:54,152 INFO L93 Difference]: Finished difference Result 7100 states and 8998 transitions. [2024-10-14 05:11:54,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-14 05:11:54,153 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 68 [2024-10-14 05:11:54,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:54,194 INFO L225 Difference]: With dead ends: 7100 [2024-10-14 05:11:54,195 INFO L226 Difference]: Without dead ends: 7097 [2024-10-14 05:11:54,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2024-10-14 05:11:54,200 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 1336 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 1330 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1399 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 1542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 1330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:54,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1399 Valid, 1069 Invalid, 1542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 1330 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 05:11:54,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7097 states. [2024-10-14 05:11:54,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7097 to 4659. [2024-10-14 05:11:54,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4659 states, 3544 states have (on average 1.3024830699774266) internal successors, (4616), 3607 states have internal predecessors, (4616), 546 states have call successors, (546), 451 states have call predecessors, (546), 567 states have return successors, (798), 607 states have call predecessors, (798), 545 states have call successors, (798) [2024-10-14 05:11:54,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4659 states to 4659 states and 5960 transitions. [2024-10-14 05:11:54,808 INFO L78 Accepts]: Start accepts. Automaton has 4659 states and 5960 transitions. Word has length 68 [2024-10-14 05:11:54,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:54,808 INFO L471 AbstractCegarLoop]: Abstraction has 4659 states and 5960 transitions. [2024-10-14 05:11:54,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-14 05:11:54,809 INFO L276 IsEmpty]: Start isEmpty. Operand 4659 states and 5960 transitions. [2024-10-14 05:11:54,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 05:11:54,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:54,811 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 05:11:54,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 05:11:55,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-14 05:11:55,016 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:55,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:55,016 INFO L85 PathProgramCache]: Analyzing trace with hash 228963667, now seen corresponding path program 2 times [2024-10-14 05:11:55,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:55,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468516334] [2024-10-14 05:11:55,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:55,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:55,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:55,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:11:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:55,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:11:55,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:55,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:11:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:55,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:11:55,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:55,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:11:55,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:55,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:11:55,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:55,076 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:11:55,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:55,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468516334] [2024-10-14 05:11:55,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468516334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:55,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:55,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:11:55,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177926051] [2024-10-14 05:11:55,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:55,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:11:55,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:55,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:11:55,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:11:55,078 INFO L87 Difference]: Start difference. First operand 4659 states and 5960 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-14 05:11:55,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:55,898 INFO L93 Difference]: Finished difference Result 7115 states and 9107 transitions. [2024-10-14 05:11:55,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 05:11:55,898 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 71 [2024-10-14 05:11:55,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:55,922 INFO L225 Difference]: With dead ends: 7115 [2024-10-14 05:11:55,922 INFO L226 Difference]: Without dead ends: 3412 [2024-10-14 05:11:55,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-14 05:11:55,934 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 558 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:55,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 712 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 05:11:55,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3412 states. [2024-10-14 05:11:56,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3412 to 3183. [2024-10-14 05:11:56,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3183 states, 2424 states have (on average 1.2821782178217822) internal successors, (3108), 2465 states have internal predecessors, (3108), 378 states have call successors, (378), 307 states have call predecessors, (378), 379 states have return successors, (524), 417 states have call predecessors, (524), 377 states have call successors, (524) [2024-10-14 05:11:56,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 4010 transitions. [2024-10-14 05:11:56,317 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 4010 transitions. Word has length 71 [2024-10-14 05:11:56,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:56,318 INFO L471 AbstractCegarLoop]: Abstraction has 3183 states and 4010 transitions. [2024-10-14 05:11:56,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-14 05:11:56,318 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 4010 transitions. [2024-10-14 05:11:56,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 05:11:56,323 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:56,323 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:56,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 05:11:56,324 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:56,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:56,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1733702944, now seen corresponding path program 1 times [2024-10-14 05:11:56,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:56,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972645678] [2024-10-14 05:11:56,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:56,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:56,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:56,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 05:11:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:56,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 05:11:56,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:56,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 05:11:56,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:56,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:11:56,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:56,439 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-14 05:11:56,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:56,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972645678] [2024-10-14 05:11:56,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972645678] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:56,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:56,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:11:56,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870907435] [2024-10-14 05:11:56,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:56,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:11:56,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:56,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:11:56,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:11:56,442 INFO L87 Difference]: Start difference. First operand 3183 states and 4010 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:57,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:57,794 INFO L93 Difference]: Finished difference Result 3524 states and 4550 transitions. [2024-10-14 05:11:57,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:11:57,795 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-10-14 05:11:57,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:57,817 INFO L225 Difference]: With dead ends: 3524 [2024-10-14 05:11:57,817 INFO L226 Difference]: Without dead ends: 3394 [2024-10-14 05:11:57,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:11:57,827 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 698 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:57,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 615 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 05:11:57,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3394 states. [2024-10-14 05:11:58,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3394 to 3315. [2024-10-14 05:11:58,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3315 states, 2537 states have (on average 1.2948364209696492) internal successors, (3285), 2579 states have internal predecessors, (3285), 390 states have call successors, (390), 313 states have call predecessors, (390), 386 states have return successors, (539), 429 states have call predecessors, (539), 389 states have call successors, (539) [2024-10-14 05:11:58,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3315 states to 3315 states and 4214 transitions. [2024-10-14 05:11:58,299 INFO L78 Accepts]: Start accepts. Automaton has 3315 states and 4214 transitions. Word has length 71 [2024-10-14 05:11:58,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:58,300 INFO L471 AbstractCegarLoop]: Abstraction has 3315 states and 4214 transitions. [2024-10-14 05:11:58,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:58,300 INFO L276 IsEmpty]: Start isEmpty. Operand 3315 states and 4214 transitions. [2024-10-14 05:11:58,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 05:11:58,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:58,303 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:58,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 05:11:58,303 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:58,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:58,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1860015964, now seen corresponding path program 1 times [2024-10-14 05:11:58,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:58,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403391849] [2024-10-14 05:11:58,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:58,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:58,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:58,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 05:11:58,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:58,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 05:11:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:58,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 05:11:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:58,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:11:58,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:58,426 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-14 05:11:58,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:58,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403391849] [2024-10-14 05:11:58,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403391849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:58,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:58,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:11:58,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011565305] [2024-10-14 05:11:58,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:58,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:11:58,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:58,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:11:58,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:11:58,428 INFO L87 Difference]: Start difference. First operand 3315 states and 4214 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:59,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:59,802 INFO L93 Difference]: Finished difference Result 3829 states and 5020 transitions. [2024-10-14 05:11:59,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:11:59,803 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-10-14 05:11:59,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:59,822 INFO L225 Difference]: With dead ends: 3829 [2024-10-14 05:11:59,822 INFO L226 Difference]: Without dead ends: 3567 [2024-10-14 05:11:59,825 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-14 05:11:59,826 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 697 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 1531 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 1608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:59,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 1021 Invalid, 1608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1531 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 05:11:59,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3567 states. [2024-10-14 05:12:00,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3567 to 3438. [2024-10-14 05:12:00,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3438 states, 2641 states have (on average 1.3040514956455889) internal successors, (3444), 2684 states have internal predecessors, (3444), 402 states have call successors, (402), 319 states have call predecessors, (402), 393 states have return successors, (553), 442 states have call predecessors, (553), 401 states have call successors, (553) [2024-10-14 05:12:00,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3438 states to 3438 states and 4399 transitions. [2024-10-14 05:12:00,246 INFO L78 Accepts]: Start accepts. Automaton has 3438 states and 4399 transitions. Word has length 71 [2024-10-14 05:12:00,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:12:00,246 INFO L471 AbstractCegarLoop]: Abstraction has 3438 states and 4399 transitions. [2024-10-14 05:12:00,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:12:00,247 INFO L276 IsEmpty]: Start isEmpty. Operand 3438 states and 4399 transitions. [2024-10-14 05:12:00,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 05:12:00,250 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:00,250 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:12:00,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 05:12:00,250 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:00,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:00,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1426286878, now seen corresponding path program 1 times [2024-10-14 05:12:00,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:00,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395796274] [2024-10-14 05:12:00,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:00,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:00,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:00,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:00,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:00,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 05:12:00,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:00,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 05:12:00,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:00,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 05:12:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:00,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:12:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:00,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:12:00,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:00,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395796274] [2024-10-14 05:12:00,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395796274] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:00,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:12:00,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:12:00,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047034805] [2024-10-14 05:12:00,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:00,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:12:00,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:00,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:12:00,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:12:00,368 INFO L87 Difference]: Start difference. First operand 3438 states and 4399 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:12:02,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:12:02,018 INFO L93 Difference]: Finished difference Result 4275 states and 5707 transitions. [2024-10-14 05:12:02,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:12:02,019 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-10-14 05:12:02,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:12:02,037 INFO L225 Difference]: With dead ends: 4275 [2024-10-14 05:12:02,037 INFO L226 Difference]: Without dead ends: 3890 [2024-10-14 05:12:02,042 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-14 05:12:02,043 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 695 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 1527 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 1606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 05:12:02,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 1019 Invalid, 1606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1527 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 05:12:02,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3890 states. [2024-10-14 05:12:02,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3890 to 3685. [2024-10-14 05:12:02,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3685 states, 2850 states have (on average 1.3203508771929824) internal successors, (3763), 2895 states have internal predecessors, (3763), 426 states have call successors, (426), 331 states have call predecessors, (426), 407 states have return successors, (585), 468 states have call predecessors, (585), 425 states have call successors, (585) [2024-10-14 05:12:02,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3685 states to 3685 states and 4774 transitions. [2024-10-14 05:12:02,528 INFO L78 Accepts]: Start accepts. Automaton has 3685 states and 4774 transitions. Word has length 71 [2024-10-14 05:12:02,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:12:02,529 INFO L471 AbstractCegarLoop]: Abstraction has 3685 states and 4774 transitions. [2024-10-14 05:12:02,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:12:02,529 INFO L276 IsEmpty]: Start isEmpty. Operand 3685 states and 4774 transitions. [2024-10-14 05:12:02,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 05:12:02,532 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:02,532 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:12:02,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 05:12:02,533 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:02,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:02,533 INFO L85 PathProgramCache]: Analyzing trace with hash -165369628, now seen corresponding path program 1 times [2024-10-14 05:12:02,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:02,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617621421] [2024-10-14 05:12:02,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:02,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:02,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:02,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 05:12:02,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:02,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 05:12:02,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:02,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 05:12:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:02,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:12:02,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:02,657 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-14 05:12:02,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:02,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617621421] [2024-10-14 05:12:02,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617621421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:02,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:12:02,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:12:02,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639423901] [2024-10-14 05:12:02,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:02,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:12:02,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:02,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:12:02,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:12:02,660 INFO L87 Difference]: Start difference. First operand 3685 states and 4774 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:12:03,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:12:03,933 INFO L93 Difference]: Finished difference Result 4512 states and 6075 transitions. [2024-10-14 05:12:03,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:12:03,933 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-10-14 05:12:03,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:12:03,948 INFO L225 Difference]: With dead ends: 4512 [2024-10-14 05:12:03,948 INFO L226 Difference]: Without dead ends: 3880 [2024-10-14 05:12:03,951 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-14 05:12:03,952 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 578 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 05:12:03,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 629 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 05:12:03,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3880 states. [2024-10-14 05:12:04,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3880 to 3685. [2024-10-14 05:12:04,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3685 states, 2850 states have (on average 1.31859649122807) internal successors, (3758), 2895 states have internal predecessors, (3758), 426 states have call successors, (426), 331 states have call predecessors, (426), 407 states have return successors, (585), 468 states have call predecessors, (585), 425 states have call successors, (585) [2024-10-14 05:12:04,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3685 states to 3685 states and 4769 transitions. [2024-10-14 05:12:04,485 INFO L78 Accepts]: Start accepts. Automaton has 3685 states and 4769 transitions. Word has length 71 [2024-10-14 05:12:04,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:12:04,486 INFO L471 AbstractCegarLoop]: Abstraction has 3685 states and 4769 transitions. [2024-10-14 05:12:04,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:12:04,486 INFO L276 IsEmpty]: Start isEmpty. Operand 3685 states and 4769 transitions. [2024-10-14 05:12:04,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 05:12:04,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:04,489 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:12:04,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 05:12:04,489 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:04,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:04,490 INFO L85 PathProgramCache]: Analyzing trace with hash -124694878, now seen corresponding path program 1 times [2024-10-14 05:12:04,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:04,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577779657] [2024-10-14 05:12:04,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:04,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:04,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:04,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 05:12:04,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:04,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 05:12:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:04,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 05:12:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:04,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:12:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:04,605 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-14 05:12:04,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:04,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577779657] [2024-10-14 05:12:04,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577779657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:04,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:12:04,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:12:04,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180596317] [2024-10-14 05:12:04,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:04,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:12:04,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:04,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:12:04,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:12:04,607 INFO L87 Difference]: Start difference. First operand 3685 states and 4769 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:12:06,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:12:06,674 INFO L93 Difference]: Finished difference Result 5303 states and 7264 transitions. [2024-10-14 05:12:06,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 05:12:06,675 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-10-14 05:12:06,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:12:06,696 INFO L225 Difference]: With dead ends: 5303 [2024-10-14 05:12:06,696 INFO L226 Difference]: Without dead ends: 4671 [2024-10-14 05:12:06,701 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-14 05:12:06,702 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 712 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 1694 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 1775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:12:06,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 1012 Invalid, 1775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1694 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 05:12:06,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4671 states. [2024-10-14 05:12:07,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4671 to 4176. [2024-10-14 05:12:07,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4176 states, 3269 states have (on average 1.3438360354848577) internal successors, (4393), 3318 states have internal predecessors, (4393), 470 states have call successors, (470), 355 states have call predecessors, (470), 435 states have return successors, (651), 516 states have call predecessors, (651), 469 states have call successors, (651) [2024-10-14 05:12:07,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4176 states to 4176 states and 5514 transitions. [2024-10-14 05:12:07,366 INFO L78 Accepts]: Start accepts. Automaton has 4176 states and 5514 transitions. Word has length 71 [2024-10-14 05:12:07,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:12:07,367 INFO L471 AbstractCegarLoop]: Abstraction has 4176 states and 5514 transitions. [2024-10-14 05:12:07,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:12:07,367 INFO L276 IsEmpty]: Start isEmpty. Operand 4176 states and 5514 transitions. [2024-10-14 05:12:07,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 05:12:07,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:07,372 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:12:07,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 05:12:07,373 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:07,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:07,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1262090532, now seen corresponding path program 1 times [2024-10-14 05:12:07,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:07,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767029011] [2024-10-14 05:12:07,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:07,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:07,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:07,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:07,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 05:12:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:07,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 05:12:07,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:07,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 05:12:07,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:07,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:12:07,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:07,508 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-14 05:12:07,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:07,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767029011] [2024-10-14 05:12:07,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767029011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:07,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:12:07,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:12:07,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801298575] [2024-10-14 05:12:07,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:07,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:12:07,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:07,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:12:07,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:12:07,510 INFO L87 Difference]: Start difference. First operand 4176 states and 5514 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:12:09,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:12:09,121 INFO L93 Difference]: Finished difference Result 7084 states and 9993 transitions. [2024-10-14 05:12:09,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 05:12:09,122 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-10-14 05:12:09,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:12:09,142 INFO L225 Difference]: With dead ends: 7084 [2024-10-14 05:12:09,143 INFO L226 Difference]: Without dead ends: 5961 [2024-10-14 05:12:09,149 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-14 05:12:09,150 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 768 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 1469 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 05:12:09,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 1008 Invalid, 1551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1469 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 05:12:09,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5961 states. [2024-10-14 05:12:09,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5961 to 5114. [2024-10-14 05:12:09,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5114 states, 4067 states have (on average 1.3766904352102287) internal successors, (5599), 4124 states have internal predecessors, (5599), 554 states have call successors, (554), 403 states have call predecessors, (554), 491 states have return successors, (797), 608 states have call predecessors, (797), 553 states have call successors, (797) [2024-10-14 05:12:09,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5114 states to 5114 states and 6950 transitions. [2024-10-14 05:12:09,780 INFO L78 Accepts]: Start accepts. Automaton has 5114 states and 6950 transitions. Word has length 71 [2024-10-14 05:12:09,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:12:09,781 INFO L471 AbstractCegarLoop]: Abstraction has 5114 states and 6950 transitions. [2024-10-14 05:12:09,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:12:09,781 INFO L276 IsEmpty]: Start isEmpty. Operand 5114 states and 6950 transitions. [2024-10-14 05:12:09,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 05:12:09,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:09,787 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:12:09,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 05:12:09,787 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:09,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:09,787 INFO L85 PathProgramCache]: Analyzing trace with hash 2138109538, now seen corresponding path program 1 times [2024-10-14 05:12:09,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:09,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084379327] [2024-10-14 05:12:09,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:09,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:09,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:09,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:09,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:09,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 05:12:09,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:09,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 05:12:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:09,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 05:12:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:09,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:12:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:09,907 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-14 05:12:09,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:09,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084379327] [2024-10-14 05:12:09,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084379327] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:09,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:12:09,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:12:09,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413639143] [2024-10-14 05:12:09,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:09,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:12:09,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:09,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:12:09,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:12:09,912 INFO L87 Difference]: Start difference. First operand 5114 states and 6950 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:12:11,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:12:11,900 INFO L93 Difference]: Finished difference Result 10204 states and 14801 transitions. [2024-10-14 05:12:11,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 05:12:11,901 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-10-14 05:12:11,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:12:11,935 INFO L225 Difference]: With dead ends: 10204 [2024-10-14 05:12:11,935 INFO L226 Difference]: Without dead ends: 8143 [2024-10-14 05:12:11,948 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-14 05:12:11,949 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 692 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 1440 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 1523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:12:11,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 1012 Invalid, 1523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1440 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 05:12:11,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8143 states. [2024-10-14 05:12:12,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8143 to 7045. [2024-10-14 05:12:12,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7045 states, 5726 states have (on average 1.4182675515193852) internal successors, (8121), 5799 states have internal predecessors, (8121), 714 states have call successors, (714), 499 states have call predecessors, (714), 603 states have return successors, (1135), 784 states have call predecessors, (1135), 713 states have call successors, (1135) [2024-10-14 05:12:13,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7045 states to 7045 states and 9970 transitions. [2024-10-14 05:12:13,008 INFO L78 Accepts]: Start accepts. Automaton has 7045 states and 9970 transitions. Word has length 71 [2024-10-14 05:12:13,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:12:13,008 INFO L471 AbstractCegarLoop]: Abstraction has 7045 states and 9970 transitions. [2024-10-14 05:12:13,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:12:13,009 INFO L276 IsEmpty]: Start isEmpty. Operand 7045 states and 9970 transitions. [2024-10-14 05:12:13,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 05:12:13,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:13,018 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:12:13,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 05:12:13,019 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:13,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:13,019 INFO L85 PathProgramCache]: Analyzing trace with hash -618517728, now seen corresponding path program 1 times [2024-10-14 05:12:13,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:13,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409576022] [2024-10-14 05:12:13,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:13,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:13,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:13,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 05:12:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:13,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 05:12:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:13,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 05:12:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:13,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:12:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:13,116 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-14 05:12:13,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:13,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409576022] [2024-10-14 05:12:13,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409576022] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:13,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:12:13,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:12:13,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478272022] [2024-10-14 05:12:13,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:13,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:12:13,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:13,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:12:13,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:12:13,119 INFO L87 Difference]: Start difference. First operand 7045 states and 9970 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:12:14,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:12:14,503 INFO L93 Difference]: Finished difference Result 11960 states and 17678 transitions. [2024-10-14 05:12:14,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:12:14,504 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-10-14 05:12:14,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:12:14,538 INFO L225 Difference]: With dead ends: 11960 [2024-10-14 05:12:14,538 INFO L226 Difference]: Without dead ends: 7969 [2024-10-14 05:12:14,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:12:14,558 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 264 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:12:14,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 725 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 05:12:14,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7969 states. [2024-10-14 05:12:15,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7969 to 7111. [2024-10-14 05:12:15,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7111 states, 5792 states have (on average 1.4135013812154695) internal successors, (8187), 5865 states have internal predecessors, (8187), 714 states have call successors, (714), 499 states have call predecessors, (714), 603 states have return successors, (1135), 784 states have call predecessors, (1135), 713 states have call successors, (1135) [2024-10-14 05:12:15,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7111 states to 7111 states and 10036 transitions. [2024-10-14 05:12:15,365 INFO L78 Accepts]: Start accepts. Automaton has 7111 states and 10036 transitions. Word has length 71 [2024-10-14 05:12:15,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:12:15,366 INFO L471 AbstractCegarLoop]: Abstraction has 7111 states and 10036 transitions. [2024-10-14 05:12:15,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:12:15,366 INFO L276 IsEmpty]: Start isEmpty. Operand 7111 states and 10036 transitions. [2024-10-14 05:12:15,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 05:12:15,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:15,374 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:12:15,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 05:12:15,374 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:15,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:15,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1627061726, now seen corresponding path program 1 times [2024-10-14 05:12:15,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:15,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423665403] [2024-10-14 05:12:15,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:15,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:15,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:15,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 05:12:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:15,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 05:12:15,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:15,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 05:12:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:15,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:12:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:15,498 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-14 05:12:15,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:15,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423665403] [2024-10-14 05:12:15,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423665403] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:15,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:12:15,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:12:15,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588488915] [2024-10-14 05:12:15,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:15,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:12:15,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:15,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:12:15,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:12:15,502 INFO L87 Difference]: Start difference. First operand 7111 states and 10036 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:12:18,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:12:18,419 INFO L93 Difference]: Finished difference Result 21102 states and 32121 transitions. [2024-10-14 05:12:18,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 05:12:18,419 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-10-14 05:12:18,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:12:18,512 INFO L225 Difference]: With dead ends: 21102 [2024-10-14 05:12:18,512 INFO L226 Difference]: Without dead ends: 17045 [2024-10-14 05:12:18,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2024-10-14 05:12:18,544 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 1456 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 1361 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1473 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 1635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:12:18,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1473 Valid, 859 Invalid, 1635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1361 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 05:12:18,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17045 states. [2024-10-14 05:12:20,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17045 to 14765. [2024-10-14 05:12:20,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14765 states, 12311 states have (on average 1.4520347656567298) internal successors, (17876), 12499 states have internal predecessors, (17876), 1387 states have call successors, (1387), 897 states have call predecessors, (1387), 1065 states have return successors, (2460), 1406 states have call predecessors, (2460), 1386 states have call successors, (2460) [2024-10-14 05:12:20,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14765 states to 14765 states and 21723 transitions. [2024-10-14 05:12:20,079 INFO L78 Accepts]: Start accepts. Automaton has 14765 states and 21723 transitions. Word has length 71 [2024-10-14 05:12:20,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:12:20,079 INFO L471 AbstractCegarLoop]: Abstraction has 14765 states and 21723 transitions. [2024-10-14 05:12:20,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:12:20,080 INFO L276 IsEmpty]: Start isEmpty. Operand 14765 states and 21723 transitions. [2024-10-14 05:12:20,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-14 05:12:20,086 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:20,087 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 05:12:20,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 05:12:20,087 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:20,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:20,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1810871584, now seen corresponding path program 1 times [2024-10-14 05:12:20,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:20,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270212174] [2024-10-14 05:12:20,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:20,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:20,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:20,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:12:20,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:20,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:12:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:20,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:12:20,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:20,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:12:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:20,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:12:20,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:20,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:12:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:20,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:12:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:20,187 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 05:12:20,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:20,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270212174] [2024-10-14 05:12:20,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270212174] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:20,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:12:20,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 05:12:20,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706423124] [2024-10-14 05:12:20,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:20,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:12:20,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:20,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:12:20,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:12:20,189 INFO L87 Difference]: Start difference. First operand 14765 states and 21723 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 05:12:22,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:12:22,534 INFO L93 Difference]: Finished difference Result 21063 states and 29566 transitions. [2024-10-14 05:12:22,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 05:12:22,534 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 76 [2024-10-14 05:12:22,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:12:22,609 INFO L225 Difference]: With dead ends: 21063 [2024-10-14 05:12:22,609 INFO L226 Difference]: Without dead ends: 16826 [2024-10-14 05:12:22,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-10-14 05:12:22,630 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 658 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:12:22,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 959 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 05:12:22,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16826 states. [2024-10-14 05:12:24,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16826 to 16506. [2024-10-14 05:12:24,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16506 states, 13595 states have (on average 1.4288341301949246) internal successors, (19425), 13826 states have internal predecessors, (19425), 1591 states have call successors, (1591), 1071 states have call predecessors, (1591), 1318 states have return successors, (2842), 1646 states have call predecessors, (2842), 1590 states have call successors, (2842) [2024-10-14 05:12:24,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16506 states to 16506 states and 23858 transitions. [2024-10-14 05:12:24,788 INFO L78 Accepts]: Start accepts. Automaton has 16506 states and 23858 transitions. Word has length 76 [2024-10-14 05:12:24,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:12:24,789 INFO L471 AbstractCegarLoop]: Abstraction has 16506 states and 23858 transitions. [2024-10-14 05:12:24,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 05:12:24,789 INFO L276 IsEmpty]: Start isEmpty. Operand 16506 states and 23858 transitions. [2024-10-14 05:12:24,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-14 05:12:24,800 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:24,800 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:12:24,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 05:12:24,801 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:24,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:24,801 INFO L85 PathProgramCache]: Analyzing trace with hash -826737294, now seen corresponding path program 1 times [2024-10-14 05:12:24,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:24,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651363010] [2024-10-14 05:12:24,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:24,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:24,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:24,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:24,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:12:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:24,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:12:24,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:24,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:12:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:24,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:12:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:24,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:12:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:24,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:12:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:24,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 05:12:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:24,923 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 05:12:24,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:24,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651363010] [2024-10-14 05:12:24,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651363010] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:24,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:12:24,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 05:12:24,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126415760] [2024-10-14 05:12:24,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:24,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:12:24,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:24,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:12:24,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:12:24,925 INFO L87 Difference]: Start difference. First operand 16506 states and 23858 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 05:12:27,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:12:27,278 INFO L93 Difference]: Finished difference Result 20177 states and 28366 transitions. [2024-10-14 05:12:27,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-14 05:12:27,279 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 86 [2024-10-14 05:12:27,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:12:27,351 INFO L225 Difference]: With dead ends: 20177 [2024-10-14 05:12:27,352 INFO L226 Difference]: Without dead ends: 15997 [2024-10-14 05:12:27,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2024-10-14 05:12:27,377 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 1193 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1230 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 1400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 05:12:27,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1230 Valid, 983 Invalid, 1400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 05:12:27,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15997 states. [2024-10-14 05:12:28,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15997 to 15663. [2024-10-14 05:12:29,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15663 states, 12965 states have (on average 1.4350173544157347) internal successors, (18605), 13178 states have internal predecessors, (18605), 1492 states have call successors, (1492), 986 states have call predecessors, (1492), 1204 states have return successors, (2620), 1536 states have call predecessors, (2620), 1491 states have call successors, (2620) [2024-10-14 05:12:29,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15663 states to 15663 states and 22717 transitions. [2024-10-14 05:12:29,051 INFO L78 Accepts]: Start accepts. Automaton has 15663 states and 22717 transitions. Word has length 86 [2024-10-14 05:12:29,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:12:29,052 INFO L471 AbstractCegarLoop]: Abstraction has 15663 states and 22717 transitions. [2024-10-14 05:12:29,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 05:12:29,052 INFO L276 IsEmpty]: Start isEmpty. Operand 15663 states and 22717 transitions. [2024-10-14 05:12:29,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 05:12:29,077 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:29,078 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:12:29,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 05:12:29,078 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:29,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:29,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1337323179, now seen corresponding path program 1 times [2024-10-14 05:12:29,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:29,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665294421] [2024-10-14 05:12:29,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:29,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:29,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:29,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:29,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 05:12:29,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:29,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 05:12:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:29,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 05:12:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:29,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:12:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:29,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 05:12:29,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:29,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:12:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:29,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 05:12:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:29,193 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-14 05:12:29,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:29,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665294421] [2024-10-14 05:12:29,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665294421] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:12:29,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817155474] [2024-10-14 05:12:29,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:29,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:12:29,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:12:29,196 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:12:29,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 05:12:29,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:29,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 05:12:29,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:12:29,361 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-14 05:12:29,362 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:12:29,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817155474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:29,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:12:29,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-14 05:12:29,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014333676] [2024-10-14 05:12:29,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:29,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:12:29,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:29,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:12:29,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:12:29,364 INFO L87 Difference]: Start difference. First operand 15663 states and 22717 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:12:32,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:12:32,043 INFO L93 Difference]: Finished difference Result 38768 states and 58591 transitions. [2024-10-14 05:12:32,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:12:32,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 115 [2024-10-14 05:12:32,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:12:32,166 INFO L225 Difference]: With dead ends: 38768 [2024-10-14 05:12:32,166 INFO L226 Difference]: Without dead ends: 27057 [2024-10-14 05:12:32,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:12:32,217 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 285 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:12:32,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 477 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:12:32,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27057 states. [2024-10-14 05:12:35,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27057 to 26955. [2024-10-14 05:12:35,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26955 states, 22603 states have (on average 1.4548511259567314) internal successors, (32884), 22963 states have internal predecessors, (32884), 2458 states have call successors, (2458), 1578 states have call predecessors, (2458), 1892 states have return successors, (4455), 2451 states have call predecessors, (4455), 2457 states have call successors, (4455) [2024-10-14 05:12:35,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26955 states to 26955 states and 39797 transitions. [2024-10-14 05:12:35,148 INFO L78 Accepts]: Start accepts. Automaton has 26955 states and 39797 transitions. Word has length 115 [2024-10-14 05:12:35,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:12:35,149 INFO L471 AbstractCegarLoop]: Abstraction has 26955 states and 39797 transitions. [2024-10-14 05:12:35,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:12:35,149 INFO L276 IsEmpty]: Start isEmpty. Operand 26955 states and 39797 transitions. [2024-10-14 05:12:35,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 05:12:35,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:35,188 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:12:35,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 05:12:35,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-14 05:12:35,389 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:35,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:35,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1108002025, now seen corresponding path program 1 times [2024-10-14 05:12:35,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:35,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440959584] [2024-10-14 05:12:35,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:35,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:35,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:35,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:35,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:35,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 05:12:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:35,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 05:12:35,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:35,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 05:12:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:35,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:12:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:35,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 05:12:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:35,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:12:35,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:35,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 05:12:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:35,547 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-14 05:12:35,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:35,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440959584] [2024-10-14 05:12:35,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440959584] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:12:35,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880254966] [2024-10-14 05:12:35,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:35,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:12:35,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:12:35,551 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:12:35,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 05:12:35,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:35,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 05:12:35,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:12:35,801 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-14 05:12:35,802 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:12:35,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880254966] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:35,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:12:35,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-14 05:12:35,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804233859] [2024-10-14 05:12:35,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:35,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:12:35,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:35,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:12:35,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:12:35,804 INFO L87 Difference]: Start difference. First operand 26955 states and 39797 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 05:12:39,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:12:39,344 INFO L93 Difference]: Finished difference Result 71904 states and 108757 transitions. [2024-10-14 05:12:39,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:12:39,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 115 [2024-10-14 05:12:39,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:12:39,503 INFO L225 Difference]: With dead ends: 71904 [2024-10-14 05:12:39,504 INFO L226 Difference]: Without dead ends: 30912 [2024-10-14 05:12:39,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:12:39,597 INFO L432 NwaCegarLoop]: 478 mSDtfsCounter, 182 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:12:39,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 782 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:12:39,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30912 states. [2024-10-14 05:12:43,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30912 to 30912. [2024-10-14 05:12:43,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30912 states, 25989 states have (on average 1.4575397283466083) internal successors, (37880), 26381 states have internal predecessors, (37880), 2793 states have call successors, (2793), 1782 states have call predecessors, (2793), 2128 states have return successors, (5085), 2786 states have call predecessors, (5085), 2792 states have call successors, (5085) [2024-10-14 05:12:43,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30912 states to 30912 states and 45758 transitions. [2024-10-14 05:12:43,216 INFO L78 Accepts]: Start accepts. Automaton has 30912 states and 45758 transitions. Word has length 115 [2024-10-14 05:12:43,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:12:43,216 INFO L471 AbstractCegarLoop]: Abstraction has 30912 states and 45758 transitions. [2024-10-14 05:12:43,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 05:12:43,216 INFO L276 IsEmpty]: Start isEmpty. Operand 30912 states and 45758 transitions. [2024-10-14 05:12:43,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 05:12:43,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:12:43,249 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 05:12:43,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 05:12:43,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:12:43,454 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:12:43,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:12:43,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1385852961, now seen corresponding path program 1 times [2024-10-14 05:12:43,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:12:43,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699573516] [2024-10-14 05:12:43,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:43,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:12:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:43,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:12:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:43,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:12:43,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:43,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:12:43,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:43,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:12:43,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:43,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:12:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:43,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:12:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:43,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:12:43,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:43,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:12:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:43,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 05:12:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:43,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 05:12:43,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:43,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 05:12:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:43,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:12:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:43,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:12:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:43,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 05:12:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:43,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 05:12:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:43,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 05:12:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:43,606 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-10-14 05:12:43,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:12:43,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699573516] [2024-10-14 05:12:43,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699573516] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:12:43,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54278184] [2024-10-14 05:12:43,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:12:43,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:12:43,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:12:43,609 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:12:43,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 05:12:43,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:12:43,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 05:12:43,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:12:43,767 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 05:12:43,769 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:12:43,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54278184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:12:43,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:12:43,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2024-10-14 05:12:43,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390876275] [2024-10-14 05:12:43,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:12:43,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:12:43,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:12:43,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:12:43,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 05:12:43,772 INFO L87 Difference]: Start difference. First operand 30912 states and 45758 transitions. Second operand has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 05:12:46,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:12:46,605 INFO L93 Difference]: Finished difference Result 32759 states and 48011 transitions. [2024-10-14 05:12:46,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 05:12:46,605 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 131 [2024-10-14 05:12:46,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:12:46,709 INFO L225 Difference]: With dead ends: 32759 [2024-10-14 05:12:46,710 INFO L226 Difference]: Without dead ends: 28843 [2024-10-14 05:12:46,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 05:12:46,731 INFO L432 NwaCegarLoop]: 305 mSDtfsCounter, 0 mSDsluCounter, 1213 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1518 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:12:46,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1518 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:12:46,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28843 states.