./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.05.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.05.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8067f6f3f9b2e7af84aa5945c9ed2ea4ff7d9ddfc1aa86a10fb4bb83ea8bdef8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 21:46:19,171 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 21:46:19,252 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 21:46:19,261 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 21:46:19,262 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 21:46:19,287 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 21:46:19,287 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 21:46:19,288 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 21:46:19,289 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 21:46:19,290 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 21:46:19,291 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 21:46:19,291 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 21:46:19,292 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 21:46:19,292 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 21:46:19,292 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 21:46:19,294 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 21:46:19,295 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 21:46:19,295 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 21:46:19,295 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 21:46:19,295 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 21:46:19,295 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 21:46:19,298 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 21:46:19,299 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 21:46:19,299 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 21:46:19,299 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 21:46:19,299 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 21:46:19,299 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 21:46:19,300 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 21:46:19,300 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 21:46:19,300 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 21:46:19,300 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 21:46:19,301 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 21:46:19,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:46:19,301 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 21:46:19,301 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 21:46:19,301 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 21:46:19,302 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 21:46:19,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 21:46:19,302 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 21:46:19,302 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 21:46:19,303 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 21:46:19,304 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 21:46:19,304 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 -> 8067f6f3f9b2e7af84aa5945c9ed2ea4ff7d9ddfc1aa86a10fb4bb83ea8bdef8 [2024-10-12 21:46:19,576 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 21:46:19,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 21:46:19,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 21:46:19,605 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 21:46:19,606 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 21:46:19,607 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.05.cil-2.c [2024-10-12 21:46:21,076 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 21:46:21,305 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 21:46:21,306 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.05.cil-2.c [2024-10-12 21:46:21,322 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e2699c08/f808f6b3fb534e4693ecc0fb6f8ccc35/FLAG32c3ce62e [2024-10-12 21:46:21,650 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e2699c08/f808f6b3fb534e4693ecc0fb6f8ccc35 [2024-10-12 21:46:21,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 21:46:21,654 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 21:46:21,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 21:46:21,655 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 21:46:21,660 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 21:46:21,661 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:46:21" (1/1) ... [2024-10-12 21:46:21,662 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f449ade and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:46:21, skipping insertion in model container [2024-10-12 21:46:21,662 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:46:21" (1/1) ... [2024-10-12 21:46:21,711 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 21:46:21,917 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.05.cil-2.c[911,924] [2024-10-12 21:46:21,976 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.05.cil-2.c[8416,8429] [2024-10-12 21:46:22,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:46:22,052 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 21:46:22,063 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.05.cil-2.c[911,924] [2024-10-12 21:46:22,090 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.05.cil-2.c[8416,8429] [2024-10-12 21:46:22,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:46:22,161 INFO L204 MainTranslator]: Completed translation [2024-10-12 21:46:22,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:46:22 WrapperNode [2024-10-12 21:46:22,162 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 21:46:22,163 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 21:46:22,163 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 21:46:22,163 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 21:46:22,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:46:22" (1/1) ... [2024-10-12 21:46:22,191 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:46:22" (1/1) ... [2024-10-12 21:46:22,237 INFO L138 Inliner]: procedures = 65, calls = 77, calls flagged for inlining = 33, calls inlined = 33, statements flattened = 692 [2024-10-12 21:46:22,237 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 21:46:22,238 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 21:46:22,238 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 21:46:22,238 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 21:46:22,246 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:46:22" (1/1) ... [2024-10-12 21:46:22,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:46:22" (1/1) ... [2024-10-12 21:46:22,250 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:46:22" (1/1) ... [2024-10-12 21:46:22,272 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 21:46:22,273 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:46:22" (1/1) ... [2024-10-12 21:46:22,273 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:46:22" (1/1) ... [2024-10-12 21:46:22,283 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:46:22" (1/1) ... [2024-10-12 21:46:22,294 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:46:22" (1/1) ... [2024-10-12 21:46:22,296 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:46:22" (1/1) ... [2024-10-12 21:46:22,299 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:46:22" (1/1) ... [2024-10-12 21:46:22,303 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 21:46:22,304 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 21:46:22,304 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 21:46:22,304 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 21:46:22,305 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:46:22" (1/1) ... [2024-10-12 21:46:22,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:46:22,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:46:22,355 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 21:46:22,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 21:46:22,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 21:46:22,406 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 21:46:22,406 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 21:46:22,406 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-12 21:46:22,408 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-12 21:46:22,408 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-12 21:46:22,408 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-12 21:46:22,408 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-12 21:46:22,409 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-12 21:46:22,409 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-10-12 21:46:22,409 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-10-12 21:46:22,409 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-12 21:46:22,409 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-12 21:46:22,409 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-12 21:46:22,409 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-12 21:46:22,410 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-10-12 21:46:22,410 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-10-12 21:46:22,410 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-12 21:46:22,411 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-12 21:46:22,411 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-10-12 21:46:22,411 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-10-12 21:46:22,411 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-12 21:46:22,411 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-12 21:46:22,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 21:46:22,412 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-12 21:46:22,412 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-12 21:46:22,412 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-10-12 21:46:22,413 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-10-12 21:46:22,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 21:46:22,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 21:46:22,413 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-12 21:46:22,413 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-12 21:46:22,413 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-10-12 21:46:22,414 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-10-12 21:46:22,539 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 21:46:22,542 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 21:46:23,164 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2024-10-12 21:46:23,165 INFO L733 $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-10-12 21:46:23,303 INFO L? ?]: Removed 92 outVars from TransFormulas that were not future-live. [2024-10-12 21:46:23,303 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 21:46:23,383 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 21:46:23,385 INFO L314 CfgBuilder]: Removed 12 assume(true) statements. [2024-10-12 21:46:23,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:46:23 BoogieIcfgContainer [2024-10-12 21:46:23,386 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 21:46:23,388 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 21:46:23,388 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 21:46:23,392 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 21:46:23,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 09:46:21" (1/3) ... [2024-10-12 21:46:23,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224c4803 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:46:23, skipping insertion in model container [2024-10-12 21:46:23,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:46:22" (2/3) ... [2024-10-12 21:46:23,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224c4803 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:46:23, skipping insertion in model container [2024-10-12 21:46:23,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:46:23" (3/3) ... [2024-10-12 21:46:23,395 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.05.cil-2.c [2024-10-12 21:46:23,411 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 21:46:23,411 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 21:46:23,486 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 21:46:23,493 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;@5295a21f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 21:46:23,494 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 21:46:23,500 INFO L276 IsEmpty]: Start isEmpty. Operand has 299 states, 244 states have (on average 1.6844262295081966) internal successors, (411), 252 states have internal predecessors, (411), 37 states have call successors, (37), 15 states have call predecessors, (37), 15 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-12 21:46:23,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 21:46:23,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:46:23,514 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:46:23,515 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:46:23,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:46:23,521 INFO L85 PathProgramCache]: Analyzing trace with hash 2104991585, now seen corresponding path program 1 times [2024-10-12 21:46:23,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:46:23,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943854653] [2024-10-12 21:46:23,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:46:23,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:46:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:24,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:46:24,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:24,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:46:24,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:24,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:46:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:24,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:46:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:24,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:46:24,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:24,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:46:24,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:24,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:46:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:24,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:46:24,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:46:24,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943854653] [2024-10-12 21:46:24,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943854653] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:46:24,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:46:24,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 21:46:24,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242998559] [2024-10-12 21:46:24,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:46:24,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:46:24,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:46:24,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:46:24,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:46:24,214 INFO L87 Difference]: Start difference. First operand has 299 states, 244 states have (on average 1.6844262295081966) internal successors, (411), 252 states have internal predecessors, (411), 37 states have call successors, (37), 15 states have call predecessors, (37), 15 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 21:46:25,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:46:25,618 INFO L93 Difference]: Finished difference Result 717 states and 1161 transitions. [2024-10-12 21:46:25,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:46:25,621 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 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 57 [2024-10-12 21:46:25,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:46:25,634 INFO L225 Difference]: With dead ends: 717 [2024-10-12 21:46:25,634 INFO L226 Difference]: Without dead ends: 431 [2024-10-12 21:46:25,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:46:25,644 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 598 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 1316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:46:25,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 1488 Invalid, 1316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 21:46:25,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-10-12 21:46:25,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 394. [2024-10-12 21:46:25,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 320 states have (on average 1.55) internal successors, (496), 327 states have internal predecessors, (496), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) [2024-10-12 21:46:25,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 597 transitions. [2024-10-12 21:46:25,762 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 597 transitions. Word has length 57 [2024-10-12 21:46:25,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:46:25,763 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 597 transitions. [2024-10-12 21:46:25,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 21:46:25,764 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 597 transitions. [2024-10-12 21:46:25,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 21:46:25,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:46:25,769 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:46:25,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 21:46:25,770 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:46:25,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:46:25,772 INFO L85 PathProgramCache]: Analyzing trace with hash -261703009, now seen corresponding path program 1 times [2024-10-12 21:46:25,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:46:25,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086613853] [2024-10-12 21:46:25,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:46:25,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:46:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:25,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:46:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:25,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:46:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:25,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:46:25,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:25,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:46:25,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:25,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:46:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:25,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:46:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:25,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:46:25,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:25,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:46:25,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:46:25,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086613853] [2024-10-12 21:46:25,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086613853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:46:25,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:46:25,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 21:46:25,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239956333] [2024-10-12 21:46:25,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:46:26,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:46:26,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:46:26,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:46:26,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:46:26,010 INFO L87 Difference]: Start difference. First operand 394 states and 597 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 21:46:27,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:46:27,247 INFO L93 Difference]: Finished difference Result 755 states and 1127 transitions. [2024-10-12 21:46:27,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 21:46:27,248 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 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 57 [2024-10-12 21:46:27,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:46:27,253 INFO L225 Difference]: With dead ends: 755 [2024-10-12 21:46:27,253 INFO L226 Difference]: Without dead ends: 567 [2024-10-12 21:46:27,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-10-12 21:46:27,255 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 1069 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 1347 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1095 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 1505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 1347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:46:27,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1095 Valid, 1265 Invalid, 1505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 1347 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 21:46:27,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2024-10-12 21:46:27,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 495. [2024-10-12 21:46:27,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 399 states have (on average 1.531328320802005) internal successors, (611), 408 states have internal predecessors, (611), 63 states have call successors, (63), 29 states have call predecessors, (63), 31 states have return successors, (72), 61 states have call predecessors, (72), 59 states have call successors, (72) [2024-10-12 21:46:27,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 746 transitions. [2024-10-12 21:46:27,313 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 746 transitions. Word has length 57 [2024-10-12 21:46:27,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:46:27,314 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 746 transitions. [2024-10-12 21:46:27,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 21:46:27,314 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 746 transitions. [2024-10-12 21:46:27,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 21:46:27,321 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:46:27,321 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:46:27,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 21:46:27,321 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:46:27,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:46:27,322 INFO L85 PathProgramCache]: Analyzing trace with hash 631783329, now seen corresponding path program 1 times [2024-10-12 21:46:27,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:46:27,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962738458] [2024-10-12 21:46:27,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:46:27,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:46:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:27,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:46:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:27,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:46:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:27,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:46:27,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:27,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:46:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:27,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:46:27,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:27,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:46:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:27,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:46:27,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:27,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:46:27,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:46:27,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962738458] [2024-10-12 21:46:27,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962738458] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:46:27,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:46:27,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:46:27,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355241478] [2024-10-12 21:46:27,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:46:27,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:46:27,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:46:27,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:46:27,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:46:27,447 INFO L87 Difference]: Start difference. First operand 495 states and 746 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 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-10-12 21:46:28,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:46:28,405 INFO L93 Difference]: Finished difference Result 1101 states and 1622 transitions. [2024-10-12 21:46:28,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 21:46:28,405 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 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 57 [2024-10-12 21:46:28,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:46:28,410 INFO L225 Difference]: With dead ends: 1101 [2024-10-12 21:46:28,410 INFO L226 Difference]: Without dead ends: 818 [2024-10-12 21:46:28,411 INFO L431 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-10-12 21:46:28,413 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 958 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 997 SdHoareTripleChecker+Valid, 1143 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 21:46:28,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [997 Valid, 1143 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 21:46:28,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2024-10-12 21:46:28,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 747. [2024-10-12 21:46:28,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 596 states have (on average 1.4916107382550337) internal successors, (889), 609 states have internal predecessors, (889), 93 states have call successors, (93), 50 states have call predecessors, (93), 56 states have return successors, (110), 91 states have call predecessors, (110), 89 states have call successors, (110) [2024-10-12 21:46:28,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1092 transitions. [2024-10-12 21:46:28,499 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1092 transitions. Word has length 57 [2024-10-12 21:46:28,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:46:28,500 INFO L471 AbstractCegarLoop]: Abstraction has 747 states and 1092 transitions. [2024-10-12 21:46:28,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 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-10-12 21:46:28,500 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1092 transitions. [2024-10-12 21:46:28,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 21:46:28,505 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:46:28,505 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:46:28,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 21:46:28,506 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:46:28,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:46:28,506 INFO L85 PathProgramCache]: Analyzing trace with hash -323578664, now seen corresponding path program 1 times [2024-10-12 21:46:28,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:46:28,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372995415] [2024-10-12 21:46:28,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:46:28,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:46:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:28,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:46:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:28,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:46:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:28,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:46:28,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:28,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:46:28,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:28,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:46:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:28,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 21:46:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:28,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:46:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:28,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:46:28,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:46:28,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372995415] [2024-10-12 21:46:28,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372995415] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:46:28,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:46:28,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:46:28,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226120940] [2024-10-12 21:46:28,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:46:28,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:46:28,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:46:28,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:46:28,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:46:28,685 INFO L87 Difference]: Start difference. First operand 747 states and 1092 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 21:46:29,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:46:29,674 INFO L93 Difference]: Finished difference Result 1349 states and 1953 transitions. [2024-10-12 21:46:29,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:46:29,675 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2024-10-12 21:46:29,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:46:29,679 INFO L225 Difference]: With dead ends: 1349 [2024-10-12 21:46:29,679 INFO L226 Difference]: Without dead ends: 814 [2024-10-12 21:46:29,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-12 21:46:29,682 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 538 mSDsluCounter, 1211 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 1470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 21:46:29,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 1462 Invalid, 1470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1348 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 21:46:29,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2024-10-12 21:46:29,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 759. [2024-10-12 21:46:29,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 605 states have (on average 1.4793388429752066) internal successors, (895), 618 states have internal predecessors, (895), 93 states have call successors, (93), 50 states have call predecessors, (93), 59 states have return successors, (113), 94 states have call predecessors, (113), 89 states have call successors, (113) [2024-10-12 21:46:29,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1101 transitions. [2024-10-12 21:46:29,729 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1101 transitions. Word has length 58 [2024-10-12 21:46:29,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:46:29,730 INFO L471 AbstractCegarLoop]: Abstraction has 759 states and 1101 transitions. [2024-10-12 21:46:29,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 21:46:29,730 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1101 transitions. [2024-10-12 21:46:29,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 21:46:29,732 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:46:29,732 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:46:29,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 21:46:29,732 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:46:29,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:46:29,733 INFO L85 PathProgramCache]: Analyzing trace with hash -395965222, now seen corresponding path program 1 times [2024-10-12 21:46:29,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:46:29,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84195300] [2024-10-12 21:46:29,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:46:29,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:46:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:29,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:46:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:29,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:46:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:29,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:46:29,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:29,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:46:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:29,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:46:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:29,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 21:46:29,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:29,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:46:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:29,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:46:29,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:46:29,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84195300] [2024-10-12 21:46:29,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84195300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:46:29,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:46:29,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:46:29,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504414565] [2024-10-12 21:46:29,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:46:29,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:46:29,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:46:29,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:46:29,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:46:29,881 INFO L87 Difference]: Start difference. First operand 759 states and 1101 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 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-10-12 21:46:31,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:46:31,955 INFO L93 Difference]: Finished difference Result 2758 states and 4016 transitions. [2024-10-12 21:46:31,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-12 21:46:31,956 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 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 58 [2024-10-12 21:46:31,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:46:31,962 INFO L225 Difference]: With dead ends: 2758 [2024-10-12 21:46:31,962 INFO L226 Difference]: Without dead ends: 1092 [2024-10-12 21:46:31,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2024-10-12 21:46:31,972 INFO L432 NwaCegarLoop]: 389 mSDtfsCounter, 1839 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 1957 mSolverCounterSat, 392 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1856 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 2349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 392 IncrementalHoareTripleChecker+Valid, 1957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:46:31,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1856 Valid, 1533 Invalid, 2349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [392 Valid, 1957 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 21:46:31,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2024-10-12 21:46:32,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 962. [2024-10-12 21:46:32,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 752 states have (on average 1.428191489361702) internal successors, (1074), 769 states have internal predecessors, (1074), 123 states have call successors, (123), 71 states have call predecessors, (123), 85 states have return successors, (162), 125 states have call predecessors, (162), 119 states have call successors, (162) [2024-10-12 21:46:32,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1359 transitions. [2024-10-12 21:46:32,044 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1359 transitions. Word has length 58 [2024-10-12 21:46:32,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:46:32,045 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1359 transitions. [2024-10-12 21:46:32,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 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-10-12 21:46:32,045 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1359 transitions. [2024-10-12 21:46:32,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 21:46:32,047 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:46:32,047 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:46:32,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 21:46:32,047 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:46:32,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:46:32,048 INFO L85 PathProgramCache]: Analyzing trace with hash 2079040333, now seen corresponding path program 1 times [2024-10-12 21:46:32,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:46:32,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596392420] [2024-10-12 21:46:32,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:46:32,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:46:32,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:32,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:46:32,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:32,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:46:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:32,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:46:32,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:32,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:46:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:32,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:46:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:32,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:46:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:32,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 21:46:32,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:32,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:46:32,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:46:32,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596392420] [2024-10-12 21:46:32,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596392420] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:46:32,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:46:32,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:46:32,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287893841] [2024-10-12 21:46:32,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:46:32,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:46:32,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:46:32,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:46:32,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:46:32,177 INFO L87 Difference]: Start difference. First operand 962 states and 1359 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 21:46:33,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:46:33,139 INFO L93 Difference]: Finished difference Result 1837 states and 2584 transitions. [2024-10-12 21:46:33,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 21:46:33,140 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 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 59 [2024-10-12 21:46:33,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:46:33,146 INFO L225 Difference]: With dead ends: 1837 [2024-10-12 21:46:33,146 INFO L226 Difference]: Without dead ends: 1087 [2024-10-12 21:46:33,149 INFO L431 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-10-12 21:46:33,149 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 359 mSDsluCounter, 1363 mSDsCounter, 0 mSdLazyCounter, 1380 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 1608 SdHoareTripleChecker+Invalid, 1461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 21:46:33,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 1608 Invalid, 1461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1380 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 21:46:33,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2024-10-12 21:46:33,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 998. [2024-10-12 21:46:33,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 779 states have (on average 1.4133504492939666) internal successors, (1101), 796 states have internal predecessors, (1101), 123 states have call successors, (123), 71 states have call predecessors, (123), 94 states have return successors, (171), 134 states have call predecessors, (171), 119 states have call successors, (171) [2024-10-12 21:46:33,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1395 transitions. [2024-10-12 21:46:33,232 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1395 transitions. Word has length 59 [2024-10-12 21:46:33,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:46:33,233 INFO L471 AbstractCegarLoop]: Abstraction has 998 states and 1395 transitions. [2024-10-12 21:46:33,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 21:46:33,233 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1395 transitions. [2024-10-12 21:46:33,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 21:46:33,235 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:46:33,235 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:46:33,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 21:46:33,235 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:46:33,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:46:33,236 INFO L85 PathProgramCache]: Analyzing trace with hash -2075378353, now seen corresponding path program 1 times [2024-10-12 21:46:33,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:46:33,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700227414] [2024-10-12 21:46:33,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:46:33,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:46:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:33,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:46:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:33,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:46:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:33,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:46:33,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:33,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:46:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:33,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:46:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:33,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:46:33,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:33,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 21:46:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:33,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:46:33,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:46:33,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700227414] [2024-10-12 21:46:33,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700227414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:46:33,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:46:33,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 21:46:33,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345033867] [2024-10-12 21:46:33,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:46:33,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:46:33,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:46:33,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:46:33,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:46:33,393 INFO L87 Difference]: Start difference. First operand 998 states and 1395 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 21:46:34,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:46:34,372 INFO L93 Difference]: Finished difference Result 1892 states and 2612 transitions. [2024-10-12 21:46:34,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-12 21:46:34,373 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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 59 [2024-10-12 21:46:34,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:46:34,380 INFO L225 Difference]: With dead ends: 1892 [2024-10-12 21:46:34,381 INFO L226 Difference]: Without dead ends: 1186 [2024-10-12 21:46:34,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2024-10-12 21:46:34,383 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 1093 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1119 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:46:34,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1119 Valid, 987 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 21:46:34,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2024-10-12 21:46:34,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1005. [2024-10-12 21:46:34,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 786 states have (on average 1.4071246819338423) internal successors, (1106), 801 states have internal predecessors, (1106), 124 states have call successors, (124), 72 states have call predecessors, (124), 93 states have return successors, (167), 135 states have call predecessors, (167), 120 states have call successors, (167) [2024-10-12 21:46:34,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1397 transitions. [2024-10-12 21:46:34,456 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1397 transitions. Word has length 59 [2024-10-12 21:46:34,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:46:34,456 INFO L471 AbstractCegarLoop]: Abstraction has 1005 states and 1397 transitions. [2024-10-12 21:46:34,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 21:46:34,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1397 transitions. [2024-10-12 21:46:34,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 21:46:34,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:46:34,459 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:46:34,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 21:46:34,459 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:46:34,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:46:34,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1401940493, now seen corresponding path program 1 times [2024-10-12 21:46:34,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:46:34,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127843800] [2024-10-12 21:46:34,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:46:34,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:46:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:34,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:46:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:34,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:46:34,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:34,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:46:34,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:34,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:46:34,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:34,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:46:34,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:34,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:46:34,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:34,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 21:46:34,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:34,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:46:34,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:46:34,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127843800] [2024-10-12 21:46:34,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127843800] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:46:34,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:46:34,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:46:34,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570428449] [2024-10-12 21:46:34,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:46:34,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:46:34,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:46:34,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:46:34,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:46:34,587 INFO L87 Difference]: Start difference. First operand 1005 states and 1397 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 21:46:35,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:46:35,264 INFO L93 Difference]: Finished difference Result 2727 states and 3756 transitions. [2024-10-12 21:46:35,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 21:46:35,265 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2024-10-12 21:46:35,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:46:35,276 INFO L225 Difference]: With dead ends: 2727 [2024-10-12 21:46:35,276 INFO L226 Difference]: Without dead ends: 1937 [2024-10-12 21:46:35,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-10-12 21:46:35,279 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 1056 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1084 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:46:35,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1084 Valid, 785 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 21:46:35,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1937 states. [2024-10-12 21:46:35,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1937 to 1779. [2024-10-12 21:46:35,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1779 states, 1365 states have (on average 1.3626373626373627) internal successors, (1860), 1393 states have internal predecessors, (1860), 228 states have call successors, (228), 136 states have call predecessors, (228), 184 states have return successors, (357), 256 states have call predecessors, (357), 224 states have call successors, (357) [2024-10-12 21:46:35,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2445 transitions. [2024-10-12 21:46:35,442 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2445 transitions. Word has length 59 [2024-10-12 21:46:35,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:46:35,443 INFO L471 AbstractCegarLoop]: Abstraction has 1779 states and 2445 transitions. [2024-10-12 21:46:35,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 21:46:35,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2445 transitions. [2024-10-12 21:46:35,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 21:46:35,446 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:46:35,446 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:46:35,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 21:46:35,446 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:46:35,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:46:35,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1534392035, now seen corresponding path program 1 times [2024-10-12 21:46:35,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:46:35,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80409598] [2024-10-12 21:46:35,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:46:35,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:46:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:35,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:46:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:35,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:46:35,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:35,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:46:35,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:35,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:46:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:35,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:46:35,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:35,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:46:35,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:35,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 21:46:35,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:35,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:46:35,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:46:35,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80409598] [2024-10-12 21:46:35,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80409598] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:46:35,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:46:35,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:46:35,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582537209] [2024-10-12 21:46:35,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:46:35,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:46:35,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:46:35,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:46:35,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:46:35,518 INFO L87 Difference]: Start difference. First operand 1779 states and 2445 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 21:46:36,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:46:36,049 INFO L93 Difference]: Finished difference Result 3361 states and 4660 transitions. [2024-10-12 21:46:36,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:46:36,049 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 60 [2024-10-12 21:46:36,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:46:36,053 INFO L225 Difference]: With dead ends: 3361 [2024-10-12 21:46:36,054 INFO L226 Difference]: Without dead ends: 193 [2024-10-12 21:46:36,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-12 21:46:36,061 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 730 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:46:36,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 743 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 21:46:36,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-10-12 21:46:36,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2024-10-12 21:46:36,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 165 states have (on average 1.6) internal successors, (264), 167 states have internal predecessors, (264), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-12 21:46:36,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 304 transitions. [2024-10-12 21:46:36,073 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 304 transitions. Word has length 60 [2024-10-12 21:46:36,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:46:36,073 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 304 transitions. [2024-10-12 21:46:36,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 21:46:36,073 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 304 transitions. [2024-10-12 21:46:36,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 21:46:36,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:46:36,076 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:46:36,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 21:46:36,077 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:46:36,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:46:36,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1724577443, now seen corresponding path program 1 times [2024-10-12 21:46:36,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:46:36,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097139813] [2024-10-12 21:46:36,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:46:36,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:46:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:36,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:46:36,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:36,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 21:46:36,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:36,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 21:46:36,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:36,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 21:46:36,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:36,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 21:46:36,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:36,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:46:36,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:46:36,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097139813] [2024-10-12 21:46:36,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097139813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:46:36,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:46:36,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:46:36,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059078996] [2024-10-12 21:46:36,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:46:36,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:46:36,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:46:36,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:46:36,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:46:36,174 INFO L87 Difference]: Start difference. First operand 193 states and 304 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:46:36,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:46:36,781 INFO L93 Difference]: Finished difference Result 440 states and 706 transitions. [2024-10-12 21:46:36,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:46:36,782 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 92 [2024-10-12 21:46:36,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:46:36,785 INFO L225 Difference]: With dead ends: 440 [2024-10-12 21:46:36,785 INFO L226 Difference]: Without dead ends: 253 [2024-10-12 21:46:36,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:46:36,786 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 493 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:46:36,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 364 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 21:46:36,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-10-12 21:46:36,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 193. [2024-10-12 21:46:36,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 165 states have (on average 1.593939393939394) internal successors, (263), 167 states have internal predecessors, (263), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-12 21:46:36,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 303 transitions. [2024-10-12 21:46:36,809 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 303 transitions. Word has length 92 [2024-10-12 21:46:36,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:46:36,809 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 303 transitions. [2024-10-12 21:46:36,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:46:36,810 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 303 transitions. [2024-10-12 21:46:36,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 21:46:36,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:46:36,811 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:46:36,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 21:46:36,811 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:46:36,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:46:36,812 INFO L85 PathProgramCache]: Analyzing trace with hash 693907035, now seen corresponding path program 1 times [2024-10-12 21:46:36,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:46:36,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333305876] [2024-10-12 21:46:36,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:46:36,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:46:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:36,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:46:36,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:36,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 21:46:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:36,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 21:46:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:36,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 21:46:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:36,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 21:46:36,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:36,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:46:36,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:46:36,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333305876] [2024-10-12 21:46:36,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333305876] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:46:36,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:46:36,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:46:36,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595270622] [2024-10-12 21:46:36,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:46:36,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:46:36,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:46:36,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:46:36,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:46:36,970 INFO L87 Difference]: Start difference. First operand 193 states and 303 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:46:38,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:46:38,118 INFO L93 Difference]: Finished difference Result 680 states and 1095 transitions. [2024-10-12 21:46:38,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:46:38,118 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 92 [2024-10-12 21:46:38,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:46:38,122 INFO L225 Difference]: With dead ends: 680 [2024-10-12 21:46:38,122 INFO L226 Difference]: Without dead ends: 499 [2024-10-12 21:46:38,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:46:38,123 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 736 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 21:46:38,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 610 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 21:46:38,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2024-10-12 21:46:38,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 378. [2024-10-12 21:46:38,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 329 states have (on average 1.6048632218844985) internal successors, (528), 332 states have internal predecessors, (528), 35 states have call successors, (35), 13 states have call predecessors, (35), 13 states have return successors, (36), 33 states have call predecessors, (36), 33 states have call successors, (36) [2024-10-12 21:46:38,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 599 transitions. [2024-10-12 21:46:38,151 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 599 transitions. Word has length 92 [2024-10-12 21:46:38,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:46:38,151 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 599 transitions. [2024-10-12 21:46:38,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:46:38,152 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 599 transitions. [2024-10-12 21:46:38,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 21:46:38,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:46:38,153 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:46:38,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 21:46:38,153 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:46:38,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:46:38,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1555572951, now seen corresponding path program 1 times [2024-10-12 21:46:38,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:46:38,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203167791] [2024-10-12 21:46:38,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:46:38,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:46:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:38,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:46:38,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:38,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 21:46:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:38,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 21:46:38,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:38,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 21:46:38,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:38,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 21:46:38,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:38,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:46:38,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:46:38,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203167791] [2024-10-12 21:46:38,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203167791] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:46:38,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:46:38,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:46:38,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094893755] [2024-10-12 21:46:38,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:46:38,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:46:38,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:46:38,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:46:38,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:46:38,300 INFO L87 Difference]: Start difference. First operand 378 states and 599 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:46:39,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:46:39,649 INFO L93 Difference]: Finished difference Result 1117 states and 1799 transitions. [2024-10-12 21:46:39,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:46:39,650 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 92 [2024-10-12 21:46:39,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:46:39,655 INFO L225 Difference]: With dead ends: 1117 [2024-10-12 21:46:39,655 INFO L226 Difference]: Without dead ends: 751 [2024-10-12 21:46:39,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:46:39,658 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 749 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 1836 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 1888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:46:39,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 1156 Invalid, 1888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1836 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 21:46:39,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2024-10-12 21:46:39,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 551. [2024-10-12 21:46:39,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 481 states have (on average 1.5987525987525988) internal successors, (769), 485 states have internal predecessors, (769), 49 states have call successors, (49), 19 states have call predecessors, (49), 20 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2024-10-12 21:46:39,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 870 transitions. [2024-10-12 21:46:39,702 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 870 transitions. Word has length 92 [2024-10-12 21:46:39,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:46:39,702 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 870 transitions. [2024-10-12 21:46:39,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:46:39,703 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 870 transitions. [2024-10-12 21:46:39,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 21:46:39,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:46:39,704 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:46:39,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 21:46:39,704 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:46:39,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:46:39,705 INFO L85 PathProgramCache]: Analyzing trace with hash -521763947, now seen corresponding path program 1 times [2024-10-12 21:46:39,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:46:39,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606945613] [2024-10-12 21:46:39,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:46:39,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:46:39,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:39,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:46:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:39,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 21:46:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:39,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 21:46:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:39,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 21:46:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:39,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 21:46:39,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:39,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:46:39,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:46:39,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606945613] [2024-10-12 21:46:39,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606945613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:46:39,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:46:39,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:46:39,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233251369] [2024-10-12 21:46:39,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:46:39,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:46:39,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:46:39,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:46:39,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:46:39,862 INFO L87 Difference]: Start difference. First operand 551 states and 870 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:46:41,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:46:41,278 INFO L93 Difference]: Finished difference Result 1755 states and 2820 transitions. [2024-10-12 21:46:41,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:46:41,279 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 92 [2024-10-12 21:46:41,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:46:41,285 INFO L225 Difference]: With dead ends: 1755 [2024-10-12 21:46:41,286 INFO L226 Difference]: Without dead ends: 1216 [2024-10-12 21:46:41,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:46:41,288 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 744 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 1811 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 1865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:46:41,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 1154 Invalid, 1865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1811 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 21:46:41,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2024-10-12 21:46:41,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 900. [2024-10-12 21:46:41,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 788 states have (on average 1.5939086294416243) internal successors, (1256), 794 states have internal predecessors, (1256), 77 states have call successors, (77), 31 states have call predecessors, (77), 34 states have return successors, (88), 78 states have call predecessors, (88), 75 states have call successors, (88) [2024-10-12 21:46:41,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1421 transitions. [2024-10-12 21:46:41,357 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1421 transitions. Word has length 92 [2024-10-12 21:46:41,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:46:41,357 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1421 transitions. [2024-10-12 21:46:41,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:46:41,358 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1421 transitions. [2024-10-12 21:46:41,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 21:46:41,359 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:46:41,359 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:46:41,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 21:46:41,360 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:46:41,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:46:41,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1212340503, now seen corresponding path program 1 times [2024-10-12 21:46:41,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:46:41,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449692332] [2024-10-12 21:46:41,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:46:41,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:46:41,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:41,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:46:41,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:41,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 21:46:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:41,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 21:46:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:41,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 21:46:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:41,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 21:46:41,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:41,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:46:41,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:46:41,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449692332] [2024-10-12 21:46:41,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449692332] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:46:41,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:46:41,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:46:41,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97847809] [2024-10-12 21:46:41,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:46:41,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:46:41,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:46:41,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:46:41,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:46:41,536 INFO L87 Difference]: Start difference. First operand 900 states and 1421 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:46:42,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:46:42,949 INFO L93 Difference]: Finished difference Result 2990 states and 4795 transitions. [2024-10-12 21:46:42,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:46:42,950 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 92 [2024-10-12 21:46:42,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:46:42,959 INFO L225 Difference]: With dead ends: 2990 [2024-10-12 21:46:42,960 INFO L226 Difference]: Without dead ends: 2102 [2024-10-12 21:46:42,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:46:42,963 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 743 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 1798 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 1852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:46:42,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 1154 Invalid, 1852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1798 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 21:46:42,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2102 states. [2024-10-12 21:46:43,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2102 to 1601. [2024-10-12 21:46:43,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1405 states have (on average 1.590035587188612) internal successors, (2234), 1415 states have internal predecessors, (2234), 133 states have call successors, (133), 55 states have call predecessors, (133), 62 states have return successors, (166), 138 states have call predecessors, (166), 131 states have call successors, (166) [2024-10-12 21:46:43,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2533 transitions. [2024-10-12 21:46:43,094 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2533 transitions. Word has length 92 [2024-10-12 21:46:43,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:46:43,095 INFO L471 AbstractCegarLoop]: Abstraction has 1601 states and 2533 transitions. [2024-10-12 21:46:43,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:46:43,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2533 transitions. [2024-10-12 21:46:43,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 21:46:43,099 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:46:43,100 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:46:43,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 21:46:43,100 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:46:43,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:46:43,101 INFO L85 PathProgramCache]: Analyzing trace with hash 2099563349, now seen corresponding path program 1 times [2024-10-12 21:46:43,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:46:43,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733409832] [2024-10-12 21:46:43,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:46:43,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:46:43,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:43,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:46:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:43,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 21:46:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:43,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 21:46:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:43,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 21:46:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:43,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 21:46:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:43,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:46:43,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:46:43,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733409832] [2024-10-12 21:46:43,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733409832] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:46:43,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:46:43,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:46:43,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723518910] [2024-10-12 21:46:43,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:46:43,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:46:43,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:46:43,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:46:43,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:46:43,248 INFO L87 Difference]: Start difference. First operand 1601 states and 2533 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:46:44,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:46:44,866 INFO L93 Difference]: Finished difference Result 5461 states and 8765 transitions. [2024-10-12 21:46:44,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:46:44,867 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 92 [2024-10-12 21:46:44,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:46:44,884 INFO L225 Difference]: With dead ends: 5461 [2024-10-12 21:46:44,884 INFO L226 Difference]: Without dead ends: 3872 [2024-10-12 21:46:44,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:46:44,890 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 742 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 1785 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 1839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:46:44,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 1154 Invalid, 1839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1785 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 21:46:44,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3872 states. [2024-10-12 21:46:45,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3872 to 3010. [2024-10-12 21:46:45,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3010 states, 2646 states have (on average 1.5873015873015872) internal successors, (4200), 2664 states have internal predecessors, (4200), 245 states have call successors, (245), 103 states have call predecessors, (245), 118 states have return successors, (340), 258 states have call predecessors, (340), 243 states have call successors, (340) [2024-10-12 21:46:45,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3010 states to 3010 states and 4785 transitions. [2024-10-12 21:46:45,147 INFO L78 Accepts]: Start accepts. Automaton has 3010 states and 4785 transitions. Word has length 92 [2024-10-12 21:46:45,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:46:45,148 INFO L471 AbstractCegarLoop]: Abstraction has 3010 states and 4785 transitions. [2024-10-12 21:46:45,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:46:45,148 INFO L276 IsEmpty]: Start isEmpty. Operand 3010 states and 4785 transitions. [2024-10-12 21:46:45,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 21:46:45,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:46:45,151 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:46:45,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 21:46:45,151 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:46:45,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:46:45,152 INFO L85 PathProgramCache]: Analyzing trace with hash 188520791, now seen corresponding path program 1 times [2024-10-12 21:46:45,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:46:45,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056215343] [2024-10-12 21:46:45,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:46:45,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:46:45,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:45,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:46:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:45,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 21:46:45,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:45,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 21:46:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:45,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 21:46:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:45,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 21:46:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:45,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:46:45,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:46:45,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056215343] [2024-10-12 21:46:45,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056215343] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:46:45,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:46:45,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:46:45,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317976764] [2024-10-12 21:46:45,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:46:45,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:46:45,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:46:45,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:46:45,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:46:45,321 INFO L87 Difference]: Start difference. First operand 3010 states and 4785 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:46:47,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:46:47,247 INFO L93 Difference]: Finished difference Result 11492 states and 18481 transitions. [2024-10-12 21:46:47,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:46:47,247 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 92 [2024-10-12 21:46:47,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:46:47,289 INFO L225 Difference]: With dead ends: 11492 [2024-10-12 21:46:47,289 INFO L226 Difference]: Without dead ends: 8494 [2024-10-12 21:46:47,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:46:47,302 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 831 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 1771 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 1859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:46:47,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 733 Invalid, 1859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1771 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 21:46:47,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8494 states. [2024-10-12 21:46:47,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8494 to 5811. [2024-10-12 21:46:47,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5811 states, 5127 states have (on average 1.5872830115077043) internal successors, (8138), 5161 states have internal predecessors, (8138), 453 states have call successors, (453), 199 states have call predecessors, (453), 230 states have return successors, (726), 482 states have call predecessors, (726), 451 states have call successors, (726) [2024-10-12 21:46:47,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5811 states to 5811 states and 9317 transitions. [2024-10-12 21:46:47,916 INFO L78 Accepts]: Start accepts. Automaton has 5811 states and 9317 transitions. Word has length 92 [2024-10-12 21:46:47,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:46:47,917 INFO L471 AbstractCegarLoop]: Abstraction has 5811 states and 9317 transitions. [2024-10-12 21:46:47,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:46:47,918 INFO L276 IsEmpty]: Start isEmpty. Operand 5811 states and 9317 transitions. [2024-10-12 21:46:47,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 21:46:47,924 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:46:47,924 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:46:47,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 21:46:47,924 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:46:47,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:46:47,925 INFO L85 PathProgramCache]: Analyzing trace with hash 265421589, now seen corresponding path program 1 times [2024-10-12 21:46:47,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:46:47,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425036821] [2024-10-12 21:46:47,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:46:47,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:46:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:47,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:46:47,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:48,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 21:46:48,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:48,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 21:46:48,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:48,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 21:46:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:48,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 21:46:48,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:48,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:46:48,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:46:48,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425036821] [2024-10-12 21:46:48,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425036821] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:46:48,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:46:48,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:46:48,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921980649] [2024-10-12 21:46:48,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:46:48,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:46:48,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:46:48,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:46:48,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:46:48,078 INFO L87 Difference]: Start difference. First operand 5811 states and 9317 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:46:50,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:46:50,473 INFO L93 Difference]: Finished difference Result 22019 states and 35671 transitions. [2024-10-12 21:46:50,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:46:50,474 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 92 [2024-10-12 21:46:50,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:46:50,542 INFO L225 Difference]: With dead ends: 22019 [2024-10-12 21:46:50,542 INFO L226 Difference]: Without dead ends: 16220 [2024-10-12 21:46:50,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:46:50,568 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 893 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 1748 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 1143 SdHoareTripleChecker+Invalid, 1805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:46:50,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 1143 Invalid, 1805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1748 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 21:46:50,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16220 states. [2024-10-12 21:46:51,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16220 to 11092. [2024-10-12 21:46:51,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11092 states, 9784 states have (on average 1.580948487326247) internal successors, (15468), 9850 states have internal predecessors, (15468), 853 states have call successors, (853), 391 states have call predecessors, (853), 454 states have return successors, (1644), 914 states have call predecessors, (1644), 851 states have call successors, (1644) [2024-10-12 21:46:51,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11092 states to 11092 states and 17965 transitions. [2024-10-12 21:46:51,490 INFO L78 Accepts]: Start accepts. Automaton has 11092 states and 17965 transitions. Word has length 92 [2024-10-12 21:46:51,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:46:51,491 INFO L471 AbstractCegarLoop]: Abstraction has 11092 states and 17965 transitions. [2024-10-12 21:46:51,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:46:51,491 INFO L276 IsEmpty]: Start isEmpty. Operand 11092 states and 17965 transitions. [2024-10-12 21:46:51,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 21:46:51,502 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:46:51,502 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:46:51,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 21:46:51,503 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:46:51,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:46:51,503 INFO L85 PathProgramCache]: Analyzing trace with hash -701929065, now seen corresponding path program 1 times [2024-10-12 21:46:51,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:46:51,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952595501] [2024-10-12 21:46:51,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:46:51,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:46:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:51,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:46:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:51,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 21:46:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:51,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 21:46:51,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:51,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 21:46:51,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:51,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 21:46:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:51,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:46:51,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:46:51,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952595501] [2024-10-12 21:46:51,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952595501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:46:51,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:46:51,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:46:51,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544744233] [2024-10-12 21:46:51,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:46:51,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:46:51,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:46:51,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:46:51,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:46:51,642 INFO L87 Difference]: Start difference. First operand 11092 states and 17965 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:46:55,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:46:55,346 INFO L93 Difference]: Finished difference Result 41666 states and 68141 transitions. [2024-10-12 21:46:55,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:46:55,347 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 92 [2024-10-12 21:46:55,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:46:55,492 INFO L225 Difference]: With dead ends: 41666 [2024-10-12 21:46:55,492 INFO L226 Difference]: Without dead ends: 30586 [2024-10-12 21:46:55,545 INFO L431 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-10-12 21:46:55,546 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 774 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 1970 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 1147 SdHoareTripleChecker+Invalid, 2026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:46:55,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 1147 Invalid, 2026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1970 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 21:46:55,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30586 states. [2024-10-12 21:46:57,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30586 to 21973. [2024-10-12 21:46:57,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21973 states, 19449 states have (on average 1.5818808164944214) internal successors, (30766), 19579 states have internal predecessors, (30766), 1621 states have call successors, (1621), 775 states have call predecessors, (1621), 902 states have return successors, (3934), 1746 states have call predecessors, (3934), 1619 states have call successors, (3934) [2024-10-12 21:46:57,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21973 states to 21973 states and 36321 transitions. [2024-10-12 21:46:57,723 INFO L78 Accepts]: Start accepts. Automaton has 21973 states and 36321 transitions. Word has length 92 [2024-10-12 21:46:57,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:46:57,724 INFO L471 AbstractCegarLoop]: Abstraction has 21973 states and 36321 transitions. [2024-10-12 21:46:57,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:46:57,724 INFO L276 IsEmpty]: Start isEmpty. Operand 21973 states and 36321 transitions. [2024-10-12 21:46:57,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 21:46:57,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:46:57,748 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:46:57,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 21:46:57,749 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:46:57,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:46:57,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1206528725, now seen corresponding path program 1 times [2024-10-12 21:46:57,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:46:57,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703797321] [2024-10-12 21:46:57,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:46:57,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:46:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:57,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:46:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:57,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 21:46:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:57,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 21:46:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:57,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 21:46:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:57,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 21:46:57,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:46:57,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:46:57,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:46:57,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703797321] [2024-10-12 21:46:57,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703797321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:46:57,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:46:57,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:46:57,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402199535] [2024-10-12 21:46:57,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:46:57,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:46:57,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:46:57,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:46:57,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:46:57,907 INFO L87 Difference]: Start difference. First operand 21973 states and 36321 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:47:03,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:47:03,361 INFO L93 Difference]: Finished difference Result 79231 states and 132463 transitions. [2024-10-12 21:47:03,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:47:03,362 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 92 [2024-10-12 21:47:03,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:47:03,730 INFO L225 Difference]: With dead ends: 79231 [2024-10-12 21:47:03,731 INFO L226 Difference]: Without dead ends: 57270 [2024-10-12 21:47:03,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:47:03,865 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 789 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 1704 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 1147 SdHoareTripleChecker+Invalid, 1761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:47:03,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 1147 Invalid, 1761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1704 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 21:47:03,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57270 states. [2024-10-12 21:47:08,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57270 to 43863. [2024-10-12 21:47:08,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43863 states, 38971 states have (on average 1.5844089194529265) internal successors, (61746), 39229 states have internal predecessors, (61746), 3093 states have call successors, (3093), 1543 states have call predecessors, (3093), 1798 states have return successors, (9908), 3346 states have call predecessors, (9908), 3091 states have call successors, (9908) [2024-10-12 21:47:08,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43863 states to 43863 states and 74747 transitions. [2024-10-12 21:47:08,385 INFO L78 Accepts]: Start accepts. Automaton has 43863 states and 74747 transitions. Word has length 92 [2024-10-12 21:47:08,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:47:08,386 INFO L471 AbstractCegarLoop]: Abstraction has 43863 states and 74747 transitions. [2024-10-12 21:47:08,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:47:08,386 INFO L276 IsEmpty]: Start isEmpty. Operand 43863 states and 74747 transitions. [2024-10-12 21:47:08,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 21:47:08,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:47:08,426 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:47:08,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 21:47:08,427 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:47:08,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:47:08,428 INFO L85 PathProgramCache]: Analyzing trace with hash -2134498413, now seen corresponding path program 1 times [2024-10-12 21:47:08,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:47:08,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946868689] [2024-10-12 21:47:08,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:08,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:47:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:08,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:47:08,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:08,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 21:47:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:08,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 21:47:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:08,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 21:47:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:08,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 21:47:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:08,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:47:08,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:47:08,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946868689] [2024-10-12 21:47:08,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946868689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:47:08,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:47:08,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:47:08,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312160475] [2024-10-12 21:47:08,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:47:08,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:47:08,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:47:08,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:47:08,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:47:08,550 INFO L87 Difference]: Start difference. First operand 43863 states and 74747 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:47:18,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:47:18,642 INFO L93 Difference]: Finished difference Result 154239 states and 266439 transitions. [2024-10-12 21:47:18,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:47:18,643 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 92 [2024-10-12 21:47:18,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:47:19,563 INFO L225 Difference]: With dead ends: 154239 [2024-10-12 21:47:19,567 INFO L226 Difference]: Without dead ends: 110388 [2024-10-12 21:47:19,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:47:19,849 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 738 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 1790 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 1147 SdHoareTripleChecker+Invalid, 1847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:47:19,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 1147 Invalid, 1847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1790 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 21:47:19,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110388 states.