./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.12.cil-1.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.12.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 54640fbb6743a38bf41f3a8b2318fcad885a58c92146d7845af619d355e32c56 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 21:47:28,534 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 21:47:28,608 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 21:47:28,612 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 21:47:28,612 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 21:47:28,645 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 21:47:28,645 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 21:47:28,646 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 21:47:28,646 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 21:47:28,647 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 21:47:28,648 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 21:47:28,648 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 21:47:28,649 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 21:47:28,649 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 21:47:28,651 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 21:47:28,651 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 21:47:28,652 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 21:47:28,652 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 21:47:28,652 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 21:47:28,655 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 21:47:28,655 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 21:47:28,656 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 21:47:28,656 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 21:47:28,656 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 21:47:28,656 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 21:47:28,657 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 21:47:28,657 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 21:47:28,657 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 21:47:28,657 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 21:47:28,658 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 21:47:28,658 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 21:47:28,658 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 21:47:28,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:47:28,662 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 21:47:28,663 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 21:47:28,663 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 21:47:28,663 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 21:47:28,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 21:47:28,663 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 21:47:28,664 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 21:47:28,664 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 21:47:28,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 21:47:28,665 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 -> 54640fbb6743a38bf41f3a8b2318fcad885a58c92146d7845af619d355e32c56 [2024-10-12 21:47:28,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 21:47:28,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 21:47:28,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 21:47:28,946 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 21:47:28,947 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 21:47:28,948 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.12.cil-1.c [2024-10-12 21:47:30,353 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 21:47:30,636 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 21:47:30,637 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.12.cil-1.c [2024-10-12 21:47:30,655 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f904dc5e/e641016e7d3445a08300e2136a2b687a/FLAGb1d69097d [2024-10-12 21:47:30,670 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f904dc5e/e641016e7d3445a08300e2136a2b687a [2024-10-12 21:47:30,672 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 21:47:30,673 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 21:47:30,674 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 21:47:30,674 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 21:47:30,679 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 21:47:30,680 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:47:30" (1/1) ... [2024-10-12 21:47:30,680 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bcb2cfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:47:30, skipping insertion in model container [2024-10-12 21:47:30,680 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:47:30" (1/1) ... [2024-10-12 21:47:30,737 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 21:47:30,906 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.12.cil-1.c[911,924] [2024-10-12 21:47:30,964 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.12.cil-1.c[8416,8429] [2024-10-12 21:47:31,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:47:31,104 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 21:47:31,117 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.12.cil-1.c[911,924] [2024-10-12 21:47:31,149 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.12.cil-1.c[8416,8429] [2024-10-12 21:47:31,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:47:31,231 INFO L204 MainTranslator]: Completed translation [2024-10-12 21:47:31,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:47:31 WrapperNode [2024-10-12 21:47:31,232 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 21:47:31,234 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 21:47:31,234 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 21:47:31,234 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 21:47:31,242 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:47:31" (1/1) ... [2024-10-12 21:47:31,260 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:47:31" (1/1) ... [2024-10-12 21:47:31,308 INFO L138 Inliner]: procedures = 79, calls = 98, calls flagged for inlining = 47, calls inlined = 47, statements flattened = 1112 [2024-10-12 21:47:31,309 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 21:47:31,310 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 21:47:31,310 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 21:47:31,310 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 21:47:31,322 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:47:31" (1/1) ... [2024-10-12 21:47:31,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:47:31" (1/1) ... [2024-10-12 21:47:31,327 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:47:31" (1/1) ... [2024-10-12 21:47:31,354 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:47:31,354 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:47:31" (1/1) ... [2024-10-12 21:47:31,354 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:47:31" (1/1) ... [2024-10-12 21:47:31,370 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:47:31" (1/1) ... [2024-10-12 21:47:31,387 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:47:31" (1/1) ... [2024-10-12 21:47:31,395 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:47:31" (1/1) ... [2024-10-12 21:47:31,404 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:47:31" (1/1) ... [2024-10-12 21:47:31,419 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 21:47:31,420 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 21:47:31,420 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 21:47:31,420 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 21:47:31,421 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:47:31" (1/1) ... [2024-10-12 21:47:31,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:47:31,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:47:31,459 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:47:31,466 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:47:31,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 21:47:31,514 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 21:47:31,514 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 21:47:31,514 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-12 21:47:31,516 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-12 21:47:31,516 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-12 21:47:31,516 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-12 21:47:31,516 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-12 21:47:31,517 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-12 21:47:31,517 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-10-12 21:47:31,517 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-10-12 21:47:31,517 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-12 21:47:31,517 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-12 21:47:31,518 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-12 21:47:31,518 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-12 21:47:31,518 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-10-12 21:47:31,518 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-10-12 21:47:31,518 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-12 21:47:31,518 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-12 21:47:31,519 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-10-12 21:47:31,519 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-10-12 21:47:31,519 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-12 21:47:31,519 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-12 21:47:31,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 21:47:31,520 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-12 21:47:31,520 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-12 21:47:31,520 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-10-12 21:47:31,521 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-10-12 21:47:31,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 21:47:31,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 21:47:31,521 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-12 21:47:31,521 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-12 21:47:31,522 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-10-12 21:47:31,522 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-10-12 21:47:31,672 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 21:47:31,684 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 21:47:32,657 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2024-10-12 21:47:32,657 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:47:32,889 INFO L? ?]: Removed 134 outVars from TransFormulas that were not future-live. [2024-10-12 21:47:32,889 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 21:47:32,976 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 21:47:32,979 INFO L314 CfgBuilder]: Removed 19 assume(true) statements. [2024-10-12 21:47:32,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:47:32 BoogieIcfgContainer [2024-10-12 21:47:32,980 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 21:47:32,982 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 21:47:32,982 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 21:47:32,986 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 21:47:32,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 09:47:30" (1/3) ... [2024-10-12 21:47:32,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@141c447b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:47:32, skipping insertion in model container [2024-10-12 21:47:32,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:47:31" (2/3) ... [2024-10-12 21:47:32,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@141c447b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:47:32, skipping insertion in model container [2024-10-12 21:47:32,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:47:32" (3/3) ... [2024-10-12 21:47:32,988 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.12.cil-1.c [2024-10-12 21:47:33,002 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 21:47:33,003 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 21:47:33,093 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 21:47:33,100 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;@494b7bc4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 21:47:33,100 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 21:47:33,107 INFO L276 IsEmpty]: Start isEmpty. Operand has 460 states, 398 states have (on average 1.7185929648241205) internal successors, (684), 406 states have internal predecessors, (684), 44 states have call successors, (44), 15 states have call predecessors, (44), 15 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-12 21:47:33,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 21:47:33,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:47:33,117 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:47:33,118 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:47:33,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:47:33,122 INFO L85 PathProgramCache]: Analyzing trace with hash 913991793, now seen corresponding path program 1 times [2024-10-12 21:47:33,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:47:33,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225578650] [2024-10-12 21:47:33,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:33,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:47:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:33,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:47:33,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:33,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:33,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:47:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:33,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:47:33,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:33,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:47:33,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:33,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:47:33,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:33,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:47:33,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:33,621 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:33,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:47:33,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225578650] [2024-10-12 21:47:33,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225578650] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:47:33,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:47:33,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:47:33,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964055515] [2024-10-12 21:47:33,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:47:33,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:47:33,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:47:33,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:47:33,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:47:33,664 INFO L87 Difference]: Start difference. First operand has 460 states, 398 states have (on average 1.7185929648241205) internal successors, (684), 406 states have internal predecessors, (684), 44 states have call successors, (44), 15 states have call predecessors, (44), 15 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 21:47:34,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:47:34,871 INFO L93 Difference]: Finished difference Result 912 states and 1527 transitions. [2024-10-12 21:47:34,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 21:47:34,874 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 57 [2024-10-12 21:47:34,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:47:34,888 INFO L225 Difference]: With dead ends: 912 [2024-10-12 21:47:34,888 INFO L226 Difference]: Without dead ends: 471 [2024-10-12 21:47:34,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:47:34,897 INFO L432 NwaCegarLoop]: 378 mSDtfsCounter, 1047 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1059 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:47:34,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1059 Valid, 1221 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 21:47:34,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2024-10-12 21:47:34,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 454. [2024-10-12 21:47:34,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 395 states have (on average 1.6151898734177215) internal successors, (638), 400 states have internal predecessors, (638), 44 states have call successors, (44), 15 states have call predecessors, (44), 13 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-12 21:47:34,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 722 transitions. [2024-10-12 21:47:34,994 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 722 transitions. Word has length 57 [2024-10-12 21:47:34,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:47:34,995 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 722 transitions. [2024-10-12 21:47:34,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 21:47:34,995 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 722 transitions. [2024-10-12 21:47:35,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 21:47:35,000 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:47:35,000 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:47:35,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 21:47:35,002 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:47:35,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:47:35,003 INFO L85 PathProgramCache]: Analyzing trace with hash 929510511, now seen corresponding path program 1 times [2024-10-12 21:47:35,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:47:35,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793093521] [2024-10-12 21:47:35,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:35,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:47:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:35,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:47:35,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:35,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:35,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:35,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:47:35,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:35,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:47:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:35,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:47:35,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:35,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:47:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:35,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:47:35,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:35,293 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:35,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:47:35,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793093521] [2024-10-12 21:47:35,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793093521] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:47:35,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:47:35,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 21:47:35,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926389440] [2024-10-12 21:47:35,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:47:35,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:47:35,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:47:35,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:47:35,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:47:35,298 INFO L87 Difference]: Start difference. First operand 454 states and 722 transitions. 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:47:36,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:47:36,757 INFO L93 Difference]: Finished difference Result 686 states and 1068 transitions. [2024-10-12 21:47:36,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:47:36,758 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:47:36,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:47:36,762 INFO L225 Difference]: With dead ends: 686 [2024-10-12 21:47:36,763 INFO L226 Difference]: Without dead ends: 592 [2024-10-12 21:47:36,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:47:36,765 INFO L432 NwaCegarLoop]: 372 mSDtfsCounter, 1222 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1229 SdHoareTripleChecker+Valid, 1866 SdHoareTripleChecker+Invalid, 1764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:47:36,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1229 Valid, 1866 Invalid, 1764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 21:47:36,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2024-10-12 21:47:36,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 555. [2024-10-12 21:47:36,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 474 states have (on average 1.5886075949367089) internal successors, (753), 481 states have internal predecessors, (753), 57 states have call successors, (57), 22 states have call predecessors, (57), 22 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2024-10-12 21:47:36,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 868 transitions. [2024-10-12 21:47:36,816 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 868 transitions. Word has length 57 [2024-10-12 21:47:36,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:47:36,817 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 868 transitions. [2024-10-12 21:47:36,817 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:47:36,817 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 868 transitions. [2024-10-12 21:47:36,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 21:47:36,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:47:36,820 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:47:36,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 21:47:36,820 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:47:36,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:47:36,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1014482257, now seen corresponding path program 1 times [2024-10-12 21:47:36,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:47:36,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347244426] [2024-10-12 21:47:36,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:36,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:47:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:36,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:47:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:36,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:36,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:47:37,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:37,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:47:37,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:37,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:47:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:37,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:47:37,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:37,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:47:37,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:37,016 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:37,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:47:37,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347244426] [2024-10-12 21:47:37,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347244426] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:47:37,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:47:37,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 21:47:37,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493331067] [2024-10-12 21:47:37,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:47:37,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:47:37,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:47:37,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:47:37,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:47:37,019 INFO L87 Difference]: Start difference. First operand 555 states and 868 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:47:39,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:47:39,004 INFO L93 Difference]: Finished difference Result 916 states and 1397 transitions. [2024-10-12 21:47:39,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 21:47:39,004 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:47:39,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:47:39,010 INFO L225 Difference]: With dead ends: 916 [2024-10-12 21:47:39,010 INFO L226 Difference]: Without dead ends: 728 [2024-10-12 21:47:39,011 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:47:39,012 INFO L432 NwaCegarLoop]: 413 mSDtfsCounter, 1394 mSDsluCounter, 1753 mSDsCounter, 0 mSdLazyCounter, 1996 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1426 SdHoareTripleChecker+Valid, 2166 SdHoareTripleChecker+Invalid, 2123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:47:39,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1426 Valid, 2166 Invalid, 2123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1996 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 21:47:39,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2024-10-12 21:47:39,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 656. [2024-10-12 21:47:39,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 553 states have (on average 1.5678119349005426) internal successors, (867), 562 states have internal predecessors, (867), 70 states have call successors, (70), 29 states have call predecessors, (70), 31 states have return successors, (79), 68 states have call predecessors, (79), 66 states have call successors, (79) [2024-10-12 21:47:39,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1016 transitions. [2024-10-12 21:47:39,075 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1016 transitions. Word has length 57 [2024-10-12 21:47:39,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:47:39,076 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 1016 transitions. [2024-10-12 21:47:39,076 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:47:39,077 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1016 transitions. [2024-10-12 21:47:39,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 21:47:39,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:47:39,081 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:47:39,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 21:47:39,081 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:47:39,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:47:39,082 INFO L85 PathProgramCache]: Analyzing trace with hash -120995919, now seen corresponding path program 1 times [2024-10-12 21:47:39,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:47:39,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335444951] [2024-10-12 21:47:39,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:39,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:47:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:39,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:47:39,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:39,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:39,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:47:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:39,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:47:39,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:39,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:47:39,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:39,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:47:39,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:39,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:47:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:39,332 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:39,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:47:39,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335444951] [2024-10-12 21:47:39,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335444951] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:47:39,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:47:39,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 21:47:39,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301459162] [2024-10-12 21:47:39,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:47:39,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 21:47:39,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:47:39,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 21:47:39,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-12 21:47:39,336 INFO L87 Difference]: Start difference. First operand 656 states and 1016 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 7 states have internal predecessors, (42), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2024-10-12 21:47:42,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:47:42,125 INFO L93 Difference]: Finished difference Result 2054 states and 3065 transitions. [2024-10-12 21:47:42,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-12 21:47:42,126 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 7 states have internal predecessors, (42), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 57 [2024-10-12 21:47:42,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:47:42,150 INFO L225 Difference]: With dead ends: 2054 [2024-10-12 21:47:42,154 INFO L226 Difference]: Without dead ends: 1753 [2024-10-12 21:47:42,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2024-10-12 21:47:42,218 INFO L432 NwaCegarLoop]: 421 mSDtfsCounter, 3651 mSDsluCounter, 1994 mSDsCounter, 0 mSdLazyCounter, 2253 mSolverCounterSat, 596 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3669 SdHoareTripleChecker+Valid, 2415 SdHoareTripleChecker+Invalid, 2849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 596 IncrementalHoareTripleChecker+Valid, 2253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:47:42,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3669 Valid, 2415 Invalid, 2849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [596 Valid, 2253 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-12 21:47:42,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1753 states. [2024-10-12 21:47:42,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1753 to 1620. [2024-10-12 21:47:42,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 1312 states have (on average 1.4664634146341464) internal successors, (1924), 1336 states have internal predecessors, (1924), 180 states have call successors, (180), 112 states have call predecessors, (180), 126 states have return successors, (212), 174 states have call predecessors, (212), 176 states have call successors, (212) [2024-10-12 21:47:42,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 2316 transitions. [2024-10-12 21:47:42,444 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 2316 transitions. Word has length 57 [2024-10-12 21:47:42,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:47:42,445 INFO L471 AbstractCegarLoop]: Abstraction has 1620 states and 2316 transitions. [2024-10-12 21:47:42,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 7 states have internal predecessors, (42), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2024-10-12 21:47:42,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 2316 transitions. [2024-10-12 21:47:42,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 21:47:42,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:47:42,447 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:47:42,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 21:47:42,448 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:47:42,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:47:42,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1893022782, now seen corresponding path program 1 times [2024-10-12 21:47:42,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:47:42,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932451308] [2024-10-12 21:47:42,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:42,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:47:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:42,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:47:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:42,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:42,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:47:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:42,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:47:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:42,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:42,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:42,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 21:47:42,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:42,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:47:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:42,742 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:42,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:47:42,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932451308] [2024-10-12 21:47:42,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932451308] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:47:42,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:47:42,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:47:42,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125841899] [2024-10-12 21:47:42,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:47:42,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:47:42,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:47:42,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:47:42,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:47:42,746 INFO L87 Difference]: Start difference. First operand 1620 states and 2316 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:47:44,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:47:44,409 INFO L93 Difference]: Finished difference Result 3001 states and 4240 transitions. [2024-10-12 21:47:44,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:47:44,410 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:47:44,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:47:44,420 INFO L225 Difference]: With dead ends: 3001 [2024-10-12 21:47:44,421 INFO L226 Difference]: Without dead ends: 1742 [2024-10-12 21:47:44,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-12 21:47:44,425 INFO L432 NwaCegarLoop]: 375 mSDtfsCounter, 938 mSDsluCounter, 1906 mSDsCounter, 0 mSdLazyCounter, 2140 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 2281 SdHoareTripleChecker+Invalid, 2283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 2140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:47:44,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 2281 Invalid, 2283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 2140 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 21:47:44,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2024-10-12 21:47:44,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 1652. [2024-10-12 21:47:44,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1652 states, 1336 states have (on average 1.4535928143712575) internal successors, (1942), 1360 states have internal predecessors, (1942), 180 states have call successors, (180), 112 states have call predecessors, (180), 134 states have return successors, (220), 182 states have call predecessors, (220), 176 states have call successors, (220) [2024-10-12 21:47:44,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 2342 transitions. [2024-10-12 21:47:44,570 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 2342 transitions. Word has length 58 [2024-10-12 21:47:44,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:47:44,571 INFO L471 AbstractCegarLoop]: Abstraction has 1652 states and 2342 transitions. [2024-10-12 21:47:44,571 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:47:44,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 2342 transitions. [2024-10-12 21:47:44,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 21:47:44,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:47:44,572 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:47:44,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 21:47:44,573 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:47:44,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:47:44,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1820636224, now seen corresponding path program 1 times [2024-10-12 21:47:44,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:47:44,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873239920] [2024-10-12 21:47:44,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:44,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:47:44,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:44,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:47:44,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:44,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:44,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:44,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:47:44,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:44,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:47:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:44,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:44,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:44,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 21:47:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:44,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:47:44,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:44,718 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:44,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:47:44,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873239920] [2024-10-12 21:47:44,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873239920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:47:44,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:47:44,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 21:47:44,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782313235] [2024-10-12 21:47:44,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:47:44,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 21:47:44,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:47:44,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 21:47:44,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-12 21:47:44,721 INFO L87 Difference]: Start difference. First operand 1652 states and 2342 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-12 21:47:47,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:47:47,035 INFO L93 Difference]: Finished difference Result 4911 states and 6903 transitions. [2024-10-12 21:47:47,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-12 21:47:47,035 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 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:47:47,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:47:47,047 INFO L225 Difference]: With dead ends: 4911 [2024-10-12 21:47:47,047 INFO L226 Difference]: Without dead ends: 2022 [2024-10-12 21:47:47,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2024-10-12 21:47:47,055 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 4212 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 1994 mSolverCounterSat, 722 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4230 SdHoareTripleChecker+Valid, 2112 SdHoareTripleChecker+Invalid, 2716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 722 IncrementalHoareTripleChecker+Valid, 1994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:47:47,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4230 Valid, 2112 Invalid, 2716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [722 Valid, 1994 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 21:47:47,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2022 states. [2024-10-12 21:47:47,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2022 to 1866. [2024-10-12 21:47:47,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1866 states, 1478 states have (on average 1.4012178619756428) internal successors, (2071), 1504 states have internal predecessors, (2071), 220 states have call successors, (220), 140 states have call predecessors, (220), 166 states have return successors, (266), 224 states have call predecessors, (266), 216 states have call successors, (266) [2024-10-12 21:47:47,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 2557 transitions. [2024-10-12 21:47:47,243 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 2557 transitions. Word has length 58 [2024-10-12 21:47:47,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:47:47,244 INFO L471 AbstractCegarLoop]: Abstraction has 1866 states and 2557 transitions. [2024-10-12 21:47:47,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-12 21:47:47,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 2557 transitions. [2024-10-12 21:47:47,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 21:47:47,246 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:47:47,246 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:47:47,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 21:47:47,247 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:47:47,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:47:47,247 INFO L85 PathProgramCache]: Analyzing trace with hash -651185992, now seen corresponding path program 1 times [2024-10-12 21:47:47,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:47:47,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667484663] [2024-10-12 21:47:47,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:47,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:47:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:47,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:47:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:47,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:47,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:47,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:47:47,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:47,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:47:47,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:47,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:47,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:47:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:47,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 21:47:47,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:47,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 21:47:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:47,373 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-12 21:47:47,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:47:47,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667484663] [2024-10-12 21:47:47,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667484663] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:47:47,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:47:47,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:47:47,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886148502] [2024-10-12 21:47:47,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:47:47,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:47:47,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:47:47,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:47:47,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:47:47,375 INFO L87 Difference]: Start difference. First operand 1866 states and 2557 transitions. Second operand has 9 states, 8 states have (on average 6.625) internal successors, (53), 5 states have internal predecessors, (53), 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:47:48,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:47:48,787 INFO L93 Difference]: Finished difference Result 3535 states and 4795 transitions. [2024-10-12 21:47:48,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 21:47:48,787 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 5 states have internal predecessors, (53), 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 80 [2024-10-12 21:47:48,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:47:48,798 INFO L225 Difference]: With dead ends: 3535 [2024-10-12 21:47:48,798 INFO L226 Difference]: Without dead ends: 2030 [2024-10-12 21:47:48,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:47:48,804 INFO L432 NwaCegarLoop]: 368 mSDtfsCounter, 929 mSDsluCounter, 1882 mSDsCounter, 0 mSdLazyCounter, 2103 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 2250 SdHoareTripleChecker+Invalid, 2245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 2103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:47:48,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [931 Valid, 2250 Invalid, 2245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 2103 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 21:47:48,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2030 states. [2024-10-12 21:47:48,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2030 to 1914. [2024-10-12 21:47:48,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1914 states, 1514 states have (on average 1.3877146631439894) internal successors, (2101), 1540 states have internal predecessors, (2101), 220 states have call successors, (220), 140 states have call predecessors, (220), 178 states have return successors, (278), 236 states have call predecessors, (278), 216 states have call successors, (278) [2024-10-12 21:47:48,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2599 transitions. [2024-10-12 21:47:48,950 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2599 transitions. Word has length 80 [2024-10-12 21:47:48,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:47:48,952 INFO L471 AbstractCegarLoop]: Abstraction has 1914 states and 2599 transitions. [2024-10-12 21:47:48,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 5 states have internal predecessors, (53), 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:47:48,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2599 transitions. [2024-10-12 21:47:48,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 21:47:48,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:47:48,954 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:47:48,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 21:47:48,954 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:47:48,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:47:48,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1277086710, now seen corresponding path program 1 times [2024-10-12 21:47:48,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:47:48,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779236320] [2024-10-12 21:47:48,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:48,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:47:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:49,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:47:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:49,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:49,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:47:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:49,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:47:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:49,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:49,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:49,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:47:49,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:49,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 21:47:49,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:49,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 21:47:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:49,177 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-12 21:47:49,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:47:49,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779236320] [2024-10-12 21:47:49,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779236320] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:47:49,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:47:49,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 21:47:49,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290845892] [2024-10-12 21:47:49,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:47:49,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:47:49,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:47:49,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:47:49,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:47:49,180 INFO L87 Difference]: Start difference. First operand 1914 states and 2599 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 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:47:50,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:47:50,640 INFO L93 Difference]: Finished difference Result 3313 states and 4435 transitions. [2024-10-12 21:47:50,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-12 21:47:50,641 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 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 80 [2024-10-12 21:47:50,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:47:50,653 INFO L225 Difference]: With dead ends: 3313 [2024-10-12 21:47:50,653 INFO L226 Difference]: Without dead ends: 1981 [2024-10-12 21:47:50,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2024-10-12 21:47:50,659 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 1739 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 1684 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1771 SdHoareTripleChecker+Valid, 1623 SdHoareTripleChecker+Invalid, 1890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:47:50,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1771 Valid, 1623 Invalid, 1890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1684 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 21:47:50,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2024-10-12 21:47:50,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1706. [2024-10-12 21:47:50,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1706 states, 1359 states have (on average 1.3951434878587197) internal successors, (1896), 1380 states have internal predecessors, (1896), 192 states have call successors, (192), 121 states have call predecessors, (192), 153 states have return successors, (238), 206 states have call predecessors, (238), 188 states have call successors, (238) [2024-10-12 21:47:50,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 2326 transitions. [2024-10-12 21:47:50,798 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 2326 transitions. Word has length 80 [2024-10-12 21:47:50,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:47:50,798 INFO L471 AbstractCegarLoop]: Abstraction has 1706 states and 2326 transitions. [2024-10-12 21:47:50,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 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:47:50,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2326 transitions. [2024-10-12 21:47:50,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 21:47:50,801 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:47:50,801 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:47:50,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 21:47:50,801 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:47:50,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:47:50,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1700733432, now seen corresponding path program 1 times [2024-10-12 21:47:50,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:47:50,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649607772] [2024-10-12 21:47:50,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:50,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:47:50,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:50,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:47:50,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:50,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:50,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:47:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:50,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:47:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:50,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:50,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:47:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:50,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 21:47:50,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:50,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 21:47:50,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:50,924 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 21:47:50,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:47:50,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649607772] [2024-10-12 21:47:50,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649607772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:47:50,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:47:50,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:47:50,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024156202] [2024-10-12 21:47:50,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:47:50,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:47:50,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:47:50,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:47:50,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:47:50,927 INFO L87 Difference]: Start difference. First operand 1706 states and 2326 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-12 21:47:51,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:47:51,663 INFO L93 Difference]: Finished difference Result 3155 states and 4255 transitions. [2024-10-12 21:47:51,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 21:47:51,664 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 80 [2024-10-12 21:47:51,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:47:51,675 INFO L225 Difference]: With dead ends: 3155 [2024-10-12 21:47:51,675 INFO L226 Difference]: Without dead ends: 1811 [2024-10-12 21:47:51,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-10-12 21:47:51,680 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 1876 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1910 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:47:51,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1910 Valid, 903 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 21:47:51,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2024-10-12 21:47:51,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1706. [2024-10-12 21:47:51,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1706 states, 1359 states have (on average 1.3686534216335542) internal successors, (1860), 1380 states have internal predecessors, (1860), 192 states have call successors, (192), 121 states have call predecessors, (192), 153 states have return successors, (238), 206 states have call predecessors, (238), 188 states have call successors, (238) [2024-10-12 21:47:51,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 2290 transitions. [2024-10-12 21:47:51,811 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 2290 transitions. Word has length 80 [2024-10-12 21:47:51,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:47:51,812 INFO L471 AbstractCegarLoop]: Abstraction has 1706 states and 2290 transitions. [2024-10-12 21:47:51,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-12 21:47:51,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2290 transitions. [2024-10-12 21:47:51,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 21:47:51,813 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:47:51,813 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:47:51,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 21:47:51,814 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:47:51,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:47:51,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1877211819, now seen corresponding path program 1 times [2024-10-12 21:47:51,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:47:51,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972973096] [2024-10-12 21:47:51,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:51,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:47:51,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:51,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:47:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:51,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:51,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:47:51,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:51,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:47:51,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:51,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:51,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:47:51,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:51,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 21:47:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:51,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 21:47:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:51,953 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 21:47:51,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:47:51,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972973096] [2024-10-12 21:47:51,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972973096] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:47:51,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:47:51,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:47:51,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066025654] [2024-10-12 21:47:51,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:47:51,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:47:51,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:47:51,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:47:51,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:47:51,955 INFO L87 Difference]: Start difference. First operand 1706 states and 2290 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 6 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-12 21:47:53,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:47:53,874 INFO L93 Difference]: Finished difference Result 3927 states and 5176 transitions. [2024-10-12 21:47:53,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-12 21:47:53,875 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 6 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 81 [2024-10-12 21:47:53,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:47:53,893 INFO L225 Difference]: With dead ends: 3927 [2024-10-12 21:47:53,893 INFO L226 Difference]: Without dead ends: 2442 [2024-10-12 21:47:53,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2024-10-12 21:47:53,899 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 1976 mSDsluCounter, 1927 mSDsCounter, 0 mSdLazyCounter, 1989 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2019 SdHoareTripleChecker+Valid, 2298 SdHoareTripleChecker+Invalid, 2354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 1989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:47:53,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2019 Valid, 2298 Invalid, 2354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 1989 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 21:47:53,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2024-10-12 21:47:54,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2278. [2024-10-12 21:47:54,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2278 states, 1777 states have (on average 1.3241418120427688) internal successors, (2353), 1806 states have internal predecessors, (2353), 269 states have call successors, (269), 169 states have call predecessors, (269), 230 states have return successors, (369), 304 states have call predecessors, (369), 265 states have call successors, (369) [2024-10-12 21:47:54,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2278 states to 2278 states and 2991 transitions. [2024-10-12 21:47:54,118 INFO L78 Accepts]: Start accepts. Automaton has 2278 states and 2991 transitions. Word has length 81 [2024-10-12 21:47:54,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:47:54,119 INFO L471 AbstractCegarLoop]: Abstraction has 2278 states and 2991 transitions. [2024-10-12 21:47:54,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 6 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-12 21:47:54,119 INFO L276 IsEmpty]: Start isEmpty. Operand 2278 states and 2991 transitions. [2024-10-12 21:47:54,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-12 21:47:54,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:47:54,121 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:47:54,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 21:47:54,122 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:47:54,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:47:54,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1462242994, now seen corresponding path program 1 times [2024-10-12 21:47:54,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:47:54,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073031303] [2024-10-12 21:47:54,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:54,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:47:54,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:54,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:47:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:54,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:54,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:47:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:54,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:47:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:54,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:54,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:54,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:47:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:54,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 21:47:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:54,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 21:47:54,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:54,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 21:47:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:54,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 21:47:54,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:54,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 21:47:54,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:54,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:47:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:54,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:47:54,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:54,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-12 21:47:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:54,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-12 21:47:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:54,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-12 21:47:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:54,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-12 21:47:54,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:54,323 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-12 21:47:54,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:47:54,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073031303] [2024-10-12 21:47:54,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073031303] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:47:54,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572286742] [2024-10-12 21:47:54,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:54,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:47:54,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:47:54,326 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:47:54,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 21:47:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:54,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 21:47:54,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:47:54,655 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-12 21:47:54,656 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:47:54,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572286742] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:47:54,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:47:54,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2024-10-12 21:47:54,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550073636] [2024-10-12 21:47:54,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:47:54,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:47:54,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:47:54,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:47:54,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:47:54,659 INFO L87 Difference]: Start difference. First operand 2278 states and 2991 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-12 21:47:55,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:47:55,039 INFO L93 Difference]: Finished difference Result 5874 states and 7490 transitions. [2024-10-12 21:47:55,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:47:55,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2024-10-12 21:47:55,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:47:55,065 INFO L225 Difference]: With dead ends: 5874 [2024-10-12 21:47:55,065 INFO L226 Difference]: Without dead ends: 4028 [2024-10-12 21:47:55,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:47:55,073 INFO L432 NwaCegarLoop]: 695 mSDtfsCounter, 57 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:47:55,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 1335 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:47:55,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4028 states. [2024-10-12 21:47:55,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4028 to 3988. [2024-10-12 21:47:55,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3988 states, 3074 states have (on average 1.2839947950553026) internal successors, (3947), 3126 states have internal predecessors, (3947), 476 states have call successors, (476), 330 states have call predecessors, (476), 436 states have return successors, (637), 533 states have call predecessors, (637), 472 states have call successors, (637) [2024-10-12 21:47:55,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3988 states to 3988 states and 5060 transitions. [2024-10-12 21:47:55,439 INFO L78 Accepts]: Start accepts. Automaton has 3988 states and 5060 transitions. Word has length 145 [2024-10-12 21:47:55,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:47:55,440 INFO L471 AbstractCegarLoop]: Abstraction has 3988 states and 5060 transitions. [2024-10-12 21:47:55,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-12 21:47:55,440 INFO L276 IsEmpty]: Start isEmpty. Operand 3988 states and 5060 transitions. [2024-10-12 21:47:55,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-12 21:47:55,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:47:55,444 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:47:55,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 21:47:55,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-12 21:47:55,649 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:47:55,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:47:55,650 INFO L85 PathProgramCache]: Analyzing trace with hash -2123416630, now seen corresponding path program 1 times [2024-10-12 21:47:55,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:47:55,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290894306] [2024-10-12 21:47:55,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:55,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:47:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:55,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:47:55,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:55,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:55,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:47:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:55,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:47:55,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:55,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:55,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:47:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:55,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 21:47:55,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:55,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 21:47:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:55,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 21:47:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:55,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 21:47:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:55,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 21:47:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:55,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:47:55,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:55,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 21:47:55,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:55,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 21:47:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:55,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-12 21:47:55,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:55,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-12 21:47:55,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:55,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:47:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:55,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:47:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:55,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-12 21:47:55,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:55,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-12 21:47:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:55,928 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-12 21:47:55,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:47:55,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290894306] [2024-10-12 21:47:55,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290894306] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:47:55,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791897227] [2024-10-12 21:47:55,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:55,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:47:55,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:47:55,931 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:47:55,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 21:47:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:56,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 21:47:56,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:47:56,405 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-10-12 21:47:56,405 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:47:56,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791897227] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:47:56,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:47:56,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2024-10-12 21:47:56,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727810695] [2024-10-12 21:47:56,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:47:56,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:47:56,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:47:56,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:47:56,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:47:56,407 INFO L87 Difference]: Start difference. First operand 3988 states and 5060 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-12 21:47:57,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:47:57,112 INFO L93 Difference]: Finished difference Result 11240 states and 14000 transitions. [2024-10-12 21:47:57,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:47:57,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 175 [2024-10-12 21:47:57,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:47:57,151 INFO L225 Difference]: With dead ends: 11240 [2024-10-12 21:47:57,151 INFO L226 Difference]: Without dead ends: 7614 [2024-10-12 21:47:57,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:47:57,165 INFO L432 NwaCegarLoop]: 661 mSDtfsCounter, 48 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:47:57,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 1304 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:47:57,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7614 states. [2024-10-12 21:47:57,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7614 to 7606. [2024-10-12 21:47:57,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7606 states, 5820 states have (on average 1.2570446735395189) internal successors, (7316), 5919 states have internal predecessors, (7316), 918 states have call successors, (918), 652 states have call predecessors, (918), 866 states have return successors, (1244), 1036 states have call predecessors, (1244), 914 states have call successors, (1244) [2024-10-12 21:47:57,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 9478 transitions. [2024-10-12 21:47:57,847 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 9478 transitions. Word has length 175 [2024-10-12 21:47:57,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:47:57,848 INFO L471 AbstractCegarLoop]: Abstraction has 7606 states and 9478 transitions. [2024-10-12 21:47:57,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-12 21:47:57,848 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 9478 transitions. [2024-10-12 21:47:57,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-12 21:47:57,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:47:57,852 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:47:57,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 21:47:58,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-12 21:47:58,057 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:47:58,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:47:58,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1777183880, now seen corresponding path program 1 times [2024-10-12 21:47:58,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:47:58,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454918083] [2024-10-12 21:47:58,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:58,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:47:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:58,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:47:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:58,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:58,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:47:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:58,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:47:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:58,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:47:58,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:58,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:47:58,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:58,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 21:47:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:58,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 21:47:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:58,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 21:47:58,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:58,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 21:47:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:58,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 21:47:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:58,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:47:58,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:58,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 21:47:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:58,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 21:47:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:58,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-12 21:47:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:58,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-12 21:47:58,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:58,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:47:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:58,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:47:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:58,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-12 21:47:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:58,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-12 21:47:58,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:58,294 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-12 21:47:58,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:47:58,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454918083] [2024-10-12 21:47:58,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454918083] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:47:58,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886913635] [2024-10-12 21:47:58,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:58,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:47:58,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:47:58,298 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:47:58,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 21:47:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:58,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 21:47:58,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:47:58,657 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-10-12 21:47:58,658 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:47:58,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886913635] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:47:58,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:47:58,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2024-10-12 21:47:58,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362945311] [2024-10-12 21:47:58,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:47:58,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:47:58,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:47:58,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:47:58,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:47:58,660 INFO L87 Difference]: Start difference. First operand 7606 states and 9478 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-12 21:47:59,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:47:59,239 INFO L93 Difference]: Finished difference Result 13592 states and 17150 transitions. [2024-10-12 21:47:59,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:47:59,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 175 [2024-10-12 21:47:59,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:47:59,253 INFO L225 Difference]: With dead ends: 13592 [2024-10-12 21:47:59,253 INFO L226 Difference]: Without dead ends: 354 [2024-10-12 21:47:59,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:47:59,282 INFO L432 NwaCegarLoop]: 645 mSDtfsCounter, 600 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:47:59,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 645 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:47:59,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-12 21:47:59,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2024-10-12 21:47:59,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 319 states have (on average 1.6394984326018809) internal successors, (523), 321 states have internal predecessors, (523), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-12 21:47:59,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 577 transitions. [2024-10-12 21:47:59,300 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 577 transitions. Word has length 175 [2024-10-12 21:47:59,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:47:59,300 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 577 transitions. [2024-10-12 21:47:59,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-12 21:47:59,300 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 577 transitions. [2024-10-12 21:47:59,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:47:59,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:47:59,302 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 21:47:59,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:47:59,504 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:47:59,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:47:59,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1388654792, now seen corresponding path program 1 times [2024-10-12 21:47:59,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:47:59,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939830554] [2024-10-12 21:47:59,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:47:59,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:47:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:59,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:47:59,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:59,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:47:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:59,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:47:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:59,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:47:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:59,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:47:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:47:59,691 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:59,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:47:59,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939830554] [2024-10-12 21:47:59,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939830554] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:47:59,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:47:59,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:47:59,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667084332] [2024-10-12 21:47:59,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:47:59,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:47:59,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:47:59,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:47:59,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:47:59,694 INFO L87 Difference]: Start difference. First operand 354 states and 577 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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:48:01,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:01,376 INFO L93 Difference]: Finished difference Result 833 states and 1380 transitions. [2024-10-12 21:48:01,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:48:01,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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 162 [2024-10-12 21:48:01,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:01,392 INFO L225 Difference]: With dead ends: 833 [2024-10-12 21:48:01,392 INFO L226 Difference]: Without dead ends: 484 [2024-10-12 21:48:01,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:48:01,394 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 995 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:01,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 651 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 21:48:01,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2024-10-12 21:48:01,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 354. [2024-10-12 21:48:01,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 319 states have (on average 1.6363636363636365) internal successors, (522), 321 states have internal predecessors, (522), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-12 21:48:01,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 576 transitions. [2024-10-12 21:48:01,471 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 576 transitions. Word has length 162 [2024-10-12 21:48:01,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:01,471 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 576 transitions. [2024-10-12 21:48:01,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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:48:01,473 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 576 transitions. [2024-10-12 21:48:01,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:48:01,474 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:01,474 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:01,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 21:48:01,475 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:01,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:01,475 INFO L85 PathProgramCache]: Analyzing trace with hash 407699978, now seen corresponding path program 1 times [2024-10-12 21:48:01,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:01,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016527560] [2024-10-12 21:48:01,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:01,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:01,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:01,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:48:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:01,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:48:01,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:01,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:48:01,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:01,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:48:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:01,701 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:48:01,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:01,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016527560] [2024-10-12 21:48:01,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016527560] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:01,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:01,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:48:01,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222155066] [2024-10-12 21:48:01,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:01,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:48:01,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:01,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:48:01,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:48:01,705 INFO L87 Difference]: Start difference. First operand 354 states and 576 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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:48:03,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:03,399 INFO L93 Difference]: Finished difference Result 825 states and 1363 transitions. [2024-10-12 21:48:03,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:48:03,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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 162 [2024-10-12 21:48:03,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:03,404 INFO L225 Difference]: With dead ends: 825 [2024-10-12 21:48:03,404 INFO L226 Difference]: Without dead ends: 484 [2024-10-12 21:48:03,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:48:03,406 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 986 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:03,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1010 Valid, 649 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 21:48:03,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2024-10-12 21:48:03,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 354. [2024-10-12 21:48:03,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 319 states have (on average 1.6332288401253918) internal successors, (521), 321 states have internal predecessors, (521), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-12 21:48:03,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 575 transitions. [2024-10-12 21:48:03,433 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 575 transitions. Word has length 162 [2024-10-12 21:48:03,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:03,433 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 575 transitions. [2024-10-12 21:48:03,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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:48:03,434 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 575 transitions. [2024-10-12 21:48:03,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:48:03,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:03,435 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:03,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 21:48:03,435 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:03,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:03,436 INFO L85 PathProgramCache]: Analyzing trace with hash 672347468, now seen corresponding path program 1 times [2024-10-12 21:48:03,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:03,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030267128] [2024-10-12 21:48:03,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:03,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:03,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:03,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:03,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:48:03,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:03,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:48:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:03,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:48:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:03,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:48:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:03,675 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:48:03,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:03,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030267128] [2024-10-12 21:48:03,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030267128] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:03,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:03,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:48:03,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790878439] [2024-10-12 21:48:03,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:03,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:48:03,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:03,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:48:03,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:48:03,678 INFO L87 Difference]: Start difference. First operand 354 states and 575 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 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:48:06,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:06,131 INFO L93 Difference]: Finished difference Result 1303 states and 2165 transitions. [2024-10-12 21:48:06,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:48:06,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 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 162 [2024-10-12 21:48:06,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:06,137 INFO L225 Difference]: With dead ends: 1303 [2024-10-12 21:48:06,137 INFO L226 Difference]: Without dead ends: 968 [2024-10-12 21:48:06,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:48:06,139 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 1498 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 2297 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 2413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 2297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:06,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1517 Valid, 1097 Invalid, 2413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 2297 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-12 21:48:06,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2024-10-12 21:48:06,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 707. [2024-10-12 21:48:06,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 644 states have (on average 1.6444099378881987) internal successors, (1059), 647 states have internal predecessors, (1059), 49 states have call successors, (49), 13 states have call predecessors, (49), 13 states have return successors, (50), 47 states have call predecessors, (50), 47 states have call successors, (50) [2024-10-12 21:48:06,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1158 transitions. [2024-10-12 21:48:06,210 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1158 transitions. Word has length 162 [2024-10-12 21:48:06,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:06,210 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 1158 transitions. [2024-10-12 21:48:06,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 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:48:06,211 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1158 transitions. [2024-10-12 21:48:06,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:48:06,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:06,212 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:06,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 21:48:06,213 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:06,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:06,213 INFO L85 PathProgramCache]: Analyzing trace with hash 516366926, now seen corresponding path program 1 times [2024-10-12 21:48:06,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:06,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125397973] [2024-10-12 21:48:06,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:06,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:06,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:06,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:06,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:48:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:06,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:48:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:06,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:48:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:06,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:48:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:06,487 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:48:06,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:06,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125397973] [2024-10-12 21:48:06,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125397973] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:06,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:06,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:48:06,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150375381] [2024-10-12 21:48:06,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:06,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:48:06,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:06,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:48:06,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:48:06,489 INFO L87 Difference]: Start difference. First operand 707 states and 1158 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:48:10,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:10,124 INFO L93 Difference]: Finished difference Result 2160 states and 3597 transitions. [2024-10-12 21:48:10,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:48:10,125 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:48:10,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:10,134 INFO L225 Difference]: With dead ends: 2160 [2024-10-12 21:48:10,134 INFO L226 Difference]: Without dead ends: 1472 [2024-10-12 21:48:10,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:48:10,139 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 1539 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 3739 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1558 SdHoareTripleChecker+Valid, 2097 SdHoareTripleChecker+Invalid, 3805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 3739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:10,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1558 Valid, 2097 Invalid, 3805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 3739 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-12 21:48:10,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2024-10-12 21:48:10,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 1034. [2024-10-12 21:48:10,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 943 states have (on average 1.6383881230116648) internal successors, (1545), 947 states have internal predecessors, (1545), 70 states have call successors, (70), 19 states have call predecessors, (70), 20 states have return successors, (73), 69 states have call predecessors, (73), 68 states have call successors, (73) [2024-10-12 21:48:10,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1688 transitions. [2024-10-12 21:48:10,215 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1688 transitions. Word has length 162 [2024-10-12 21:48:10,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:10,216 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1688 transitions. [2024-10-12 21:48:10,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:48:10,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1688 transitions. [2024-10-12 21:48:10,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:48:10,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:10,219 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:10,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 21:48:10,219 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:10,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:10,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1271502896, now seen corresponding path program 1 times [2024-10-12 21:48:10,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:10,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177273427] [2024-10-12 21:48:10,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:10,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:10,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:10,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:10,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:48:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:10,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:48:10,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:10,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:48:10,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:10,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:48:10,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:10,485 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:48:10,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:10,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177273427] [2024-10-12 21:48:10,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177273427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:10,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:10,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:48:10,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433607150] [2024-10-12 21:48:10,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:10,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:48:10,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:10,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:48:10,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:48:10,488 INFO L87 Difference]: Start difference. First operand 1034 states and 1688 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:48:14,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:14,231 INFO L93 Difference]: Finished difference Result 3414 states and 5675 transitions. [2024-10-12 21:48:14,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:48:14,234 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:48:14,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:14,245 INFO L225 Difference]: With dead ends: 3414 [2024-10-12 21:48:14,246 INFO L226 Difference]: Without dead ends: 2399 [2024-10-12 21:48:14,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:48:14,250 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 1534 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 3714 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1553 SdHoareTripleChecker+Valid, 2095 SdHoareTripleChecker+Invalid, 3782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:14,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1553 Valid, 2095 Invalid, 3782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3714 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-12 21:48:14,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2399 states. [2024-10-12 21:48:14,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2399 to 1691. [2024-10-12 21:48:14,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1691 states, 1544 states have (on average 1.633419689119171) internal successors, (2522), 1550 states have internal predecessors, (2522), 112 states have call successors, (112), 31 states have call predecessors, (112), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-10-12 21:48:14,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 2757 transitions. [2024-10-12 21:48:14,371 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 2757 transitions. Word has length 162 [2024-10-12 21:48:14,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:14,372 INFO L471 AbstractCegarLoop]: Abstraction has 1691 states and 2757 transitions. [2024-10-12 21:48:14,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:48:14,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2757 transitions. [2024-10-12 21:48:14,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:48:14,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:14,374 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:14,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 21:48:14,375 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:14,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:14,375 INFO L85 PathProgramCache]: Analyzing trace with hash 887581198, now seen corresponding path program 1 times [2024-10-12 21:48:14,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:14,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149013163] [2024-10-12 21:48:14,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:14,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:14,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:14,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:48:14,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:14,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:48:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:14,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:48:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:14,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:48:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:14,626 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:48:14,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:14,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149013163] [2024-10-12 21:48:14,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149013163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:14,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:14,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:48:14,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045213506] [2024-10-12 21:48:14,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:14,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:48:14,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:14,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:48:14,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:48:14,629 INFO L87 Difference]: Start difference. First operand 1691 states and 2757 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:48:18,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:18,146 INFO L93 Difference]: Finished difference Result 5825 states and 9652 transitions. [2024-10-12 21:48:18,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:48:18,146 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:48:18,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:18,165 INFO L225 Difference]: With dead ends: 5825 [2024-10-12 21:48:18,166 INFO L226 Difference]: Without dead ends: 4153 [2024-10-12 21:48:18,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:48:18,173 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 1533 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 3701 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1552 SdHoareTripleChecker+Valid, 2095 SdHoareTripleChecker+Invalid, 3769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:18,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1552 Valid, 2095 Invalid, 3769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3701 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-12 21:48:18,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4153 states. [2024-10-12 21:48:18,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4153 to 3008. [2024-10-12 21:48:18,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 2749 states have (on average 1.6296835212804657) internal successors, (4480), 2759 states have internal predecessors, (4480), 196 states have call successors, (196), 55 states have call predecessors, (196), 62 states have return successors, (229), 201 states have call predecessors, (229), 194 states have call successors, (229) [2024-10-12 21:48:18,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4905 transitions. [2024-10-12 21:48:18,458 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 4905 transitions. Word has length 162 [2024-10-12 21:48:18,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:18,458 INFO L471 AbstractCegarLoop]: Abstraction has 3008 states and 4905 transitions. [2024-10-12 21:48:18,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:48:18,459 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 4905 transitions. [2024-10-12 21:48:18,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:48:18,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:18,461 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:18,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 21:48:18,462 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:18,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:18,462 INFO L85 PathProgramCache]: Analyzing trace with hash 957229072, now seen corresponding path program 1 times [2024-10-12 21:48:18,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:18,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076247918] [2024-10-12 21:48:18,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:18,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:18,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:18,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:18,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:18,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:48:18,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:18,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:48:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:18,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:48:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:18,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:48:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:18,713 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:48:18,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:18,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076247918] [2024-10-12 21:48:18,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076247918] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:18,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:18,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:48:18,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330851683] [2024-10-12 21:48:18,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:18,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:48:18,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:18,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:48:18,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:48:18,716 INFO L87 Difference]: Start difference. First operand 3008 states and 4905 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:48:22,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:22,404 INFO L93 Difference]: Finished difference Result 10648 states and 17626 transitions. [2024-10-12 21:48:22,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:48:22,405 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:48:22,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:22,439 INFO L225 Difference]: With dead ends: 10648 [2024-10-12 21:48:22,439 INFO L226 Difference]: Without dead ends: 7659 [2024-10-12 21:48:22,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:48:22,452 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 1532 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 3688 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1551 SdHoareTripleChecker+Valid, 2095 SdHoareTripleChecker+Invalid, 3756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:22,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1551 Valid, 2095 Invalid, 3756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3688 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-12 21:48:22,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7659 states. [2024-10-12 21:48:22,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7659 to 5649. [2024-10-12 21:48:22,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5649 states, 5166 states have (on average 1.627177700348432) internal successors, (8406), 5184 states have internal predecessors, (8406), 364 states have call successors, (364), 103 states have call predecessors, (364), 118 states have return successors, (459), 377 states have call predecessors, (459), 362 states have call successors, (459) [2024-10-12 21:48:22,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5649 states to 5649 states and 9229 transitions. [2024-10-12 21:48:22,943 INFO L78 Accepts]: Start accepts. Automaton has 5649 states and 9229 transitions. Word has length 162 [2024-10-12 21:48:22,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:22,944 INFO L471 AbstractCegarLoop]: Abstraction has 5649 states and 9229 transitions. [2024-10-12 21:48:22,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:48:22,944 INFO L276 IsEmpty]: Start isEmpty. Operand 5649 states and 9229 transitions. [2024-10-12 21:48:22,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:48:22,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:22,950 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:22,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 21:48:22,950 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:22,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:22,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1375117774, now seen corresponding path program 1 times [2024-10-12 21:48:22,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:22,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624558314] [2024-10-12 21:48:22,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:22,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:23,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:23,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:23,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:48:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:23,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:48:23,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:23,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:48:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:23,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:48:23,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:23,204 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:48:23,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:23,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624558314] [2024-10-12 21:48:23,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624558314] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:23,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:23,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:48:23,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007204601] [2024-10-12 21:48:23,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:23,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:48:23,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:23,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:48:23,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:48:23,207 INFO L87 Difference]: Start difference. First operand 5649 states and 9229 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:48:27,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:27,031 INFO L93 Difference]: Finished difference Result 20295 states and 33636 transitions. [2024-10-12 21:48:27,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:48:27,032 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:48:27,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:27,084 INFO L225 Difference]: With dead ends: 20295 [2024-10-12 21:48:27,084 INFO L226 Difference]: Without dead ends: 14665 [2024-10-12 21:48:27,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:48:27,101 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 1531 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 3675 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1550 SdHoareTripleChecker+Valid, 2095 SdHoareTripleChecker+Invalid, 3743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:27,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1550 Valid, 2095 Invalid, 3743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3675 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 21:48:27,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14665 states. [2024-10-12 21:48:27,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14665 to 10946. [2024-10-12 21:48:27,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10946 states, 10015 states have (on average 1.6255616575137295) internal successors, (16280), 10049 states have internal predecessors, (16280), 700 states have call successors, (700), 199 states have call predecessors, (700), 230 states have return successors, (973), 729 states have call predecessors, (973), 698 states have call successors, (973) [2024-10-12 21:48:27,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10946 states to 10946 states and 17953 transitions. [2024-10-12 21:48:27,913 INFO L78 Accepts]: Start accepts. Automaton has 10946 states and 17953 transitions. Word has length 162 [2024-10-12 21:48:27,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:27,914 INFO L471 AbstractCegarLoop]: Abstraction has 10946 states and 17953 transitions. [2024-10-12 21:48:27,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:48:27,914 INFO L276 IsEmpty]: Start isEmpty. Operand 10946 states and 17953 transitions. [2024-10-12 21:48:27,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:48:27,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:27,925 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:27,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 21:48:27,926 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:27,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:27,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1520895920, now seen corresponding path program 1 times [2024-10-12 21:48:27,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:27,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861349235] [2024-10-12 21:48:27,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:27,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:28,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:28,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:28,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:48:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:28,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:48:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:28,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:48:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:28,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:48:28,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:28,204 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:48:28,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:28,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861349235] [2024-10-12 21:48:28,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861349235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:28,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:28,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:48:28,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920981895] [2024-10-12 21:48:28,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:28,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:48:28,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:28,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:48:28,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:48:28,208 INFO L87 Difference]: Start difference. First operand 10946 states and 17953 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:48:33,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:33,074 INFO L93 Difference]: Finished difference Result 39590 states and 65850 transitions. [2024-10-12 21:48:33,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:48:33,075 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:48:33,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:33,204 INFO L225 Difference]: With dead ends: 39590 [2024-10-12 21:48:33,205 INFO L226 Difference]: Without dead ends: 28663 [2024-10-12 21:48:33,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:48:33,248 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 1530 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 3662 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1549 SdHoareTripleChecker+Valid, 2095 SdHoareTripleChecker+Invalid, 3730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:33,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1549 Valid, 2095 Invalid, 3730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3662 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-12 21:48:33,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28663 states. [2024-10-12 21:48:34,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28663 to 21571. [2024-10-12 21:48:34,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21571 states, 19744 states have (on average 1.6244935170178283) internal successors, (32074), 19810 states have internal predecessors, (32074), 1372 states have call successors, (1372), 391 states have call predecessors, (1372), 454 states have return successors, (2163), 1433 states have call predecessors, (2163), 1370 states have call successors, (2163) [2024-10-12 21:48:34,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21571 states to 21571 states and 35609 transitions. [2024-10-12 21:48:34,949 INFO L78 Accepts]: Start accepts. Automaton has 21571 states and 35609 transitions. Word has length 162 [2024-10-12 21:48:34,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:48:34,949 INFO L471 AbstractCegarLoop]: Abstraction has 21571 states and 35609 transitions. [2024-10-12 21:48:34,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:48:34,950 INFO L276 IsEmpty]: Start isEmpty. Operand 21571 states and 35609 transitions. [2024-10-12 21:48:34,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:48:34,966 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:48:34,966 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:34,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 21:48:34,967 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:48:34,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:48:34,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1156630926, now seen corresponding path program 1 times [2024-10-12 21:48:34,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:48:34,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989011310] [2024-10-12 21:48:34,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:48:34,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:48:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:35,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:48:35,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:35,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:48:35,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:35,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:48:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:35,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:48:35,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:35,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:48:35,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:48:35,201 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:48:35,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:48:35,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989011310] [2024-10-12 21:48:35,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989011310] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:48:35,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:48:35,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:48:35,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9473342] [2024-10-12 21:48:35,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:48:35,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:48:35,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:48:35,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:48:35,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:48:35,203 INFO L87 Difference]: Start difference. First operand 21571 states and 35609 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:48:41,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:48:41,245 INFO L93 Difference]: Finished difference Result 78181 states and 130880 transitions. [2024-10-12 21:48:41,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:48:41,245 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:48:41,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:48:41,592 INFO L225 Difference]: With dead ends: 78181 [2024-10-12 21:48:41,592 INFO L226 Difference]: Without dead ends: 56629 [2024-10-12 21:48:41,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:48:41,714 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 1630 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 3009 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1649 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 3125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 3009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:48:41,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1649 Valid, 1331 Invalid, 3125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 3009 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-12 21:48:41,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56629 states.