./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.07.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.07.cil-1.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 b08ac6f553c71235d6c242059db3dcace1924bc9c3a272f401632c3f1b127664 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 22:59:05,485 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 22:59:05,564 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 22:59:05,570 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 22:59:05,570 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 22:59:05,621 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 22:59:05,621 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 22:59:05,622 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 22:59:05,622 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 22:59:05,622 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 22:59:05,622 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 22:59:05,623 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 22:59:05,623 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 22:59:05,623 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 22:59:05,623 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 22:59:05,624 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 22:59:05,624 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 22:59:05,624 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 22:59:05,627 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 22:59:05,627 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 22:59:05,628 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 22:59:05,628 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 22:59:05,628 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 22:59:05,629 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 22:59:05,632 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 22:59:05,632 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 22:59:05,632 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 22:59:05,633 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 22:59:05,633 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 22:59:05,633 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 22:59:05,633 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 22:59:05,633 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 22:59:05,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:59:05,634 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 22:59:05,634 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 22:59:05,634 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 22:59:05,634 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 22:59:05,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 22:59:05,634 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 22:59:05,634 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 22:59:05,635 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 22:59:05,636 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 22:59:05,636 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 -> b08ac6f553c71235d6c242059db3dcace1924bc9c3a272f401632c3f1b127664 [2024-11-11 22:59:05,840 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 22:59:05,873 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 22:59:05,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 22:59:05,879 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 22:59:05,880 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 22:59:05,880 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.07.cil-1.c [2024-11-11 22:59:07,432 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 22:59:07,631 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 22:59:07,632 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.07.cil-1.c [2024-11-11 22:59:07,648 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdf1f3e2e/38eb9cc3093e42d0a8795bf4ae5ccef4/FLAG14623b0d3 [2024-11-11 22:59:07,664 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdf1f3e2e/38eb9cc3093e42d0a8795bf4ae5ccef4 [2024-11-11 22:59:07,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 22:59:07,668 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 22:59:07,669 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 22:59:07,669 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 22:59:07,674 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 22:59:07,674 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:59:07" (1/1) ... [2024-11-11 22:59:07,675 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75bc5b4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:59:07, skipping insertion in model container [2024-11-11 22:59:07,676 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:59:07" (1/1) ... [2024-11-11 22:59:07,718 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 22:59:07,863 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.07.cil-1.c[911,924] [2024-11-11 22:59:07,909 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.07.cil-1.c[8416,8429] [2024-11-11 22:59:07,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:59:07,992 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 22:59:08,002 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.07.cil-1.c[911,924] [2024-11-11 22:59:08,034 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.07.cil-1.c[8416,8429] [2024-11-11 22:59:08,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:59:08,124 INFO L204 MainTranslator]: Completed translation [2024-11-11 22:59:08,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:59:08 WrapperNode [2024-11-11 22:59:08,125 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 22:59:08,127 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 22:59:08,127 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 22:59:08,127 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 22:59:08,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:59:08" (1/1) ... [2024-11-11 22:59:08,148 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:59:08" (1/1) ... [2024-11-11 22:59:08,242 INFO L138 Inliner]: procedures = 69, calls = 82, calls flagged for inlining = 38, calls inlined = 38, statements flattened = 806 [2024-11-11 22:59:08,242 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 22:59:08,243 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 22:59:08,243 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 22:59:08,243 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 22:59:08,280 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:59:08" (1/1) ... [2024-11-11 22:59:08,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:59:08" (1/1) ... [2024-11-11 22:59:08,297 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:59:08" (1/1) ... [2024-11-11 22:59:08,360 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 22:59:08,364 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:59:08" (1/1) ... [2024-11-11 22:59:08,364 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:59:08" (1/1) ... [2024-11-11 22:59:08,384 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:59:08" (1/1) ... [2024-11-11 22:59:08,400 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:59:08" (1/1) ... [2024-11-11 22:59:08,407 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:59:08" (1/1) ... [2024-11-11 22:59:08,413 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:59:08" (1/1) ... [2024-11-11 22:59:08,426 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 22:59:08,427 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 22:59:08,427 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 22:59:08,427 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 22:59:08,428 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:59:08" (1/1) ... [2024-11-11 22:59:08,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:59:08,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:59:08,470 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 22:59:08,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 22:59:08,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 22:59:08,509 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-11 22:59:08,510 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-11 22:59:08,510 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-11 22:59:08,510 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-11 22:59:08,510 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-11 22:59:08,510 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-11 22:59:08,510 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-11 22:59:08,510 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-11 22:59:08,511 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-11 22:59:08,511 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-11 22:59:08,511 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-11 22:59:08,511 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-11 22:59:08,511 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-11 22:59:08,511 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-11 22:59:08,511 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-11 22:59:08,512 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-11 22:59:08,512 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-11 22:59:08,512 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-11 22:59:08,512 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-11 22:59:08,512 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-11 22:59:08,512 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-11 22:59:08,512 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-11 22:59:08,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 22:59:08,513 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-11 22:59:08,513 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-11 22:59:08,513 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-11 22:59:08,513 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-11 22:59:08,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 22:59:08,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 22:59:08,513 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-11 22:59:08,513 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-11 22:59:08,615 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 22:59:08,618 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 22:59:09,111 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2024-11-11 22:59:09,112 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2024-11-11 22:59:09,204 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2024-11-11 22:59:09,205 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 22:59:09,220 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 22:59:09,221 INFO L316 CfgBuilder]: Removed 14 assume(true) statements. [2024-11-11 22:59:09,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:59:09 BoogieIcfgContainer [2024-11-11 22:59:09,221 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 22:59:09,222 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 22:59:09,223 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 22:59:09,225 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 22:59:09,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 10:59:07" (1/3) ... [2024-11-11 22:59:09,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ee9067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:59:09, skipping insertion in model container [2024-11-11 22:59:09,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:59:08" (2/3) ... [2024-11-11 22:59:09,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ee9067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:59:09, skipping insertion in model container [2024-11-11 22:59:09,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:59:09" (3/3) ... [2024-11-11 22:59:09,228 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.07.cil-1.c [2024-11-11 22:59:09,246 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 22:59:09,247 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-11 22:59:09,302 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 22:59:09,308 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;@4b7c0b88, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 22:59:09,308 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-11 22:59:09,314 INFO L276 IsEmpty]: Start isEmpty. Operand has 382 states, 328 states have (on average 1.5975609756097562) internal successors, (524), 334 states have internal predecessors, (524), 37 states have call successors, (37), 14 states have call predecessors, (37), 14 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-11 22:59:09,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 22:59:09,323 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:59:09,324 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:59:09,325 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:59:09,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:59:09,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1287402943, now seen corresponding path program 1 times [2024-11-11 22:59:09,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:59:09,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568721583] [2024-11-11 22:59:09,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:59:09,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:59:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:09,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:09,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:59:09,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:09,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:59:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:09,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:59:09,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:09,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:59:09,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:09,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:59:09,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:09,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:59:09,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:09,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:59:09,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:09,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568721583] [2024-11-11 22:59:09,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568721583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:09,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:09,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:59:09,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623141502] [2024-11-11 22:59:09,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:09,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:59:09,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:09,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:59:09,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:59:09,772 INFO L87 Difference]: Start difference. First operand has 382 states, 328 states have (on average 1.5975609756097562) internal successors, (524), 334 states have internal predecessors, (524), 37 states have call successors, (37), 14 states have call predecessors, (37), 14 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 22:59:10,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:59:10,414 INFO L93 Difference]: Finished difference Result 759 states and 1186 transitions. [2024-11-11 22:59:10,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 22:59:10,417 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-11-11 22:59:10,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:59:10,430 INFO L225 Difference]: With dead ends: 759 [2024-11-11 22:59:10,432 INFO L226 Difference]: Without dead ends: 390 [2024-11-11 22:59:10,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:59:10,443 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 594 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 1320 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:59:10,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 1320 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 22:59:10,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-11-11 22:59:10,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 372. [2024-11-11 22:59:10,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 320 states have (on average 1.509375) internal successors, (483), 324 states have internal predecessors, (483), 37 states have call successors, (37), 14 states have call predecessors, (37), 13 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-11 22:59:10,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 555 transitions. [2024-11-11 22:59:10,514 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 555 transitions. Word has length 65 [2024-11-11 22:59:10,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:59:10,514 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 555 transitions. [2024-11-11 22:59:10,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 22:59:10,515 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 555 transitions. [2024-11-11 22:59:10,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 22:59:10,518 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:59:10,518 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:59:10,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 22:59:10,519 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:59:10,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:59:10,520 INFO L85 PathProgramCache]: Analyzing trace with hash -99382467, now seen corresponding path program 1 times [2024-11-11 22:59:10,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:59:10,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887851483] [2024-11-11 22:59:10,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:59:10,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:59:10,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:10,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:10,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:10,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:59:10,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:10,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:59:10,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:10,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:59:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:10,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:59:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:10,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:59:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:10,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:59:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:10,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:59:10,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:10,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887851483] [2024-11-11 22:59:10,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887851483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:10,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:10,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 22:59:10,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069625845] [2024-11-11 22:59:10,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:10,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 22:59:10,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:10,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 22:59:10,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:59:10,726 INFO L87 Difference]: Start difference. First operand 372 states and 555 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 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-11-11 22:59:11,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:59:11,686 INFO L93 Difference]: Finished difference Result 627 states and 924 transitions. [2024-11-11 22:59:11,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:59:11,687 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2024-11-11 22:59:11,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:59:11,691 INFO L225 Difference]: With dead ends: 627 [2024-11-11 22:59:11,691 INFO L226 Difference]: Without dead ends: 523 [2024-11-11 22:59:11,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:59:11,693 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 722 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 1721 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 22:59:11,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 1721 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 22:59:11,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2024-11-11 22:59:11,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 484. [2024-11-11 22:59:11,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 410 states have (on average 1.4853658536585366) internal successors, (609), 416 states have internal predecessors, (609), 50 states have call successors, (50), 21 states have call predecessors, (50), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) [2024-11-11 22:59:11,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 712 transitions. [2024-11-11 22:59:11,727 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 712 transitions. Word has length 65 [2024-11-11 22:59:11,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:59:11,727 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 712 transitions. [2024-11-11 22:59:11,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 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-11-11 22:59:11,727 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 712 transitions. [2024-11-11 22:59:11,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 22:59:11,729 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:59:11,730 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:59:11,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 22:59:11,730 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:59:11,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:59:11,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1438957563, now seen corresponding path program 1 times [2024-11-11 22:59:11,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:59:11,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622840505] [2024-11-11 22:59:11,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:59:11,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:59:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:11,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:11,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:59:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:11,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:59:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:11,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:59:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:11,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:59:11,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:11,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:59:11,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:11,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:59:11,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:11,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:59:11,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:11,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622840505] [2024-11-11 22:59:11,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622840505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:11,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:11,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 22:59:11,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785815931] [2024-11-11 22:59:11,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:11,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 22:59:11,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:11,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 22:59:11,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:59:11,919 INFO L87 Difference]: Start difference. First operand 484 states and 712 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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-11-11 22:59:13,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:59:13,221 INFO L93 Difference]: Finished difference Result 881 states and 1277 transitions. [2024-11-11 22:59:13,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 22:59:13,226 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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 65 [2024-11-11 22:59:13,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:59:13,232 INFO L225 Difference]: With dead ends: 881 [2024-11-11 22:59:13,233 INFO L226 Difference]: Without dead ends: 672 [2024-11-11 22:59:13,235 INFO L434 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-11-11 22:59:13,235 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 1335 mSDsluCounter, 1316 mSDsCounter, 0 mSdLazyCounter, 1399 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1362 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 1558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:59:13,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1362 Valid, 1697 Invalid, 1558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1399 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 22:59:13,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2024-11-11 22:59:13,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 596. [2024-11-11 22:59:13,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 500 states have (on average 1.468) internal successors, (734), 508 states have internal predecessors, (734), 63 states have call successors, (63), 28 states have call predecessors, (63), 31 states have return successors, (74), 63 states have call predecessors, (74), 61 states have call successors, (74) [2024-11-11 22:59:13,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 871 transitions. [2024-11-11 22:59:13,293 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 871 transitions. Word has length 65 [2024-11-11 22:59:13,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:59:13,294 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 871 transitions. [2024-11-11 22:59:13,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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-11-11 22:59:13,294 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 871 transitions. [2024-11-11 22:59:13,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 22:59:13,297 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:59:13,297 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:59:13,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 22:59:13,297 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:59:13,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:59:13,298 INFO L85 PathProgramCache]: Analyzing trace with hash -589628547, now seen corresponding path program 1 times [2024-11-11 22:59:13,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:59:13,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109559372] [2024-11-11 22:59:13,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:59:13,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:59:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:13,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:13,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:59:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:13,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:59:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:13,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:59:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:13,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:59:13,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:13,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:59:13,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:13,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:59:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:13,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:59:13,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:13,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109559372] [2024-11-11 22:59:13,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109559372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:13,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:13,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:59:13,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136171348] [2024-11-11 22:59:13,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:13,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:59:13,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:13,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:59:13,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:59:13,462 INFO L87 Difference]: Start difference. First operand 596 states and 871 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-11 22:59:14,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:59:14,278 INFO L93 Difference]: Finished difference Result 1268 states and 1813 transitions. [2024-11-11 22:59:14,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 22:59:14,282 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2024-11-11 22:59:14,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:59:14,288 INFO L225 Difference]: With dead ends: 1268 [2024-11-11 22:59:14,288 INFO L226 Difference]: Without dead ends: 953 [2024-11-11 22:59:14,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-11 22:59:14,291 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 1185 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1227 SdHoareTripleChecker+Valid, 1560 SdHoareTripleChecker+Invalid, 1126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:59:14,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1227 Valid, 1560 Invalid, 1126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 22:59:14,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2024-11-11 22:59:14,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 877. [2024-11-11 22:59:14,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 726 states have (on average 1.4338842975206612) internal successors, (1041), 738 states have internal predecessors, (1041), 93 states have call successors, (93), 49 states have call predecessors, (93), 56 states have return successors, (112), 93 states have call predecessors, (112), 91 states have call successors, (112) [2024-11-11 22:59:14,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1246 transitions. [2024-11-11 22:59:14,351 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1246 transitions. Word has length 65 [2024-11-11 22:59:14,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:59:14,351 INFO L471 AbstractCegarLoop]: Abstraction has 877 states and 1246 transitions. [2024-11-11 22:59:14,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-11 22:59:14,352 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1246 transitions. [2024-11-11 22:59:14,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-11 22:59:14,354 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:59:14,354 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:59:14,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 22:59:14,354 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:59:14,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:59:14,355 INFO L85 PathProgramCache]: Analyzing trace with hash 540062596, now seen corresponding path program 1 times [2024-11-11 22:59:14,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:59:14,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159237477] [2024-11-11 22:59:14,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:59:14,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:59:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:14,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:14,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:59:14,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:14,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:59:14,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:14,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:59:14,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:14,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 22:59:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:14,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 22:59:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:14,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 22:59:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:14,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:59:14,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:14,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159237477] [2024-11-11 22:59:14,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159237477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:14,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:14,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:59:14,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577578753] [2024-11-11 22:59:14,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:14,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:59:14,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:14,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:59:14,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:59:14,480 INFO L87 Difference]: Start difference. First operand 877 states and 1246 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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-11-11 22:59:15,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:59:15,301 INFO L93 Difference]: Finished difference Result 1581 states and 2230 transitions. [2024-11-11 22:59:15,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 22:59:15,302 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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 66 [2024-11-11 22:59:15,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:59:15,307 INFO L225 Difference]: With dead ends: 1581 [2024-11-11 22:59:15,307 INFO L226 Difference]: Without dead ends: 985 [2024-11-11 22:59:15,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:59:15,310 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 693 mSDsluCounter, 1657 mSDsCounter, 0 mSdLazyCounter, 1471 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 1985 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:59:15,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 1985 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1471 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 22:59:15,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2024-11-11 22:59:15,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 907. [2024-11-11 22:59:15,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 750 states have (on average 1.42) internal successors, (1065), 762 states have internal predecessors, (1065), 93 states have call successors, (93), 49 states have call predecessors, (93), 62 states have return successors, (118), 99 states have call predecessors, (118), 91 states have call successors, (118) [2024-11-11 22:59:15,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1276 transitions. [2024-11-11 22:59:15,360 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1276 transitions. Word has length 66 [2024-11-11 22:59:15,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:59:15,361 INFO L471 AbstractCegarLoop]: Abstraction has 907 states and 1276 transitions. [2024-11-11 22:59:15,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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-11-11 22:59:15,361 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1276 transitions. [2024-11-11 22:59:15,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-11 22:59:15,363 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:59:15,363 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:59:15,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 22:59:15,363 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:59:15,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:59:15,364 INFO L85 PathProgramCache]: Analyzing trace with hash -846140798, now seen corresponding path program 1 times [2024-11-11 22:59:15,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:59:15,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650117777] [2024-11-11 22:59:15,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:59:15,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:59:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:15,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:15,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:59:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:15,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:59:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:15,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:59:15,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:15,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 22:59:15,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:15,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 22:59:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:15,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 22:59:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:15,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:59:15,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:15,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650117777] [2024-11-11 22:59:15,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650117777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:15,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:15,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:59:15,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48988239] [2024-11-11 22:59:15,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:15,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:59:15,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:15,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:59:15,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:59:15,514 INFO L87 Difference]: Start difference. First operand 907 states and 1276 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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-11-11 22:59:16,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:59:16,386 INFO L93 Difference]: Finished difference Result 1611 states and 2242 transitions. [2024-11-11 22:59:16,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:59:16,387 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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 66 [2024-11-11 22:59:16,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:59:16,393 INFO L225 Difference]: With dead ends: 1611 [2024-11-11 22:59:16,394 INFO L226 Difference]: Without dead ends: 985 [2024-11-11 22:59:16,396 INFO L434 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-11-11 22:59:16,398 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 464 mSDsluCounter, 1909 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 2237 SdHoareTripleChecker+Invalid, 1606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:59:16,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 2237 Invalid, 1606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1525 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 22:59:16,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2024-11-11 22:59:16,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 922. [2024-11-11 22:59:16,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 762 states have (on average 1.4094488188976377) internal successors, (1074), 774 states have internal predecessors, (1074), 93 states have call successors, (93), 49 states have call predecessors, (93), 65 states have return successors, (121), 102 states have call predecessors, (121), 91 states have call successors, (121) [2024-11-11 22:59:16,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1288 transitions. [2024-11-11 22:59:16,466 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1288 transitions. Word has length 66 [2024-11-11 22:59:16,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:59:16,467 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1288 transitions. [2024-11-11 22:59:16,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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-11-11 22:59:16,469 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1288 transitions. [2024-11-11 22:59:16,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-11 22:59:16,471 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:59:16,471 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:59:16,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 22:59:16,471 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:59:16,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:59:16,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1875500096, now seen corresponding path program 1 times [2024-11-11 22:59:16,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:59:16,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251723565] [2024-11-11 22:59:16,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:59:16,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:59:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:16,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:16,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:59:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:16,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:59:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:16,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:59:16,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:16,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 22:59:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:16,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 22:59:16,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:16,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 22:59:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:16,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:59:16,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:16,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251723565] [2024-11-11 22:59:16,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251723565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:16,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:16,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:59:16,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740875074] [2024-11-11 22:59:16,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:16,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:59:16,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:16,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:59:16,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:59:16,653 INFO L87 Difference]: Start difference. First operand 922 states and 1288 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-11 22:59:18,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:59:18,627 INFO L93 Difference]: Finished difference Result 3254 states and 4577 transitions. [2024-11-11 22:59:18,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-11 22:59:18,628 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2024-11-11 22:59:18,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:59:18,633 INFO L225 Difference]: With dead ends: 3254 [2024-11-11 22:59:18,634 INFO L226 Difference]: Without dead ends: 1308 [2024-11-11 22:59:18,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2024-11-11 22:59:18,640 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 2320 mSDsluCounter, 1434 mSDsCounter, 0 mSdLazyCounter, 1859 mSolverCounterSat, 419 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2338 SdHoareTripleChecker+Valid, 1922 SdHoareTripleChecker+Invalid, 2278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 419 IncrementalHoareTripleChecker+Valid, 1859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:59:18,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2338 Valid, 1922 Invalid, 2278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [419 Valid, 1859 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-11 22:59:18,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2024-11-11 22:59:18,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1145. [2024-11-11 22:59:18,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 926 states have (on average 1.3714902807775378) internal successors, (1270), 942 states have internal predecessors, (1270), 123 states have call successors, (123), 70 states have call predecessors, (123), 94 states have return successors, (173), 136 states have call predecessors, (173), 121 states have call successors, (173) [2024-11-11 22:59:18,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1566 transitions. [2024-11-11 22:59:18,726 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1566 transitions. Word has length 66 [2024-11-11 22:59:18,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:59:18,727 INFO L471 AbstractCegarLoop]: Abstraction has 1145 states and 1566 transitions. [2024-11-11 22:59:18,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-11 22:59:18,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1566 transitions. [2024-11-11 22:59:18,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-11 22:59:18,729 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:59:18,729 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:59:18,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 22:59:18,729 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:59:18,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:59:18,731 INFO L85 PathProgramCache]: Analyzing trace with hash 861065812, now seen corresponding path program 1 times [2024-11-11 22:59:18,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:59:18,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975224191] [2024-11-11 22:59:18,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:59:18,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:59:18,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:18,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:18,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:59:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:18,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:59:18,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:18,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:59:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:18,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 22:59:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:18,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-11 22:59:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:18,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 22:59:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:18,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:59:18,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:18,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975224191] [2024-11-11 22:59:18,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975224191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:18,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:18,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:59:18,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532949263] [2024-11-11 22:59:18,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:18,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:59:18,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:18,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:59:18,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:59:18,838 INFO L87 Difference]: Start difference. First operand 1145 states and 1566 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-11 22:59:19,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:59:19,628 INFO L93 Difference]: Finished difference Result 2330 states and 3208 transitions. [2024-11-11 22:59:19,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 22:59:19,629 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 67 [2024-11-11 22:59:19,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:59:19,631 INFO L225 Difference]: With dead ends: 2330 [2024-11-11 22:59:19,631 INFO L226 Difference]: Without dead ends: 261 [2024-11-11 22:59:19,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2024-11-11 22:59:19,636 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 1757 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1803 SdHoareTripleChecker+Valid, 1337 SdHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:59:19,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1803 Valid, 1337 Invalid, 1268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 22:59:19,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-11 22:59:19,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2024-11-11 22:59:19,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 233 states have (on average 1.5321888412017168) internal successors, (357), 234 states have internal predecessors, (357), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-11 22:59:19,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 399 transitions. [2024-11-11 22:59:19,646 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 399 transitions. Word has length 67 [2024-11-11 22:59:19,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:59:19,646 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 399 transitions. [2024-11-11 22:59:19,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-11 22:59:19,646 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 399 transitions. [2024-11-11 22:59:19,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-11 22:59:19,647 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:59:19,648 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:59:19,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 22:59:19,648 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:59:19,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:59:19,648 INFO L85 PathProgramCache]: Analyzing trace with hash -284079470, now seen corresponding path program 1 times [2024-11-11 22:59:19,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:59:19,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367494629] [2024-11-11 22:59:19,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:59:19,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:59:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:19,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:19,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:19,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:59:19,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:19,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 22:59:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:19,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:59:19,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:19,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 22:59:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:19,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:59:19,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:19,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367494629] [2024-11-11 22:59:19,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367494629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:19,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:19,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:59:19,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656537453] [2024-11-11 22:59:19,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:19,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:59:19,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:19,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:59:19,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:59:19,759 INFO L87 Difference]: Start difference. First operand 261 states and 399 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:20,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:59:20,512 INFO L93 Difference]: Finished difference Result 602 states and 939 transitions. [2024-11-11 22:59:20,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 22:59:20,513 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 123 [2024-11-11 22:59:20,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:59:20,515 INFO L225 Difference]: With dead ends: 602 [2024-11-11 22:59:20,515 INFO L226 Difference]: Without dead ends: 348 [2024-11-11 22:59:20,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:59:20,517 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 667 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:59:20,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 520 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 22:59:20,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-11-11 22:59:20,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 261. [2024-11-11 22:59:20,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 233 states have (on average 1.5278969957081545) internal successors, (356), 234 states have internal predecessors, (356), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-11 22:59:20,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 398 transitions. [2024-11-11 22:59:20,530 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 398 transitions. Word has length 123 [2024-11-11 22:59:20,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:59:20,531 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 398 transitions. [2024-11-11 22:59:20,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:20,531 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 398 transitions. [2024-11-11 22:59:20,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-11 22:59:20,532 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:59:20,532 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:59:20,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 22:59:20,532 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:59:20,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:59:20,532 INFO L85 PathProgramCache]: Analyzing trace with hash 2081955600, now seen corresponding path program 1 times [2024-11-11 22:59:20,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:59:20,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836181509] [2024-11-11 22:59:20,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:59:20,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:59:20,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:20,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:20,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:20,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:59:20,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:20,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 22:59:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:20,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:59:20,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:20,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 22:59:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:20,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:59:20,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:20,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836181509] [2024-11-11 22:59:20,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836181509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:20,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:20,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:59:20,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031396474] [2024-11-11 22:59:20,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:20,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:59:20,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:20,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:59:20,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:59:20,755 INFO L87 Difference]: Start difference. First operand 261 states and 398 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:22,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:59:22,254 INFO L93 Difference]: Finished difference Result 933 states and 1461 transitions. [2024-11-11 22:59:22,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:59:22,255 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 4 states have internal predecessors, (113), 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 123 [2024-11-11 22:59:22,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:59:22,262 INFO L225 Difference]: With dead ends: 933 [2024-11-11 22:59:22,262 INFO L226 Difference]: Without dead ends: 688 [2024-11-11 22:59:22,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:59:22,263 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 994 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1425 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1008 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 1513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:59:22,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1008 Valid, 886 Invalid, 1513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1425 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 22:59:22,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2024-11-11 22:59:22,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 515. [2024-11-11 22:59:22,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 464 states have (on average 1.540948275862069) internal successors, (715), 466 states have internal predecessors, (715), 37 states have call successors, (37), 12 states have call predecessors, (37), 13 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2024-11-11 22:59:22,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 792 transitions. [2024-11-11 22:59:22,340 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 792 transitions. Word has length 123 [2024-11-11 22:59:22,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:59:22,341 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 792 transitions. [2024-11-11 22:59:22,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:22,344 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 792 transitions. [2024-11-11 22:59:22,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-11 22:59:22,347 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:59:22,348 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:59:22,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 22:59:22,348 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:59:22,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:59:22,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1356391572, now seen corresponding path program 1 times [2024-11-11 22:59:22,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:59:22,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413130601] [2024-11-11 22:59:22,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:59:22,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:59:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:22,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:22,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:22,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:59:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:22,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 22:59:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:22,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:59:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:22,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 22:59:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:22,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:59:22,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:22,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413130601] [2024-11-11 22:59:22,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413130601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:22,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:22,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:59:22,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379243742] [2024-11-11 22:59:22,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:22,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:59:22,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:22,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:59:22,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:59:22,557 INFO L87 Difference]: Start difference. First operand 515 states and 792 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:24,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:59:24,272 INFO L93 Difference]: Finished difference Result 1537 states and 2406 transitions. [2024-11-11 22:59:24,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:59:24,273 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2024-11-11 22:59:24,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:59:24,277 INFO L225 Difference]: With dead ends: 1537 [2024-11-11 22:59:24,277 INFO L226 Difference]: Without dead ends: 1038 [2024-11-11 22:59:24,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:59:24,278 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 1007 mSDsluCounter, 1308 mSDsCounter, 0 mSdLazyCounter, 2275 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1021 SdHoareTripleChecker+Valid, 1696 SdHoareTripleChecker+Invalid, 2326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 22:59:24,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1021 Valid, 1696 Invalid, 2326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2275 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 22:59:24,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2024-11-11 22:59:24,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 752. [2024-11-11 22:59:24,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 678 states have (on average 1.5339233038348083) internal successors, (1040), 681 states have internal predecessors, (1040), 53 states have call successors, (53), 18 states have call predecessors, (53), 20 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2024-11-11 22:59:24,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1151 transitions. [2024-11-11 22:59:24,311 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1151 transitions. Word has length 123 [2024-11-11 22:59:24,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:59:24,311 INFO L471 AbstractCegarLoop]: Abstraction has 752 states and 1151 transitions. [2024-11-11 22:59:24,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:24,311 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1151 transitions. [2024-11-11 22:59:24,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-11 22:59:24,313 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:59:24,314 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:59:24,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 22:59:24,314 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:59:24,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:59:24,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1549281710, now seen corresponding path program 1 times [2024-11-11 22:59:24,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:59:24,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910529323] [2024-11-11 22:59:24,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:59:24,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:59:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:24,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:24,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:59:24,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:24,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 22:59:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:24,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:59:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:24,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 22:59:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:24,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:59:24,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:24,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910529323] [2024-11-11 22:59:24,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910529323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:24,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:24,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:59:24,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108464339] [2024-11-11 22:59:24,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:24,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:59:24,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:24,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:59:24,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:59:24,474 INFO L87 Difference]: Start difference. First operand 752 states and 1151 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:26,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:59:26,288 INFO L93 Difference]: Finished difference Result 2427 states and 3789 transitions. [2024-11-11 22:59:26,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:59:26,289 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2024-11-11 22:59:26,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:59:26,295 INFO L225 Difference]: With dead ends: 2427 [2024-11-11 22:59:26,295 INFO L226 Difference]: Without dead ends: 1691 [2024-11-11 22:59:26,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:59:26,297 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 1005 mSDsluCounter, 1308 mSDsCounter, 0 mSdLazyCounter, 2271 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 1694 SdHoareTripleChecker+Invalid, 2324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:59:26,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 1694 Invalid, 2324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2271 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 22:59:26,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2024-11-11 22:59:26,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1227. [2024-11-11 22:59:26,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1227 states, 1107 states have (on average 1.5275519421860886) internal successors, (1691), 1112 states have internal predecessors, (1691), 85 states have call successors, (85), 30 states have call predecessors, (85), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-11-11 22:59:26,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 1874 transitions. [2024-11-11 22:59:26,351 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 1874 transitions. Word has length 123 [2024-11-11 22:59:26,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:59:26,351 INFO L471 AbstractCegarLoop]: Abstraction has 1227 states and 1874 transitions. [2024-11-11 22:59:26,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:26,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 1874 transitions. [2024-11-11 22:59:26,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-11 22:59:26,352 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:59:26,352 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:59:26,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 22:59:26,353 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:59:26,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:59:26,353 INFO L85 PathProgramCache]: Analyzing trace with hash 712291540, now seen corresponding path program 1 times [2024-11-11 22:59:26,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:59:26,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24681753] [2024-11-11 22:59:26,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:59:26,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:59:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:26,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:26,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:26,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:59:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:26,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 22:59:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:26,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:59:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:26,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 22:59:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:26,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:59:26,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:26,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24681753] [2024-11-11 22:59:26,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24681753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:26,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:26,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:59:26,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696717880] [2024-11-11 22:59:26,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:26,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:59:26,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:26,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:59:26,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:59:26,517 INFO L87 Difference]: Start difference. First operand 1227 states and 1874 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:28,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:59:28,511 INFO L93 Difference]: Finished difference Result 4142 states and 6440 transitions. [2024-11-11 22:59:28,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:59:28,512 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2024-11-11 22:59:28,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:59:28,524 INFO L225 Difference]: With dead ends: 4142 [2024-11-11 22:59:28,525 INFO L226 Difference]: Without dead ends: 2931 [2024-11-11 22:59:28,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:59:28,530 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 1007 mSDsluCounter, 1308 mSDsCounter, 0 mSdLazyCounter, 2257 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1021 SdHoareTripleChecker+Valid, 1694 SdHoareTripleChecker+Invalid, 2310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:59:28,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1021 Valid, 1694 Invalid, 2310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2257 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-11 22:59:28,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2931 states. [2024-11-11 22:59:28,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2931 to 2178. [2024-11-11 22:59:28,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2178 states, 1966 states have (on average 1.522380467955239) internal successors, (2993), 1975 states have internal predecessors, (2993), 149 states have call successors, (149), 54 states have call predecessors, (149), 62 states have return successors, (184), 156 states have call predecessors, (184), 149 states have call successors, (184) [2024-11-11 22:59:28,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2178 states to 2178 states and 3326 transitions. [2024-11-11 22:59:28,678 INFO L78 Accepts]: Start accepts. Automaton has 2178 states and 3326 transitions. Word has length 123 [2024-11-11 22:59:28,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:59:28,678 INFO L471 AbstractCegarLoop]: Abstraction has 2178 states and 3326 transitions. [2024-11-11 22:59:28,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:28,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2178 states and 3326 transitions. [2024-11-11 22:59:28,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-11 22:59:28,680 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:59:28,680 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:59:28,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 22:59:28,680 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:59:28,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:59:28,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1154417134, now seen corresponding path program 1 times [2024-11-11 22:59:28,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:59:28,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690869383] [2024-11-11 22:59:28,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:59:28,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:59:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:28,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:28,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:28,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:59:28,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:28,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 22:59:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:28,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:59:28,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:28,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 22:59:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:28,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:59:28,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:28,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690869383] [2024-11-11 22:59:28,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690869383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:28,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:28,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:59:28,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358037209] [2024-11-11 22:59:28,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:28,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:59:28,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:28,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:59:28,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:59:28,828 INFO L87 Difference]: Start difference. First operand 2178 states and 3326 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:29,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:59:29,731 INFO L93 Difference]: Finished difference Result 5098 states and 7927 transitions. [2024-11-11 22:59:29,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:59:29,731 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2024-11-11 22:59:29,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:59:29,739 INFO L225 Difference]: With dead ends: 5098 [2024-11-11 22:59:29,740 INFO L226 Difference]: Without dead ends: 2936 [2024-11-11 22:59:29,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:59:29,743 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 844 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:59:29,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 716 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 22:59:29,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2024-11-11 22:59:29,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 2178. [2024-11-11 22:59:29,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2178 states, 1966 states have (on average 1.5178026449643947) internal successors, (2984), 1975 states have internal predecessors, (2984), 149 states have call successors, (149), 54 states have call predecessors, (149), 62 states have return successors, (184), 156 states have call predecessors, (184), 149 states have call successors, (184) [2024-11-11 22:59:29,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2178 states to 2178 states and 3317 transitions. [2024-11-11 22:59:29,839 INFO L78 Accepts]: Start accepts. Automaton has 2178 states and 3317 transitions. Word has length 123 [2024-11-11 22:59:29,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:59:29,839 INFO L471 AbstractCegarLoop]: Abstraction has 2178 states and 3317 transitions. [2024-11-11 22:59:29,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:29,839 INFO L276 IsEmpty]: Start isEmpty. Operand 2178 states and 3317 transitions. [2024-11-11 22:59:29,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-11 22:59:29,840 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:59:29,841 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:59:29,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 22:59:29,841 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:59:29,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:59:29,841 INFO L85 PathProgramCache]: Analyzing trace with hash 743079632, now seen corresponding path program 1 times [2024-11-11 22:59:29,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:59:29,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123528684] [2024-11-11 22:59:29,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:59:29,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:59:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:29,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:29,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:59:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:29,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 22:59:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:29,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:59:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:29,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 22:59:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:29,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:59:29,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:29,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123528684] [2024-11-11 22:59:29,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123528684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:29,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:29,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:59:29,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887453426] [2024-11-11 22:59:29,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:29,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:59:29,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:29,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:59:29,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:59:29,977 INFO L87 Difference]: Start difference. First operand 2178 states and 3317 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:30,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:59:30,850 INFO L93 Difference]: Finished difference Result 5088 states and 7880 transitions. [2024-11-11 22:59:30,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:59:30,851 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2024-11-11 22:59:30,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:59:30,863 INFO L225 Difference]: With dead ends: 5088 [2024-11-11 22:59:30,863 INFO L226 Difference]: Without dead ends: 2926 [2024-11-11 22:59:30,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:59:30,870 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 880 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:59:30,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [895 Valid, 715 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 22:59:30,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2024-11-11 22:59:30,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 2178. [2024-11-11 22:59:30,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2178 states, 1966 states have (on average 1.5132248219735505) internal successors, (2975), 1975 states have internal predecessors, (2975), 149 states have call successors, (149), 54 states have call predecessors, (149), 62 states have return successors, (184), 156 states have call predecessors, (184), 149 states have call successors, (184) [2024-11-11 22:59:30,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2178 states to 2178 states and 3308 transitions. [2024-11-11 22:59:30,990 INFO L78 Accepts]: Start accepts. Automaton has 2178 states and 3308 transitions. Word has length 123 [2024-11-11 22:59:30,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:59:30,990 INFO L471 AbstractCegarLoop]: Abstraction has 2178 states and 3308 transitions. [2024-11-11 22:59:30,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:30,991 INFO L276 IsEmpty]: Start isEmpty. Operand 2178 states and 3308 transitions. [2024-11-11 22:59:30,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-11 22:59:30,992 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:59:30,992 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:59:30,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 22:59:30,992 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:59:30,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:59:30,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1774120530, now seen corresponding path program 1 times [2024-11-11 22:59:30,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:59:30,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161729440] [2024-11-11 22:59:30,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:59:30,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:59:31,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:31,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:31,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:59:31,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:31,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 22:59:31,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:31,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:59:31,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:31,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 22:59:31,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:31,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:59:31,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:31,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161729440] [2024-11-11 22:59:31,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161729440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:31,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:31,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:59:31,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159269412] [2024-11-11 22:59:31,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:31,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:59:31,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:31,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:59:31,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:59:31,154 INFO L87 Difference]: Start difference. First operand 2178 states and 3308 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:32,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:59:32,260 INFO L93 Difference]: Finished difference Result 5078 states and 7833 transitions. [2024-11-11 22:59:32,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:59:32,260 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2024-11-11 22:59:32,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:59:32,272 INFO L225 Difference]: With dead ends: 5078 [2024-11-11 22:59:32,272 INFO L226 Difference]: Without dead ends: 2916 [2024-11-11 22:59:32,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:59:32,277 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 734 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 1163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 22:59:32,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 854 Invalid, 1163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 22:59:32,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2916 states. [2024-11-11 22:59:32,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2916 to 2178. [2024-11-11 22:59:32,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2178 states, 1966 states have (on average 1.508646998982706) internal successors, (2966), 1975 states have internal predecessors, (2966), 149 states have call successors, (149), 54 states have call predecessors, (149), 62 states have return successors, (184), 156 states have call predecessors, (184), 149 states have call successors, (184) [2024-11-11 22:59:32,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2178 states to 2178 states and 3299 transitions. [2024-11-11 22:59:32,439 INFO L78 Accepts]: Start accepts. Automaton has 2178 states and 3299 transitions. Word has length 123 [2024-11-11 22:59:32,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:59:32,439 INFO L471 AbstractCegarLoop]: Abstraction has 2178 states and 3299 transitions. [2024-11-11 22:59:32,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:32,439 INFO L276 IsEmpty]: Start isEmpty. Operand 2178 states and 3299 transitions. [2024-11-11 22:59:32,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-11 22:59:32,441 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:59:32,441 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:59:32,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 22:59:32,441 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:59:32,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:59:32,441 INFO L85 PathProgramCache]: Analyzing trace with hash -132282736, now seen corresponding path program 1 times [2024-11-11 22:59:32,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:59:32,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685435699] [2024-11-11 22:59:32,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:59:32,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:59:32,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:32,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:32,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:32,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:59:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:32,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 22:59:32,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:32,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:59:32,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:32,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 22:59:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:32,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:59:32,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:32,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685435699] [2024-11-11 22:59:32,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685435699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:32,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:32,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:59:32,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902089851] [2024-11-11 22:59:32,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:32,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:59:32,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:32,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:59:32,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:59:32,639 INFO L87 Difference]: Start difference. First operand 2178 states and 3299 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:35,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:59:35,332 INFO L93 Difference]: Finished difference Result 8390 states and 12852 transitions. [2024-11-11 22:59:35,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 22:59:35,333 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2024-11-11 22:59:35,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:59:35,352 INFO L225 Difference]: With dead ends: 8390 [2024-11-11 22:59:35,352 INFO L226 Difference]: Without dead ends: 6228 [2024-11-11 22:59:35,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:59:35,359 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 1055 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 2618 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1068 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 2673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-11 22:59:35,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1068 Valid, 1684 Invalid, 2673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2618 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-11 22:59:35,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6228 states. [2024-11-11 22:59:35,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6228 to 4097. [2024-11-11 22:59:35,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4097 states, 3709 states have (on average 1.505527096252359) internal successors, (5584), 3726 states have internal predecessors, (5584), 269 states have call successors, (269), 102 states have call predecessors, (269), 118 states have return successors, (366), 284 states have call predecessors, (366), 269 states have call successors, (366) [2024-11-11 22:59:35,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4097 states to 4097 states and 6219 transitions. [2024-11-11 22:59:35,642 INFO L78 Accepts]: Start accepts. Automaton has 4097 states and 6219 transitions. Word has length 123 [2024-11-11 22:59:35,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:59:35,643 INFO L471 AbstractCegarLoop]: Abstraction has 4097 states and 6219 transitions. [2024-11-11 22:59:35,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:35,643 INFO L276 IsEmpty]: Start isEmpty. Operand 4097 states and 6219 transitions. [2024-11-11 22:59:35,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-11 22:59:35,645 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:59:35,645 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:59:35,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 22:59:35,646 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:59:35,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:59:35,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1468788370, now seen corresponding path program 1 times [2024-11-11 22:59:35,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:59:35,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766066964] [2024-11-11 22:59:35,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:59:35,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:59:35,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:35,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:35,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:35,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:59:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:35,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 22:59:35,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:35,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:59:35,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:35,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 22:59:35,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:35,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:59:35,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:35,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766066964] [2024-11-11 22:59:35,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766066964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:35,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:35,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:59:35,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288772258] [2024-11-11 22:59:35,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:35,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:59:35,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:35,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:59:35,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:59:35,802 INFO L87 Difference]: Start difference. First operand 4097 states and 6219 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:38,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:59:38,241 INFO L93 Difference]: Finished difference Result 15847 states and 24314 transitions. [2024-11-11 22:59:38,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 22:59:38,244 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2024-11-11 22:59:38,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:59:38,284 INFO L225 Difference]: With dead ends: 15847 [2024-11-11 22:59:38,284 INFO L226 Difference]: Without dead ends: 11766 [2024-11-11 22:59:38,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:59:38,295 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 1232 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 2133 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1254 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 2189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:59:38,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1254 Valid, 1680 Invalid, 2189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2133 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 22:59:38,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11766 states. [2024-11-11 22:59:38,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11766 to 7838. [2024-11-11 22:59:38,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7838 states, 7106 states have (on average 1.5032367013791161) internal successors, (10682), 7139 states have internal predecessors, (10682), 501 states have call successors, (501), 198 states have call predecessors, (501), 230 states have return successors, (776), 532 states have call predecessors, (776), 501 states have call successors, (776) [2024-11-11 22:59:38,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7838 states to 7838 states and 11959 transitions. [2024-11-11 22:59:38,802 INFO L78 Accepts]: Start accepts. Automaton has 7838 states and 11959 transitions. Word has length 123 [2024-11-11 22:59:38,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:59:38,802 INFO L471 AbstractCegarLoop]: Abstraction has 7838 states and 11959 transitions. [2024-11-11 22:59:38,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:38,803 INFO L276 IsEmpty]: Start isEmpty. Operand 7838 states and 11959 transitions. [2024-11-11 22:59:38,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-11 22:59:38,806 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:59:38,806 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:59:38,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 22:59:38,807 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:59:38,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:59:38,807 INFO L85 PathProgramCache]: Analyzing trace with hash 412057168, now seen corresponding path program 1 times [2024-11-11 22:59:38,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:59:38,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207050239] [2024-11-11 22:59:38,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:59:38,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:59:38,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:38,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:38,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:59:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:38,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 22:59:38,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:38,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:59:38,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:38,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 22:59:38,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:38,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:59:38,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:38,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207050239] [2024-11-11 22:59:38,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207050239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:38,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:38,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:59:38,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450295858] [2024-11-11 22:59:38,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:38,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:59:38,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:38,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:59:38,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:59:38,988 INFO L87 Difference]: Start difference. First operand 7838 states and 11959 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:42,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:59:42,262 INFO L93 Difference]: Finished difference Result 30218 states and 46568 transitions. [2024-11-11 22:59:42,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 22:59:42,263 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2024-11-11 22:59:42,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:59:42,350 INFO L225 Difference]: With dead ends: 30218 [2024-11-11 22:59:42,350 INFO L226 Difference]: Without dead ends: 22396 [2024-11-11 22:59:42,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:59:42,371 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 1033 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 2502 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1046 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 2557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:59:42,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1046 Valid, 1684 Invalid, 2557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2502 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-11 22:59:42,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22396 states. [2024-11-11 22:59:43,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22396 to 15383. [2024-11-11 22:59:43,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15383 states, 13979 states have (on average 1.503684097574934) internal successors, (21020), 14044 states have internal predecessors, (21020), 949 states have call successors, (949), 390 states have call predecessors, (949), 454 states have return successors, (1742), 1012 states have call predecessors, (1742), 949 states have call successors, (1742) [2024-11-11 22:59:43,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15383 states to 15383 states and 23711 transitions. [2024-11-11 22:59:43,649 INFO L78 Accepts]: Start accepts. Automaton has 15383 states and 23711 transitions. Word has length 123 [2024-11-11 22:59:43,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:59:43,650 INFO L471 AbstractCegarLoop]: Abstraction has 15383 states and 23711 transitions. [2024-11-11 22:59:43,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:43,653 INFO L276 IsEmpty]: Start isEmpty. Operand 15383 states and 23711 transitions. [2024-11-11 22:59:43,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-11 22:59:43,669 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:59:43,669 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:59:43,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 22:59:43,670 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:59:43,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:59:43,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1763442386, now seen corresponding path program 1 times [2024-11-11 22:59:43,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:59:43,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872745643] [2024-11-11 22:59:43,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:59:43,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:59:43,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:43,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:43,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:59:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:43,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 22:59:43,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:43,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:59:43,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:43,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 22:59:43,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:43,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:59:43,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:43,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872745643] [2024-11-11 22:59:43,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872745643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:43,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:43,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:59:43,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804802784] [2024-11-11 22:59:43,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:43,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:59:43,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:43,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:59:43,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:59:43,804 INFO L87 Difference]: Start difference. First operand 15383 states and 23711 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:48,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:59:48,565 INFO L93 Difference]: Finished difference Result 58577 states and 91134 transitions. [2024-11-11 22:59:48,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 22:59:48,566 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2024-11-11 22:59:48,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:59:48,675 INFO L225 Difference]: With dead ends: 58577 [2024-11-11 22:59:48,675 INFO L226 Difference]: Without dead ends: 43210 [2024-11-11 22:59:48,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:59:48,710 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 1159 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 2103 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 2159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:59:48,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1181 Valid, 1684 Invalid, 2159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2103 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 22:59:48,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43210 states. [2024-11-11 22:59:51,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43210 to 30440. [2024-11-11 22:59:51,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30440 states, 27724 states have (on average 1.5050497763670465) internal successors, (41726), 27853 states have internal predecessors, (41726), 1813 states have call successors, (1813), 774 states have call predecessors, (1813), 902 states have return successors, (4128), 1940 states have call predecessors, (4128), 1813 states have call successors, (4128) [2024-11-11 22:59:51,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30440 states to 30440 states and 47667 transitions. [2024-11-11 22:59:51,409 INFO L78 Accepts]: Start accepts. Automaton has 30440 states and 47667 transitions. Word has length 123 [2024-11-11 22:59:51,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:59:51,409 INFO L471 AbstractCegarLoop]: Abstraction has 30440 states and 47667 transitions. [2024-11-11 22:59:51,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:51,410 INFO L276 IsEmpty]: Start isEmpty. Operand 30440 states and 47667 transitions. [2024-11-11 22:59:51,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-11 22:59:51,432 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:59:51,432 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:59:51,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 22:59:51,432 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:59:51,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:59:51,433 INFO L85 PathProgramCache]: Analyzing trace with hash 144467472, now seen corresponding path program 1 times [2024-11-11 22:59:51,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:59:51,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396240262] [2024-11-11 22:59:51,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:59:51,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:59:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:51,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:51,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:59:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:51,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 22:59:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:51,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:59:51,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:51,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 22:59:51,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:51,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:59:51,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:51,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396240262] [2024-11-11 22:59:51,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396240262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:51,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:51,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:59:51,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339367374] [2024-11-11 22:59:51,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:51,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:59:51,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:51,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:59:51,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:59:51,591 INFO L87 Difference]: Start difference. First operand 30440 states and 47667 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:55,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:59:55,165 INFO L93 Difference]: Finished difference Result 69190 states and 110382 transitions. [2024-11-11 22:59:55,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:59:55,166 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2024-11-11 22:59:55,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:59:55,277 INFO L225 Difference]: With dead ends: 69190 [2024-11-11 22:59:55,277 INFO L226 Difference]: Without dead ends: 38766 [2024-11-11 22:59:55,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:59:55,347 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 738 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 22:59:55,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 852 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 22:59:55,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38766 states. [2024-11-11 22:59:57,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38766 to 30440. [2024-11-11 22:59:57,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30440 states, 27724 states have (on average 1.5003967681431252) internal successors, (41597), 27853 states have internal predecessors, (41597), 1813 states have call successors, (1813), 774 states have call predecessors, (1813), 902 states have return successors, (4128), 1940 states have call predecessors, (4128), 1813 states have call successors, (4128) [2024-11-11 22:59:58,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30440 states to 30440 states and 47538 transitions. [2024-11-11 22:59:58,037 INFO L78 Accepts]: Start accepts. Automaton has 30440 states and 47538 transitions. Word has length 123 [2024-11-11 22:59:58,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:59:58,037 INFO L471 AbstractCegarLoop]: Abstraction has 30440 states and 47538 transitions. [2024-11-11 22:59:58,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:59:58,037 INFO L276 IsEmpty]: Start isEmpty. Operand 30440 states and 47538 transitions. [2024-11-11 22:59:58,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-11 22:59:58,054 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:59:58,055 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:59:58,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 22:59:58,055 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:59:58,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:59:58,055 INFO L85 PathProgramCache]: Analyzing trace with hash 115967182, now seen corresponding path program 1 times [2024-11-11 22:59:58,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:59:58,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854753738] [2024-11-11 22:59:58,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:59:58,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:59:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:58,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:59:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:58,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:59:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:58,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 22:59:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:58,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:59:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:58,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 22:59:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:59:58,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:59:58,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:59:58,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854753738] [2024-11-11 22:59:58,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854753738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:59:58,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:59:58,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:59:58,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297484315] [2024-11-11 22:59:58,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:59:58,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:59:58,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:59:58,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:59:58,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:59:58,198 INFO L87 Difference]: Start difference. First operand 30440 states and 47538 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 23:00:05,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:00:05,933 INFO L93 Difference]: Finished difference Result 110268 states and 174040 transitions. [2024-11-11 23:00:05,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 23:00:05,934 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2024-11-11 23:00:05,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:00:06,174 INFO L225 Difference]: With dead ends: 110268 [2024-11-11 23:00:06,174 INFO L226 Difference]: Without dead ends: 79844 [2024-11-11 23:00:06,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-11 23:00:06,247 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 1086 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 1790 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1108 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 1872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 23:00:06,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1108 Valid, 1098 Invalid, 1872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1790 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 23:00:06,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79844 states. [2024-11-11 23:00:11,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79844 to 60747. [2024-11-11 23:00:11,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60747 states, 55471 states have (on average 1.5022444160011537) internal successors, (83331), 55728 states have internal predecessors, (83331), 3477 states have call successors, (3477), 1542 states have call predecessors, (3477), 1798 states have return successors, (10294), 3732 states have call predecessors, (10294), 3477 states have call successors, (10294) [2024-11-11 23:00:11,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60747 states to 60747 states and 97102 transitions. [2024-11-11 23:00:11,470 INFO L78 Accepts]: Start accepts. Automaton has 60747 states and 97102 transitions. Word has length 123 [2024-11-11 23:00:11,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:00:11,471 INFO L471 AbstractCegarLoop]: Abstraction has 60747 states and 97102 transitions. [2024-11-11 23:00:11,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 23:00:11,471 INFO L276 IsEmpty]: Start isEmpty. Operand 60747 states and 97102 transitions. [2024-11-11 23:00:11,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-11 23:00:11,517 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:00:11,517 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:00:11,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 23:00:11,520 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:00:11,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:00:11,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1824614832, now seen corresponding path program 1 times [2024-11-11 23:00:11,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:00:11,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855334021] [2024-11-11 23:00:11,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:00:11,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:00:11,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:00:11,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 23:00:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:00:11,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 23:00:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:00:11,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 23:00:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:00:11,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 23:00:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:00:11,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 23:00:11,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:00:11,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:00:11,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:00:11,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855334021] [2024-11-11 23:00:11,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855334021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:00:11,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:00:11,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 23:00:11,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115424228] [2024-11-11 23:00:11,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:00:11,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 23:00:11,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:00:11,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 23:00:11,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 23:00:11,675 INFO L87 Difference]: Start difference. First operand 60747 states and 97102 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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)