./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.07.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.07.cil-2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d7b83251f9a608d2befdac3ab06beaba9889f30d8ab1cb865fc88ebdabcb52dd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 05:03:28,584 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 05:03:28,659 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 05:03:28,664 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 05:03:28,665 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 05:03:28,686 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 05:03:28,687 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 05:03:28,688 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 05:03:28,689 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 05:03:28,690 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 05:03:28,690 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 05:03:28,691 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 05:03:28,691 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 05:03:28,692 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 05:03:28,692 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 05:03:28,694 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 05:03:28,694 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 05:03:28,695 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 05:03:28,695 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 05:03:28,695 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 05:03:28,695 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 05:03:28,699 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 05:03:28,700 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 05:03:28,700 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 05:03:28,700 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 05:03:28,700 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 05:03:28,701 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 05:03:28,701 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 05:03:28,701 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 05:03:28,702 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 05:03:28,702 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 05:03:28,702 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 05:03:28,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:03:28,703 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 05:03:28,703 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 05:03:28,704 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 05:03:28,705 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 05:03:28,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 05:03:28,705 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 05:03:28,705 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 05:03:28,705 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 05:03:28,706 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 05:03:28,706 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d7b83251f9a608d2befdac3ab06beaba9889f30d8ab1cb865fc88ebdabcb52dd [2024-10-11 05:03:28,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 05:03:28,999 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 05:03:29,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 05:03:29,004 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 05:03:29,005 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 05:03:29,006 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.07.cil-2.c [2024-10-11 05:03:30,437 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 05:03:30,648 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 05:03:30,648 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.07.cil-2.c [2024-10-11 05:03:30,663 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5a4f6bda7/4f3e82928dee4f8b81f829cb7fe6165a/FLAG3b0b0b7fe [2024-10-11 05:03:30,677 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5a4f6bda7/4f3e82928dee4f8b81f829cb7fe6165a [2024-10-11 05:03:30,679 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 05:03:30,682 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 05:03:30,684 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 05:03:30,684 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 05:03:30,689 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 05:03:30,690 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:03:30" (1/1) ... [2024-10-11 05:03:30,692 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ba5b2b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:03:30, skipping insertion in model container [2024-10-11 05:03:30,693 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:03:30" (1/1) ... [2024-10-11 05:03:30,739 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 05:03:30,945 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.07.cil-2.c[914,927] [2024-10-11 05:03:31,006 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.07.cil-2.c[7115,7128] [2024-10-11 05:03:31,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:03:31,115 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 05:03:31,128 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.07.cil-2.c[914,927] [2024-10-11 05:03: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_2.cil-1+token_ring.07.cil-2.c[7115,7128] [2024-10-11 05:03:31,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:03:31,236 INFO L204 MainTranslator]: Completed translation [2024-10-11 05:03:31,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:03:31 WrapperNode [2024-10-11 05:03:31,236 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 05:03:31,237 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 05:03:31,238 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 05:03:31,238 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 05:03:31,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:03:31" (1/1) ... [2024-10-11 05:03:31,255 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:03:31" (1/1) ... [2024-10-11 05:03:31,299 INFO L138 Inliner]: procedures = 67, calls = 79, calls flagged for inlining = 35, calls inlined = 35, statements flattened = 774 [2024-10-11 05:03:31,300 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 05:03:31,301 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 05:03:31,301 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 05:03:31,301 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 05:03:31,314 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:03:31" (1/1) ... [2024-10-11 05:03:31,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:03:31" (1/1) ... [2024-10-11 05:03:31,320 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:03:31" (1/1) ... [2024-10-11 05:03:31,339 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 05:03:31,339 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:03:31" (1/1) ... [2024-10-11 05:03:31,340 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:03:31" (1/1) ... [2024-10-11 05:03:31,351 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:03:31" (1/1) ... [2024-10-11 05:03:31,361 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:03:31" (1/1) ... [2024-10-11 05:03:31,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:03:31" (1/1) ... [2024-10-11 05:03:31,367 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:03:31" (1/1) ... [2024-10-11 05:03:31,371 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 05:03:31,372 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 05:03:31,372 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 05:03:31,372 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 05:03:31,373 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:03:31" (1/1) ... [2024-10-11 05:03:31,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:03:31,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:03:31,424 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 05:03:31,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 05:03:31,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 05:03:31,482 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 05:03:31,483 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 05:03:31,483 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-11 05:03:31,485 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-11 05:03:31,485 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-11 05:03:31,485 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-11 05:03:31,486 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-11 05:03:31,486 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-11 05:03:31,486 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-10-11 05:03:31,486 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-10-11 05:03:31,486 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-11 05:03:31,486 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-11 05:03:31,487 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-11 05:03:31,487 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-11 05:03:31,487 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-10-11 05:03:31,487 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-10-11 05:03:31,487 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-11 05:03:31,487 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-11 05:03:31,487 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-10-11 05:03:31,487 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-10-11 05:03:31,487 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-11 05:03:31,488 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-11 05:03:31,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 05:03:31,488 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-11 05:03:31,488 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-11 05:03:31,488 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-10-11 05:03:31,488 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-10-11 05:03:31,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 05:03:31,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 05:03:31,488 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-11 05:03:31,488 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-11 05:03:31,489 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-10-11 05:03:31,489 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-10-11 05:03:31,642 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 05:03:31,646 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 05:03:32,447 INFO L? ?]: Removed 101 outVars from TransFormulas that were not future-live. [2024-10-11 05:03:32,448 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 05:03:32,530 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 05:03:32,530 INFO L314 CfgBuilder]: Removed 14 assume(true) statements. [2024-10-11 05:03:32,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:03:32 BoogieIcfgContainer [2024-10-11 05:03:32,531 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 05:03:32,536 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 05:03:32,537 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 05:03:32,540 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 05:03:32,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:03:30" (1/3) ... [2024-10-11 05:03:32,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fea5949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:03:32, skipping insertion in model container [2024-10-11 05:03:32,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:03:31" (2/3) ... [2024-10-11 05:03:32,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fea5949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:03:32, skipping insertion in model container [2024-10-11 05:03:32,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:03:32" (3/3) ... [2024-10-11 05:03:32,543 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.07.cil-2.c [2024-10-11 05:03:32,559 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 05:03:32,559 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 05:03:32,638 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 05:03:32,647 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;@5413ce37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 05:03:32,647 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 05:03:32,654 INFO L276 IsEmpty]: Start isEmpty. Operand has 332 states, 277 states have (on average 1.6967509025270757) internal successors, (470), 285 states have internal predecessors, (470), 37 states have call successors, (37), 15 states have call predecessors, (37), 15 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-11 05:03:32,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:03:32,665 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:32,665 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-11 05:03:32,666 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:32,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:32,674 INFO L85 PathProgramCache]: Analyzing trace with hash 2104233725, now seen corresponding path program 1 times [2024-10-11 05:03:32,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:32,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743657035] [2024-10-11 05:03:32,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:32,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:33,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:33,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:33,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:33,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:33,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:33,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:33,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:33,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:33,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:33,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:33,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:33,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743657035] [2024-10-11 05:03:33,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743657035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:33,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:33,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:03:33,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889324892] [2024-10-11 05:03:33,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:33,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:03:33,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:33,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:03:33,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:03:33,170 INFO L87 Difference]: Start difference. First operand has 332 states, 277 states have (on average 1.6967509025270757) internal successors, (470), 285 states have internal predecessors, (470), 37 states have call successors, (37), 15 states have call predecessors, (37), 15 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 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-11 05:03:34,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:34,243 INFO L93 Difference]: Finished difference Result 662 states and 1082 transitions. [2024-10-11 05:03:34,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 05:03:34,247 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 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 58 [2024-10-11 05:03:34,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:34,264 INFO L225 Difference]: With dead ends: 662 [2024-10-11 05:03:34,265 INFO L226 Difference]: Without dead ends: 343 [2024-10-11 05:03:34,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:03:34,277 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 518 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:34,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 1055 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:03:34,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-10-11 05:03:34,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 326. [2024-10-11 05:03:34,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 274 states have (on average 1.583941605839416) internal successors, (434), 279 states have internal predecessors, (434), 37 states have call successors, (37), 15 states have call predecessors, (37), 13 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-11 05:03:34,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 504 transitions. [2024-10-11 05:03:34,387 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 504 transitions. Word has length 58 [2024-10-11 05:03:34,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:34,388 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 504 transitions. [2024-10-11 05:03:34,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 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-11 05:03:34,389 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 504 transitions. [2024-10-11 05:03:34,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:03:34,392 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:34,392 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-11 05:03:34,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 05:03:34,393 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:34,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:34,395 INFO L85 PathProgramCache]: Analyzing trace with hash -162147461, now seen corresponding path program 1 times [2024-10-11 05:03:34,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:34,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672920214] [2024-10-11 05:03:34,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:34,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:34,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:34,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:34,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:34,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:34,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:34,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:34,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:34,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:34,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:34,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:34,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672920214] [2024-10-11 05:03:34,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672920214] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:34,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:34,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:03:34,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364985701] [2024-10-11 05:03:34,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:34,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:03:34,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:34,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:03:34,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:03:34,704 INFO L87 Difference]: Start difference. First operand 326 states and 504 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:03:35,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:35,795 INFO L93 Difference]: Finished difference Result 532 states and 801 transitions. [2024-10-11 05:03:35,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:03:35,795 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2024-10-11 05:03:35,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:35,800 INFO L225 Difference]: With dead ends: 532 [2024-10-11 05:03:35,800 INFO L226 Difference]: Without dead ends: 451 [2024-10-11 05:03:35,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:03:35,803 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 626 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 1310 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:35,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 1310 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:03:35,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2024-10-11 05:03:35,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 414. [2024-10-11 05:03:35,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 342 states have (on average 1.5497076023391814) internal successors, (530), 349 states have internal predecessors, (530), 48 states have call successors, (48), 22 states have call predecessors, (48), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2024-10-11 05:03:35,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 627 transitions. [2024-10-11 05:03:35,844 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 627 transitions. Word has length 58 [2024-10-11 05:03:35,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:35,844 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 627 transitions. [2024-10-11 05:03:35,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:03:35,845 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 627 transitions. [2024-10-11 05:03:35,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:03:35,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:35,847 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-11 05:03:35,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 05:03:35,848 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:35,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:35,848 INFO L85 PathProgramCache]: Analyzing trace with hash -296381125, now seen corresponding path program 1 times [2024-10-11 05:03:35,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:35,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464109999] [2024-10-11 05:03:35,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:35,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:35,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:35,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:35,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:36,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:36,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:36,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:36,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:36,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:36,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:36,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:36,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:36,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:36,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:36,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:36,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:36,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464109999] [2024-10-11 05:03:36,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464109999] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:36,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:36,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:03:36,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438734355] [2024-10-11 05:03:36,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:36,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:03:36,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:36,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:03:36,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:03:36,049 INFO L87 Difference]: Start difference. First operand 414 states and 627 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:03:37,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:37,251 INFO L93 Difference]: Finished difference Result 734 states and 1076 transitions. [2024-10-11 05:03:37,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 05:03:37,252 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2024-10-11 05:03:37,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:37,259 INFO L225 Difference]: With dead ends: 734 [2024-10-11 05:03:37,259 INFO L226 Difference]: Without dead ends: 572 [2024-10-11 05:03:37,261 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-11 05:03:37,264 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 1201 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1228 SdHoareTripleChecker+Valid, 1310 SdHoareTripleChecker+Invalid, 1506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:37,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1228 Valid, 1310 Invalid, 1506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 1345 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:03:37,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2024-10-11 05:03:37,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 502. [2024-10-11 05:03:37,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 410 states have (on average 1.524390243902439) internal successors, (625), 419 states have internal predecessors, (625), 59 states have call successors, (59), 29 states have call predecessors, (59), 31 states have return successors, (68), 57 states have call predecessors, (68), 55 states have call successors, (68) [2024-10-11 05:03:37,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 752 transitions. [2024-10-11 05:03:37,323 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 752 transitions. Word has length 58 [2024-10-11 05:03:37,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:37,326 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 752 transitions. [2024-10-11 05:03:37,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:03:37,326 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 752 transitions. [2024-10-11 05:03:37,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:03:37,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:37,333 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-11 05:03:37,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 05:03:37,334 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:37,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:37,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1631891577, now seen corresponding path program 1 times [2024-10-11 05:03:37,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:37,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104151961] [2024-10-11 05:03:37,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:37,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:37,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:37,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:37,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:37,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:37,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:37,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:37,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:37,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:37,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:37,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:37,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:37,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:37,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:37,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:37,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104151961] [2024-10-11 05:03:37,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104151961] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:37,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:37,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:03:37,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115330006] [2024-10-11 05:03:37,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:37,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:03:37,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:37,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:03:37,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:03:37,528 INFO L87 Difference]: Start difference. First operand 502 states and 752 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-11 05:03:38,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:38,654 INFO L93 Difference]: Finished difference Result 796 states and 1170 transitions. [2024-10-11 05:03:38,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 05:03:38,655 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-11 05:03:38,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:38,660 INFO L225 Difference]: With dead ends: 796 [2024-10-11 05:03:38,660 INFO L226 Difference]: Without dead ends: 552 [2024-10-11 05:03:38,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:03:38,663 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 423 mSDsluCounter, 1544 mSDsCounter, 0 mSdLazyCounter, 1587 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 1816 SdHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:38,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 1816 Invalid, 1666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1587 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:03:38,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-11 05:03:38,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 514. [2024-10-11 05:03:38,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 419 states have (on average 1.5131264916467781) internal successors, (634), 428 states have internal predecessors, (634), 59 states have call successors, (59), 29 states have call predecessors, (59), 34 states have return successors, (71), 60 states have call predecessors, (71), 55 states have call successors, (71) [2024-10-11 05:03:38,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 764 transitions. [2024-10-11 05:03:38,727 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 764 transitions. Word has length 58 [2024-10-11 05:03:38,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:38,728 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 764 transitions. [2024-10-11 05:03:38,728 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-11 05:03:38,729 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 764 transitions. [2024-10-11 05:03:38,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:03:38,731 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:38,731 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-11 05:03:38,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 05:03:38,732 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:38,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:38,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1569851963, now seen corresponding path program 1 times [2024-10-11 05:03:38,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:38,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738455693] [2024-10-11 05:03:38,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:38,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:38,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:38,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:38,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:38,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:38,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:38,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:38,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:38,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:38,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:38,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:38,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:38,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:38,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:38,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:38,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:38,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738455693] [2024-10-11 05:03:38,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738455693] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:38,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:38,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:03:38,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119642896] [2024-10-11 05:03:38,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:38,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:03:38,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:38,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:03:38,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:03:38,928 INFO L87 Difference]: Start difference. First operand 514 states and 764 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-11 05:03:39,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:39,984 INFO L93 Difference]: Finished difference Result 802 states and 1165 transitions. [2024-10-11 05:03:39,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:03:39,985 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-11 05:03:39,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:39,988 INFO L225 Difference]: With dead ends: 802 [2024-10-11 05:03:39,989 INFO L226 Difference]: Without dead ends: 546 [2024-10-11 05:03:39,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-11 05:03:39,991 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 628 mSDsluCounter, 1343 mSDsCounter, 0 mSdLazyCounter, 1500 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 1614 SdHoareTripleChecker+Invalid, 1622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:39,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 1614 Invalid, 1622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1500 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:03:39,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2024-10-11 05:03:40,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 518. [2024-10-11 05:03:40,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 422 states have (on average 1.504739336492891) internal successors, (635), 431 states have internal predecessors, (635), 59 states have call successors, (59), 29 states have call predecessors, (59), 35 states have return successors, (72), 61 states have call predecessors, (72), 55 states have call successors, (72) [2024-10-11 05:03:40,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 766 transitions. [2024-10-11 05:03:40,032 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 766 transitions. Word has length 58 [2024-10-11 05:03:40,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:40,032 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 766 transitions. [2024-10-11 05:03:40,033 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-11 05:03:40,033 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 766 transitions. [2024-10-11 05:03:40,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:03:40,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:40,035 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-11 05:03:40,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 05:03:40,035 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:40,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:40,036 INFO L85 PathProgramCache]: Analyzing trace with hash -674131335, now seen corresponding path program 1 times [2024-10-11 05:03:40,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:40,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689185973] [2024-10-11 05:03:40,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:40,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:40,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:40,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:40,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:40,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:40,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:40,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:40,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:40,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:40,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:40,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:40,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:40,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:40,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:40,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:40,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689185973] [2024-10-11 05:03:40,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689185973] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:40,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:40,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 05:03:40,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073995434] [2024-10-11 05:03:40,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:40,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 05:03:40,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:40,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 05:03:40,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:03:40,212 INFO L87 Difference]: Start difference. First operand 518 states and 766 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-11 05:03:42,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:42,011 INFO L93 Difference]: Finished difference Result 1770 states and 2503 transitions. [2024-10-11 05:03:42,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-11 05:03:42,012 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-11 05:03:42,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:42,021 INFO L225 Difference]: With dead ends: 1770 [2024-10-11 05:03:42,022 INFO L226 Difference]: Without dead ends: 1492 [2024-10-11 05:03:42,024 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-11 05:03:42,027 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 2636 mSDsluCounter, 1473 mSDsCounter, 0 mSdLazyCounter, 1677 mSolverCounterSat, 528 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2651 SdHoareTripleChecker+Valid, 1781 SdHoareTripleChecker+Invalid, 2205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 528 IncrementalHoareTripleChecker+Valid, 1677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:42,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2651 Valid, 1781 Invalid, 2205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [528 Valid, 1677 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 05:03:42,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2024-10-11 05:03:42,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1365. [2024-10-11 05:03:42,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 1080 states have (on average 1.4064814814814814) internal successors, (1519), 1104 states have internal predecessors, (1519), 147 states have call successors, (147), 112 states have call predecessors, (147), 136 states have return successors, (189), 151 states have call predecessors, (189), 143 states have call successors, (189) [2024-10-11 05:03:42,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 1855 transitions. [2024-10-11 05:03:42,170 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 1855 transitions. Word has length 58 [2024-10-11 05:03:42,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:42,171 INFO L471 AbstractCegarLoop]: Abstraction has 1365 states and 1855 transitions. [2024-10-11 05:03:42,173 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-11 05:03:42,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 1855 transitions. [2024-10-11 05:03:42,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 05:03:42,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:42,176 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:03:42,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 05:03:42,177 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:42,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:42,177 INFO L85 PathProgramCache]: Analyzing trace with hash -216401402, now seen corresponding path program 1 times [2024-10-11 05:03:42,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:42,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921547432] [2024-10-11 05:03:42,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:42,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:42,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:42,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:42,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:42,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:42,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:42,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:42,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:42,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:42,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:42,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:42,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:42,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:42,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921547432] [2024-10-11 05:03:42,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921547432] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:42,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:42,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:03:42,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840005481] [2024-10-11 05:03:42,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:42,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:03:42,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:42,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:03:42,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:03:42,359 INFO L87 Difference]: Start difference. First operand 1365 states and 1855 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:03:43,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:43,540 INFO L93 Difference]: Finished difference Result 2539 states and 3336 transitions. [2024-10-11 05:03:43,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 05:03:43,540 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2024-10-11 05:03:43,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:43,550 INFO L225 Difference]: With dead ends: 2539 [2024-10-11 05:03:43,550 INFO L226 Difference]: Without dead ends: 1627 [2024-10-11 05:03:43,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2024-10-11 05:03:43,556 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 1219 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1243 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 1389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:43,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1243 Valid, 1110 Invalid, 1389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:03:43,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2024-10-11 05:03:43,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1310. [2024-10-11 05:03:43,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1310 states, 1041 states have (on average 1.4024975984630164) internal successors, (1460), 1060 states have internal predecessors, (1460), 141 states have call successors, (141), 107 states have call predecessors, (141), 126 states have return successors, (174), 144 states have call predecessors, (174), 137 states have call successors, (174) [2024-10-11 05:03:43,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1775 transitions. [2024-10-11 05:03:43,706 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1775 transitions. Word has length 59 [2024-10-11 05:03:43,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:43,707 INFO L471 AbstractCegarLoop]: Abstraction has 1310 states and 1775 transitions. [2024-10-11 05:03:43,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:03:43,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1775 transitions. [2024-10-11 05:03:43,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 05:03:43,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:43,709 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:03:43,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 05:03:43,710 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:43,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:43,711 INFO L85 PathProgramCache]: Analyzing trace with hash 2453316, now seen corresponding path program 1 times [2024-10-11 05:03:43,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:43,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699556963] [2024-10-11 05:03:43,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:43,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:43,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:43,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:43,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:43,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:43,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:43,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:43,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:43,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:43,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:43,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:43,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:43,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:43,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699556963] [2024-10-11 05:03:43,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699556963] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:43,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:43,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:03:43,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791861610] [2024-10-11 05:03:43,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:43,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:03:43,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:43,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:03:43,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:43,830 INFO L87 Difference]: Start difference. First operand 1310 states and 1775 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:03:44,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:44,786 INFO L93 Difference]: Finished difference Result 3482 states and 4582 transitions. [2024-10-11 05:03:44,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 05:03:44,787 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2024-10-11 05:03:44,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:44,801 INFO L225 Difference]: With dead ends: 3482 [2024-10-11 05:03:44,801 INFO L226 Difference]: Without dead ends: 2419 [2024-10-11 05:03:44,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-10-11 05:03:44,806 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 1202 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1230 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:44,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1230 Valid, 880 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:03:44,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2024-10-11 05:03:45,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 2275. [2024-10-11 05:03:45,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2275 states, 1766 states have (on average 1.339184597961495) internal successors, (2365), 1801 states have internal predecessors, (2365), 257 states have call successors, (257), 206 states have call predecessors, (257), 250 states have return successors, (362), 269 states have call predecessors, (362), 253 states have call successors, (362) [2024-10-11 05:03:45,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2275 states to 2275 states and 2984 transitions. [2024-10-11 05:03:45,047 INFO L78 Accepts]: Start accepts. Automaton has 2275 states and 2984 transitions. Word has length 59 [2024-10-11 05:03:45,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:45,049 INFO L471 AbstractCegarLoop]: Abstraction has 2275 states and 2984 transitions. [2024-10-11 05:03:45,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:03:45,050 INFO L276 IsEmpty]: Start isEmpty. Operand 2275 states and 2984 transitions. [2024-10-11 05:03:45,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 05:03:45,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:45,051 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:03:45,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 05:03:45,051 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:45,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:45,052 INFO L85 PathProgramCache]: Analyzing trace with hash 758916333, now seen corresponding path program 1 times [2024-10-11 05:03:45,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:45,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348891016] [2024-10-11 05:03:45,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:45,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:45,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:45,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:45,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:45,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:45,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:45,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:45,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:45,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:45,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:45,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:45,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:45,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:45,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:45,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:45,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348891016] [2024-10-11 05:03:45,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348891016] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:45,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:45,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:03:45,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110477280] [2024-10-11 05:03:45,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:45,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:03:45,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:45,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:03:45,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:03:45,148 INFO L87 Difference]: Start difference. First operand 2275 states and 2984 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:03:46,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:46,128 INFO L93 Difference]: Finished difference Result 5296 states and 6846 transitions. [2024-10-11 05:03:46,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:03:46,128 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 60 [2024-10-11 05:03:46,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:46,149 INFO L225 Difference]: With dead ends: 5296 [2024-10-11 05:03:46,149 INFO L226 Difference]: Without dead ends: 3268 [2024-10-11 05:03:46,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:03:46,157 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 832 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:46,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 884 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:03:46,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3268 states. [2024-10-11 05:03:46,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3268 to 2982. [2024-10-11 05:03:46,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2982 states, 2302 states have (on average 1.322328410078193) internal successors, (3044), 2342 states have internal predecessors, (3044), 341 states have call successors, (341), 279 states have call predecessors, (341), 337 states have return successors, (466), 362 states have call predecessors, (466), 337 states have call successors, (466) [2024-10-11 05:03:46,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2982 states to 2982 states and 3851 transitions. [2024-10-11 05:03:46,531 INFO L78 Accepts]: Start accepts. Automaton has 2982 states and 3851 transitions. Word has length 60 [2024-10-11 05:03:46,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:46,532 INFO L471 AbstractCegarLoop]: Abstraction has 2982 states and 3851 transitions. [2024-10-11 05:03:46,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:03:46,532 INFO L276 IsEmpty]: Start isEmpty. Operand 2982 states and 3851 transitions. [2024-10-11 05:03:46,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 05:03:46,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:46,533 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:03:46,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 05:03:46,534 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:46,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:46,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1186493772, now seen corresponding path program 1 times [2024-10-11 05:03:46,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:46,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603189382] [2024-10-11 05:03:46,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:46,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:46,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:46,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:46,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:46,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:46,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:46,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:46,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:46,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:46,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:46,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:46,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:46,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:46,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:46,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:46,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-11 05:03:46,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:46,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603189382] [2024-10-11 05:03:46,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603189382] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:46,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:46,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:03:46,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352617041] [2024-10-11 05:03:46,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:46,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:03:46,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:46,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:03:46,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:03:46,624 INFO L87 Difference]: Start difference. First operand 2982 states and 3851 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:03:47,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:47,586 INFO L93 Difference]: Finished difference Result 6248 states and 7946 transitions. [2024-10-11 05:03:47,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:03:47,587 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2024-10-11 05:03:47,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:47,607 INFO L225 Difference]: With dead ends: 6248 [2024-10-11 05:03:47,608 INFO L226 Difference]: Without dead ends: 3512 [2024-10-11 05:03:47,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:03:47,617 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 920 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:47,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 945 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:03:47,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3512 states. [2024-10-11 05:03:47,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3512 to 3235. [2024-10-11 05:03:47,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3235 states, 2498 states have (on average 1.3142514011208968) internal successors, (3283), 2540 states have internal predecessors, (3283), 369 states have call successors, (369), 304 states have call predecessors, (369), 366 states have return successors, (498), 392 states have call predecessors, (498), 365 states have call successors, (498) [2024-10-11 05:03:47,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3235 states to 3235 states and 4150 transitions. [2024-10-11 05:03:47,968 INFO L78 Accepts]: Start accepts. Automaton has 3235 states and 4150 transitions. Word has length 66 [2024-10-11 05:03:47,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:47,969 INFO L471 AbstractCegarLoop]: Abstraction has 3235 states and 4150 transitions. [2024-10-11 05:03:47,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:03:47,970 INFO L276 IsEmpty]: Start isEmpty. Operand 3235 states and 4150 transitions. [2024-10-11 05:03:47,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 05:03:47,972 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:47,972 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:03:47,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 05:03:47,972 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:47,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:47,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1904970210, now seen corresponding path program 1 times [2024-10-11 05:03:47,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:47,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055145524] [2024-10-11 05:03:47,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:47,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:48,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:48,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:48,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:48,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:48,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:48,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:48,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:48,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:48,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:48,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:48,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:48,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:48,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055145524] [2024-10-11 05:03:48,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055145524] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:48,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:48,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:03:48,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118431085] [2024-10-11 05:03:48,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:48,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:03:48,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:48,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:03:48,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:48,087 INFO L87 Difference]: Start difference. First operand 3235 states and 4150 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:03:49,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:49,256 INFO L93 Difference]: Finished difference Result 4256 states and 5383 transitions. [2024-10-11 05:03:49,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 05:03:49,257 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 67 [2024-10-11 05:03:49,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:49,285 INFO L225 Difference]: With dead ends: 4256 [2024-10-11 05:03:49,286 INFO L226 Difference]: Without dead ends: 4253 [2024-10-11 05:03:49,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2024-10-11 05:03:49,290 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 1627 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1637 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:49,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1637 Valid, 714 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:03:49,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4253 states. [2024-10-11 05:03:49,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4253 to 3655. [2024-10-11 05:03:49,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3655 states, 2811 states have (on average 1.3020277481323372) internal successors, (3660), 2856 states have internal predecessors, (3660), 419 states have call successors, (419), 348 states have call predecessors, (419), 423 states have return successors, (575), 452 states have call predecessors, (575), 416 states have call successors, (575) [2024-10-11 05:03:49,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3655 states to 3655 states and 4654 transitions. [2024-10-11 05:03:49,657 INFO L78 Accepts]: Start accepts. Automaton has 3655 states and 4654 transitions. Word has length 67 [2024-10-11 05:03:49,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:49,658 INFO L471 AbstractCegarLoop]: Abstraction has 3655 states and 4654 transitions. [2024-10-11 05:03:49,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:03:49,659 INFO L276 IsEmpty]: Start isEmpty. Operand 3655 states and 4654 transitions. [2024-10-11 05:03:49,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 05:03:49,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:49,660 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:03:49,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 05:03:49,660 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:49,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:49,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1076567978, now seen corresponding path program 1 times [2024-10-11 05:03:49,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:49,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005492066] [2024-10-11 05:03:49,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:49,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:49,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:49,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:49,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:49,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:49,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:49,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:49,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:49,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:49,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:49,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:49,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:49,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:49,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:49,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:49,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005492066] [2024-10-11 05:03:49,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005492066] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:03:49,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119893931] [2024-10-11 05:03:49,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:49,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:03:49,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:03:49,831 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:03:49,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 05:03:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:49,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 05:03:49,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:03:50,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:50,217 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 05:03:50,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:50,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119893931] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 05:03:50,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 05:03:50,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2024-10-11 05:03:50,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112528976] [2024-10-11 05:03:50,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 05:03:50,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 05:03:50,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:50,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 05:03:50,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:03:50,335 INFO L87 Difference]: Start difference. First operand 3655 states and 4654 transitions. Second operand has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-11 05:03:52,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:52,615 INFO L93 Difference]: Finished difference Result 7655 states and 9560 transitions. [2024-10-11 05:03:52,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-11 05:03:52,616 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 68 [2024-10-11 05:03:52,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:52,659 INFO L225 Difference]: With dead ends: 7655 [2024-10-11 05:03:52,659 INFO L226 Difference]: Without dead ends: 7652 [2024-10-11 05:03:52,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2024-10-11 05:03:52,664 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 1370 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 2050 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1429 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 2217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 2050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:52,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1429 Valid, 1874 Invalid, 2217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 2050 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 05:03:52,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7652 states. [2024-10-11 05:03:53,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7652 to 6772. [2024-10-11 05:03:53,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6772 states, 5186 states have (on average 1.2830698033166217) internal successors, (6654), 5266 states have internal predecessors, (6654), 778 states have call successors, (778), 662 states have call predecessors, (778), 806 states have return successors, (1076), 845 states have call predecessors, (1076), 775 states have call successors, (1076) [2024-10-11 05:03:53,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6772 states to 6772 states and 8508 transitions. [2024-10-11 05:03:53,508 INFO L78 Accepts]: Start accepts. Automaton has 6772 states and 8508 transitions. Word has length 68 [2024-10-11 05:03:53,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:53,508 INFO L471 AbstractCegarLoop]: Abstraction has 6772 states and 8508 transitions. [2024-10-11 05:03:53,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-11 05:03:53,509 INFO L276 IsEmpty]: Start isEmpty. Operand 6772 states and 8508 transitions. [2024-10-11 05:03:53,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 05:03:53,510 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:53,510 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:03:53,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 05:03:53,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 05:03:53,712 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:53,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:53,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1486209378, now seen corresponding path program 2 times [2024-10-11 05:03:53,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:53,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003079724] [2024-10-11 05:03:53,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:53,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:53,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:53,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:53,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:53,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:53,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:53,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:53,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:53,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:53,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:53,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:53,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:53,786 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:53,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:53,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003079724] [2024-10-11 05:03:53,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003079724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:53,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:53,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:03:53,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349350363] [2024-10-11 05:03:53,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:53,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:03:53,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:53,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:03:53,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:03:53,789 INFO L87 Difference]: Start difference. First operand 6772 states and 8508 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:03:54,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:54,762 INFO L93 Difference]: Finished difference Result 9167 states and 11524 transitions. [2024-10-11 05:03:54,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 05:03:54,763 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 71 [2024-10-11 05:03:54,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:54,785 INFO L225 Difference]: With dead ends: 9167 [2024-10-11 05:03:54,785 INFO L226 Difference]: Without dead ends: 3529 [2024-10-11 05:03:54,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:03:54,800 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 885 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:54,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 980 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:03:54,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3529 states. [2024-10-11 05:03:55,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3529 to 2606. [2024-10-11 05:03:55,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2606 states, 2024 states have (on average 1.290513833992095) internal successors, (2612), 2050 states have internal predecessors, (2612), 298 states have call successors, (298), 245 states have call predecessors, (298), 282 states have return successors, (377), 312 states have call predecessors, (377), 295 states have call successors, (377) [2024-10-11 05:03:55,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2606 states to 2606 states and 3287 transitions. [2024-10-11 05:03:55,090 INFO L78 Accepts]: Start accepts. Automaton has 2606 states and 3287 transitions. Word has length 71 [2024-10-11 05:03:55,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:55,091 INFO L471 AbstractCegarLoop]: Abstraction has 2606 states and 3287 transitions. [2024-10-11 05:03:55,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:03:55,091 INFO L276 IsEmpty]: Start isEmpty. Operand 2606 states and 3287 transitions. [2024-10-11 05:03:55,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 05:03:55,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:55,093 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:03:55,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 05:03:55,094 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:55,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:55,094 INFO L85 PathProgramCache]: Analyzing trace with hash -785495608, now seen corresponding path program 1 times [2024-10-11 05:03:55,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:55,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740811983] [2024-10-11 05:03:55,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:55,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:55,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:55,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:55,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:55,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:55,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:55,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:55,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:55,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:55,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:55,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:55,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:55,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:55,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:55,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:55,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:03:55,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:55,244 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 05:03:55,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:55,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740811983] [2024-10-11 05:03:55,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740811983] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:55,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:55,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:03:55,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103668654] [2024-10-11 05:03:55,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:55,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:03:55,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:55,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:03:55,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:03:55,249 INFO L87 Difference]: Start difference. First operand 2606 states and 3287 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 05:03:56,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:56,833 INFO L93 Difference]: Finished difference Result 7387 states and 9173 transitions. [2024-10-11 05:03:56,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 05:03:56,834 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 76 [2024-10-11 05:03:56,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:56,865 INFO L225 Difference]: With dead ends: 7387 [2024-10-11 05:03:56,865 INFO L226 Difference]: Without dead ends: 5028 [2024-10-11 05:03:56,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-10-11 05:03:56,874 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 879 mSDsluCounter, 1338 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 1620 SdHoareTripleChecker+Invalid, 1375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:56,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 1620 Invalid, 1375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 05:03:56,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5028 states. [2024-10-11 05:03:57,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5028 to 4721. [2024-10-11 05:03:57,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4721 states, 3573 states have (on average 1.2504897844948222) internal successors, (4468), 3673 states have internal predecessors, (4468), 565 states have call successors, (565), 473 states have call predecessors, (565), 581 states have return successors, (822), 577 states have call predecessors, (822), 562 states have call successors, (822) [2024-10-11 05:03:57,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4721 states to 4721 states and 5855 transitions. [2024-10-11 05:03:57,552 INFO L78 Accepts]: Start accepts. Automaton has 4721 states and 5855 transitions. Word has length 76 [2024-10-11 05:03:57,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:57,552 INFO L471 AbstractCegarLoop]: Abstraction has 4721 states and 5855 transitions. [2024-10-11 05:03:57,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 05:03:57,554 INFO L276 IsEmpty]: Start isEmpty. Operand 4721 states and 5855 transitions. [2024-10-11 05:03:57,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 05:03:57,556 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:57,556 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:03:57,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 05:03:57,557 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:57,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:57,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1115085919, now seen corresponding path program 1 times [2024-10-11 05:03:57,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:57,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101911493] [2024-10-11 05:03:57,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:57,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:57,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:57,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:57,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:57,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:57,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:57,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:57,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:57,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:57,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:57,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:57,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:57,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:57,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:57,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 05:03:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:57,705 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 05:03:57,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:57,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101911493] [2024-10-11 05:03:57,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101911493] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:57,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:57,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:03:57,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970048229] [2024-10-11 05:03:57,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:57,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:03:57,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:57,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:03:57,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:03:57,710 INFO L87 Difference]: Start difference. First operand 4721 states and 5855 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 05:03:59,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:59,240 INFO L93 Difference]: Finished difference Result 7388 states and 9140 transitions. [2024-10-11 05:03:59,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 05:03:59,240 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 86 [2024-10-11 05:03:59,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:59,260 INFO L225 Difference]: With dead ends: 7388 [2024-10-11 05:03:59,260 INFO L226 Difference]: Without dead ends: 3454 [2024-10-11 05:03:59,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2024-10-11 05:03:59,273 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 1474 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 1393 SdHoareTripleChecker+Invalid, 1608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:59,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1508 Valid, 1393 Invalid, 1608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 05:03:59,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3454 states. [2024-10-11 05:03:59,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3454 to 3100. [2024-10-11 05:03:59,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3100 states, 2347 states have (on average 1.243715381337878) internal successors, (2919), 2418 states have internal predecessors, (2919), 367 states have call successors, (367), 300 states have call predecessors, (367), 384 states have return successors, (507), 384 states have call predecessors, (507), 364 states have call successors, (507) [2024-10-11 05:03:59,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3100 states to 3100 states and 3793 transitions. [2024-10-11 05:03:59,669 INFO L78 Accepts]: Start accepts. Automaton has 3100 states and 3793 transitions. Word has length 86 [2024-10-11 05:03:59,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:59,670 INFO L471 AbstractCegarLoop]: Abstraction has 3100 states and 3793 transitions. [2024-10-11 05:03:59,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 05:03:59,671 INFO L276 IsEmpty]: Start isEmpty. Operand 3100 states and 3793 transitions. [2024-10-11 05:03:59,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 05:03:59,674 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:59,674 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] [2024-10-11 05:03:59,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 05:03:59,675 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:59,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:59,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1740292059, now seen corresponding path program 1 times [2024-10-11 05:03:59,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:59,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633900139] [2024-10-11 05:03:59,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:59,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:59,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:59,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:59,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:59,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 05:03:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:59,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 05:03:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:59,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 05:03:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:59,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:59,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:59,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633900139] [2024-10-11 05:03:59,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633900139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:59,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:59,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:03:59,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886168518] [2024-10-11 05:03:59,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:59,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:03:59,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:59,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:03:59,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:03:59,796 INFO L87 Difference]: Start difference. First operand 3100 states and 3793 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 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-11 05:04:01,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:01,201 INFO L93 Difference]: Finished difference Result 3411 states and 4305 transitions. [2024-10-11 05:04:01,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:04:01,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 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 112 [2024-10-11 05:04:01,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:01,215 INFO L225 Difference]: With dead ends: 3411 [2024-10-11 05:04:01,216 INFO L226 Difference]: Without dead ends: 3180 [2024-10-11 05:04:01,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:04:01,219 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 727 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:01,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 654 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 05:04:01,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3180 states. [2024-10-11 05:04:01,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3180 to 3100. [2024-10-11 05:04:02,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3100 states, 2347 states have (on average 1.2432893054963783) internal successors, (2918), 2418 states have internal predecessors, (2918), 367 states have call successors, (367), 300 states have call predecessors, (367), 384 states have return successors, (507), 384 states have call predecessors, (507), 364 states have call successors, (507) [2024-10-11 05:04:02,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3100 states to 3100 states and 3792 transitions. [2024-10-11 05:04:02,017 INFO L78 Accepts]: Start accepts. Automaton has 3100 states and 3792 transitions. Word has length 112 [2024-10-11 05:04:02,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:02,017 INFO L471 AbstractCegarLoop]: Abstraction has 3100 states and 3792 transitions. [2024-10-11 05:04:02,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 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-11 05:04:02,018 INFO L276 IsEmpty]: Start isEmpty. Operand 3100 states and 3792 transitions. [2024-10-11 05:04:02,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 05:04:02,021 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:02,022 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] [2024-10-11 05:04:02,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 05:04:02,022 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:02,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:02,024 INFO L85 PathProgramCache]: Analyzing trace with hash 293101987, now seen corresponding path program 1 times [2024-10-11 05:04:02,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:02,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144332407] [2024-10-11 05:04:02,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:02,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:02,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:02,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:02,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:02,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:02,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 05:04:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:02,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 05:04:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:02,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 05:04:02,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:02,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:04:02,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:02,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144332407] [2024-10-11 05:04:02,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144332407] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:02,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:02,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:04:02,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202056992] [2024-10-11 05:04:02,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:02,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:04:02,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:02,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:04:02,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:04:02,211 INFO L87 Difference]: Start difference. First operand 3100 states and 3792 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:04:04,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:04,436 INFO L93 Difference]: Finished difference Result 3719 states and 4812 transitions. [2024-10-11 05:04:04,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:04:04,436 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 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 112 [2024-10-11 05:04:04,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:04,452 INFO L225 Difference]: With dead ends: 3719 [2024-10-11 05:04:04,452 INFO L226 Difference]: Without dead ends: 3494 [2024-10-11 05:04:04,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:04:04,455 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 1154 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 1650 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1178 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 1780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:04,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1178 Valid, 1031 Invalid, 1780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1650 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 05:04:04,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3494 states. [2024-10-11 05:04:05,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3494 to 3333. [2024-10-11 05:04:05,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3333 states, 2557 states have (on average 1.275322643723113) internal successors, (3261), 2629 states have internal predecessors, (3261), 383 states have call successors, (383), 306 states have call predecessors, (383), 391 states have return successors, (526), 400 states have call predecessors, (526), 380 states have call successors, (526) [2024-10-11 05:04:05,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3333 states to 3333 states and 4170 transitions. [2024-10-11 05:04:05,138 INFO L78 Accepts]: Start accepts. Automaton has 3333 states and 4170 transitions. Word has length 112 [2024-10-11 05:04:05,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:05,139 INFO L471 AbstractCegarLoop]: Abstraction has 3333 states and 4170 transitions. [2024-10-11 05:04:05,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:04:05,139 INFO L276 IsEmpty]: Start isEmpty. Operand 3333 states and 4170 transitions. [2024-10-11 05:04:05,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 05:04:05,143 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:05,143 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] [2024-10-11 05:04:05,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 05:04:05,144 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:05,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:05,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1287354783, now seen corresponding path program 1 times [2024-10-11 05:04:05,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:05,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410476572] [2024-10-11 05:04:05,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:05,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:05,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:05,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:05,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:05,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:05,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:05,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 05:04:05,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:05,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 05:04:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:05,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 05:04:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:05,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:04:05,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:05,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410476572] [2024-10-11 05:04:05,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410476572] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:05,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:05,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:04:05,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243036829] [2024-10-11 05:04:05,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:05,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:04:05,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:05,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:04:05,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:05,338 INFO L87 Difference]: Start difference. First operand 3333 states and 4170 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:04:07,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:07,888 INFO L93 Difference]: Finished difference Result 4274 states and 5718 transitions. [2024-10-11 05:04:07,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:04:07,889 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-10-11 05:04:07,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:07,900 INFO L225 Difference]: With dead ends: 4274 [2024-10-11 05:04:07,900 INFO L226 Difference]: Without dead ends: 3816 [2024-10-11 05:04:07,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:04:07,903 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 1228 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 2318 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1252 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 2433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 2318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:07,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1252 Valid, 1221 Invalid, 2433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 2318 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 05:04:07,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3816 states. [2024-10-11 05:04:08,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3816 to 3549. [2024-10-11 05:04:08,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3549 states, 2750 states have (on average 1.298181818181818) internal successors, (3570), 2823 states have internal predecessors, (3570), 399 states have call successors, (399), 312 states have call predecessors, (399), 398 states have return successors, (544), 417 states have call predecessors, (544), 396 states have call successors, (544) [2024-10-11 05:04:08,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3549 states to 3549 states and 4513 transitions. [2024-10-11 05:04:08,465 INFO L78 Accepts]: Start accepts. Automaton has 3549 states and 4513 transitions. Word has length 112 [2024-10-11 05:04:08,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:08,466 INFO L471 AbstractCegarLoop]: Abstraction has 3549 states and 4513 transitions. [2024-10-11 05:04:08,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:04:08,466 INFO L276 IsEmpty]: Start isEmpty. Operand 3549 states and 4513 transitions. [2024-10-11 05:04:08,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 05:04:08,470 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:08,470 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] [2024-10-11 05:04:08,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 05:04:08,470 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:08,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:08,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1656227295, now seen corresponding path program 1 times [2024-10-11 05:04:08,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:08,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016480002] [2024-10-11 05:04:08,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:08,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:08,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:08,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:08,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:08,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 05:04:08,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:08,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 05:04:08,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:08,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 05:04:08,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:08,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:04:08,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:08,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016480002] [2024-10-11 05:04:08,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016480002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:08,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:08,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:04:08,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361771145] [2024-10-11 05:04:08,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:08,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:04:08,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:08,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:04:08,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:08,665 INFO L87 Difference]: Start difference. First operand 3549 states and 4513 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:04:11,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:11,535 INFO L93 Difference]: Finished difference Result 5087 states and 7039 transitions. [2024-10-11 05:04:11,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:04:11,535 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-10-11 05:04:11,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:11,551 INFO L225 Difference]: With dead ends: 5087 [2024-10-11 05:04:11,551 INFO L226 Difference]: Without dead ends: 4413 [2024-10-11 05:04:11,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:04:11,558 INFO L432 NwaCegarLoop]: 388 mSDtfsCounter, 1173 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 2606 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1197 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 2697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:11,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1197 Valid, 1655 Invalid, 2697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2606 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 05:04:11,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4413 states. [2024-10-11 05:04:12,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4413 to 3982. [2024-10-11 05:04:12,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3982 states, 3137 states have (on average 1.3353522473700987) internal successors, (4189), 3212 states have internal predecessors, (4189), 431 states have call successors, (431), 324 states have call predecessors, (431), 412 states have return successors, (584), 451 states have call predecessors, (584), 428 states have call successors, (584) [2024-10-11 05:04:12,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3982 states to 3982 states and 5204 transitions. [2024-10-11 05:04:12,264 INFO L78 Accepts]: Start accepts. Automaton has 3982 states and 5204 transitions. Word has length 112 [2024-10-11 05:04:12,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:12,264 INFO L471 AbstractCegarLoop]: Abstraction has 3982 states and 5204 transitions. [2024-10-11 05:04:12,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:04:12,265 INFO L276 IsEmpty]: Start isEmpty. Operand 3982 states and 5204 transitions. [2024-10-11 05:04:12,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 05:04:12,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:12,269 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] [2024-10-11 05:04:12,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 05:04:12,271 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:12,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:12,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1019765087, now seen corresponding path program 1 times [2024-10-11 05:04:12,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:12,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564391257] [2024-10-11 05:04:12,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:12,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:12,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:12,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:12,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:12,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 05:04:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:12,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 05:04:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:12,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 05:04:12,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:12,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:04:12,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:12,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564391257] [2024-10-11 05:04:12,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564391257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:12,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:12,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:04:12,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906085341] [2024-10-11 05:04:12,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:12,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:04:12,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:12,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:04:12,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:12,464 INFO L87 Difference]: Start difference. First operand 3982 states and 5204 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:04:14,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:14,209 INFO L93 Difference]: Finished difference Result 5508 states and 7721 transitions. [2024-10-11 05:04:14,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:04:14,210 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-10-11 05:04:14,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:14,225 INFO L225 Difference]: With dead ends: 5508 [2024-10-11 05:04:14,226 INFO L226 Difference]: Without dead ends: 4401 [2024-10-11 05:04:14,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:04:14,232 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 1062 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 1374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:14,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 790 Invalid, 1374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 05:04:14,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4401 states. [2024-10-11 05:04:14,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4401 to 3982. [2024-10-11 05:04:14,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3982 states, 3137 states have (on average 1.3337583678673892) internal successors, (4184), 3212 states have internal predecessors, (4184), 431 states have call successors, (431), 324 states have call predecessors, (431), 412 states have return successors, (584), 451 states have call predecessors, (584), 428 states have call successors, (584) [2024-10-11 05:04:14,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3982 states to 3982 states and 5199 transitions. [2024-10-11 05:04:14,815 INFO L78 Accepts]: Start accepts. Automaton has 3982 states and 5199 transitions. Word has length 112 [2024-10-11 05:04:14,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:14,816 INFO L471 AbstractCegarLoop]: Abstraction has 3982 states and 5199 transitions. [2024-10-11 05:04:14,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:04:14,816 INFO L276 IsEmpty]: Start isEmpty. Operand 3982 states and 5199 transitions. [2024-10-11 05:04:14,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 05:04:14,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:14,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:04:14,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 05:04:14,821 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:14,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:14,821 INFO L85 PathProgramCache]: Analyzing trace with hash 136256097, now seen corresponding path program 1 times [2024-10-11 05:04:14,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:14,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386361557] [2024-10-11 05:04:14,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:14,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:14,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:14,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:14,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:14,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:14,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 05:04:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:14,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 05:04:14,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:15,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 05:04:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:15,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:04:15,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:15,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386361557] [2024-10-11 05:04:15,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386361557] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:15,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:15,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:04:15,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115557538] [2024-10-11 05:04:15,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:15,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:04:15,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:15,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:04:15,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:15,008 INFO L87 Difference]: Start difference. First operand 3982 states and 5199 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:04:16,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:16,606 INFO L93 Difference]: Finished difference Result 5497 states and 7685 transitions. [2024-10-11 05:04:16,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:04:16,607 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-10-11 05:04:16,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:16,627 INFO L225 Difference]: With dead ends: 5497 [2024-10-11 05:04:16,627 INFO L226 Difference]: Without dead ends: 4390 [2024-10-11 05:04:16,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:04:16,633 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 1058 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:16,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1083 Valid, 790 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1223 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:04:16,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2024-10-11 05:04:17,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 3982. [2024-10-11 05:04:17,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3982 states, 3137 states have (on average 1.3321644883646797) internal successors, (4179), 3212 states have internal predecessors, (4179), 431 states have call successors, (431), 324 states have call predecessors, (431), 412 states have return successors, (584), 451 states have call predecessors, (584), 428 states have call successors, (584) [2024-10-11 05:04:17,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3982 states to 3982 states and 5194 transitions. [2024-10-11 05:04:17,221 INFO L78 Accepts]: Start accepts. Automaton has 3982 states and 5194 transitions. Word has length 112 [2024-10-11 05:04:17,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:17,221 INFO L471 AbstractCegarLoop]: Abstraction has 3982 states and 5194 transitions. [2024-10-11 05:04:17,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:04:17,221 INFO L276 IsEmpty]: Start isEmpty. Operand 3982 states and 5194 transitions. [2024-10-11 05:04:17,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 05:04:17,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:17,226 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] [2024-10-11 05:04:17,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 05:04:17,226 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:17,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:17,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1804325917, now seen corresponding path program 1 times [2024-10-11 05:04:17,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:17,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215345227] [2024-10-11 05:04:17,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:17,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:17,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:17,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:17,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:17,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 05:04:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:17,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 05:04:17,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:17,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 05:04:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:17,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:04:17,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:17,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215345227] [2024-10-11 05:04:17,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215345227] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:17,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:17,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:04:17,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674810948] [2024-10-11 05:04:17,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:17,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:04:17,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:17,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:04:17,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:17,412 INFO L87 Difference]: Start difference. First operand 3982 states and 5194 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:04:20,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:20,039 INFO L93 Difference]: Finished difference Result 6631 states and 9488 transitions. [2024-10-11 05:04:20,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:04:20,040 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-10-11 05:04:20,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:20,064 INFO L225 Difference]: With dead ends: 6631 [2024-10-11 05:04:20,064 INFO L226 Difference]: Without dead ends: 5524 [2024-10-11 05:04:20,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:04:20,072 INFO L432 NwaCegarLoop]: 388 mSDtfsCounter, 1156 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 2530 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 2621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:20,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1180 Valid, 1655 Invalid, 2621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2530 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 05:04:20,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5524 states. [2024-10-11 05:04:20,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5524 to 4863. [2024-10-11 05:04:20,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4863 states, 3926 states have (on average 1.3830871115639327) internal successors, (5430), 4005 states have internal predecessors, (5430), 495 states have call successors, (495), 348 states have call predecessors, (495), 440 states have return successors, (670), 519 states have call predecessors, (670), 492 states have call successors, (670) [2024-10-11 05:04:20,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4863 states to 4863 states and 6595 transitions. [2024-10-11 05:04:20,936 INFO L78 Accepts]: Start accepts. Automaton has 4863 states and 6595 transitions. Word has length 112 [2024-10-11 05:04:20,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:20,937 INFO L471 AbstractCegarLoop]: Abstraction has 4863 states and 6595 transitions. [2024-10-11 05:04:20,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:04:20,938 INFO L276 IsEmpty]: Start isEmpty. Operand 4863 states and 6595 transitions. [2024-10-11 05:04:20,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 05:04:20,942 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:20,943 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] [2024-10-11 05:04:20,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 05:04:20,943 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:20,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:20,943 INFO L85 PathProgramCache]: Analyzing trace with hash 72737313, now seen corresponding path program 1 times [2024-10-11 05:04:20,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:20,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240630644] [2024-10-11 05:04:20,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:20,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:20,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:21,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:21,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:21,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:21,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 05:04:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:21,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 05:04:21,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:21,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 05:04:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:21,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:04:21,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:21,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240630644] [2024-10-11 05:04:21,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240630644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:21,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:21,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:04:21,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476595259] [2024-10-11 05:04:21,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:21,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:04:21,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:21,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:04:21,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:21,094 INFO L87 Difference]: Start difference. First operand 4863 states and 6595 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:04:22,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:22,821 INFO L93 Difference]: Finished difference Result 7515 states and 10922 transitions. [2024-10-11 05:04:22,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:04:22,821 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-10-11 05:04:22,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:22,842 INFO L225 Difference]: With dead ends: 7515 [2024-10-11 05:04:22,842 INFO L226 Difference]: Without dead ends: 5527 [2024-10-11 05:04:22,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:04:22,850 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 1057 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1082 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:22,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1082 Valid, 790 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 05:04:22,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5527 states. [2024-10-11 05:04:23,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5527 to 4863. [2024-10-11 05:04:23,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4863 states, 3926 states have (on average 1.380794701986755) internal successors, (5421), 4005 states have internal predecessors, (5421), 495 states have call successors, (495), 348 states have call predecessors, (495), 440 states have return successors, (670), 519 states have call predecessors, (670), 492 states have call successors, (670) [2024-10-11 05:04:23,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4863 states to 4863 states and 6586 transitions. [2024-10-11 05:04:23,690 INFO L78 Accepts]: Start accepts. Automaton has 4863 states and 6586 transitions. Word has length 112 [2024-10-11 05:04:23,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:23,691 INFO L471 AbstractCegarLoop]: Abstraction has 4863 states and 6586 transitions. [2024-10-11 05:04:23,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:04:23,691 INFO L276 IsEmpty]: Start isEmpty. Operand 4863 states and 6586 transitions. [2024-10-11 05:04:23,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 05:04:23,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:23,695 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] [2024-10-11 05:04:23,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 05:04:23,695 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:23,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:23,696 INFO L85 PathProgramCache]: Analyzing trace with hash -697996253, now seen corresponding path program 1 times [2024-10-11 05:04:23,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:23,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825210700] [2024-10-11 05:04:23,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:23,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:23,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:23,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:23,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:23,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:23,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:23,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 05:04:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:23,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 05:04:23,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:23,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 05:04:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:23,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:04:23,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:23,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825210700] [2024-10-11 05:04:23,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825210700] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:23,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:23,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:04:23,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094305478] [2024-10-11 05:04:23,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:23,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:04:23,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:23,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:04:23,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:23,855 INFO L87 Difference]: Start difference. First operand 4863 states and 6586 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:04:26,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:26,899 INFO L93 Difference]: Finished difference Result 10482 states and 15635 transitions. [2024-10-11 05:04:26,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:04:26,899 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-10-11 05:04:26,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:26,933 INFO L225 Difference]: With dead ends: 10482 [2024-10-11 05:04:26,934 INFO L226 Difference]: Without dead ends: 8494 [2024-10-11 05:04:26,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:04:26,946 INFO L432 NwaCegarLoop]: 386 mSDtfsCounter, 1213 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 2916 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1236 SdHoareTripleChecker+Valid, 1648 SdHoareTripleChecker+Invalid, 3009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 2916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:26,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1236 Valid, 1648 Invalid, 3009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 2916 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 05:04:26,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8494 states. [2024-10-11 05:04:27,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8494 to 6619. [2024-10-11 05:04:27,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6619 states, 5506 states have (on average 1.4375227025063566) internal successors, (7915), 5593 states have internal predecessors, (7915), 615 states have call successors, (615), 396 states have call predecessors, (615), 496 states have return successors, (852), 647 states have call predecessors, (852), 612 states have call successors, (852) [2024-10-11 05:04:27,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6619 states to 6619 states and 9382 transitions. [2024-10-11 05:04:27,990 INFO L78 Accepts]: Start accepts. Automaton has 6619 states and 9382 transitions. Word has length 112 [2024-10-11 05:04:27,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:27,990 INFO L471 AbstractCegarLoop]: Abstraction has 6619 states and 9382 transitions. [2024-10-11 05:04:27,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:04:27,991 INFO L276 IsEmpty]: Start isEmpty. Operand 6619 states and 9382 transitions. [2024-10-11 05:04:27,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 05:04:27,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:27,997 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] [2024-10-11 05:04:27,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 05:04:27,998 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:27,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:27,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1692689951, now seen corresponding path program 1 times [2024-10-11 05:04:27,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:27,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544820465] [2024-10-11 05:04:27,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:27,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:28,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:28,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:28,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 05:04:28,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:28,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 05:04:28,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:28,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 05:04:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:28,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:04:28,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:28,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544820465] [2024-10-11 05:04:28,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544820465] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:28,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:28,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:04:28,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787793324] [2024-10-11 05:04:28,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:28,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:04:28,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:28,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:04:28,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:28,178 INFO L87 Difference]: Start difference. First operand 6619 states and 9382 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:04:31,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:31,066 INFO L93 Difference]: Finished difference Result 17240 states and 26521 transitions. [2024-10-11 05:04:31,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:04:31,067 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-10-11 05:04:31,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:31,125 INFO L225 Difference]: With dead ends: 17240 [2024-10-11 05:04:31,126 INFO L226 Difference]: Without dead ends: 13496 [2024-10-11 05:04:31,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:04:31,145 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 1432 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 2195 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 2313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 2195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:31,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1464 Valid, 1201 Invalid, 2313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 2195 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 05:04:31,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13496 states. [2024-10-11 05:04:32,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13496 to 9968. [2024-10-11 05:04:32,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9968 states, 8511 states have (on average 1.483374456585595) internal successors, (12625), 8614 states have internal predecessors, (12625), 847 states have call successors, (847), 492 states have call predecessors, (847), 608 states have return successors, (1262), 895 states have call predecessors, (1262), 844 states have call successors, (1262) [2024-10-11 05:04:32,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9968 states to 9968 states and 14734 transitions. [2024-10-11 05:04:32,299 INFO L78 Accepts]: Start accepts. Automaton has 9968 states and 14734 transitions. Word has length 112 [2024-10-11 05:04:32,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:32,299 INFO L471 AbstractCegarLoop]: Abstraction has 9968 states and 14734 transitions. [2024-10-11 05:04:32,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:04:32,299 INFO L276 IsEmpty]: Start isEmpty. Operand 9968 states and 14734 transitions. [2024-10-11 05:04:32,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 05:04:32,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:32,308 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] [2024-10-11 05:04:32,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 05:04:32,308 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:32,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:32,308 INFO L85 PathProgramCache]: Analyzing trace with hash 2016001123, now seen corresponding path program 1 times [2024-10-11 05:04:32,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:32,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355046772] [2024-10-11 05:04:32,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:32,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:32,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:32,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:32,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:32,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:32,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 05:04:32,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:32,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 05:04:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:32,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 05:04:32,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:32,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:04:32,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:32,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355046772] [2024-10-11 05:04:32,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355046772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:32,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:32,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:04:32,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545379133] [2024-10-11 05:04:32,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:32,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:04:32,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:32,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:04:32,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:32,457 INFO L87 Difference]: Start difference. First operand 9968 states and 14734 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:04:34,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:34,458 INFO L93 Difference]: Finished difference Result 19167 states and 29779 transitions. [2024-10-11 05:04:34,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:04:34,458 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2024-10-11 05:04:34,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:34,510 INFO L225 Difference]: With dead ends: 19167 [2024-10-11 05:04:34,510 INFO L226 Difference]: Without dead ends: 12074 [2024-10-11 05:04:34,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:04:34,532 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 1055 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1080 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:34,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1080 Valid, 789 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 05:04:34,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12074 states. [2024-10-11 05:04:35,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12074 to 9968. [2024-10-11 05:04:35,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9968 states, 8511 states have (on average 1.4794971213723416) internal successors, (12592), 8614 states have internal predecessors, (12592), 847 states have call successors, (847), 492 states have call predecessors, (847), 608 states have return successors, (1262), 895 states have call predecessors, (1262), 844 states have call successors, (1262) [2024-10-11 05:04:35,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9968 states to 9968 states and 14701 transitions. [2024-10-11 05:04:35,730 INFO L78 Accepts]: Start accepts. Automaton has 9968 states and 14701 transitions. Word has length 112 [2024-10-11 05:04:35,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:35,731 INFO L471 AbstractCegarLoop]: Abstraction has 9968 states and 14701 transitions. [2024-10-11 05:04:35,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:04:35,731 INFO L276 IsEmpty]: Start isEmpty. Operand 9968 states and 14701 transitions. [2024-10-11 05:04:35,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 05:04:35,738 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:35,738 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] [2024-10-11 05:04:35,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 05:04:35,739 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:35,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:35,739 INFO L85 PathProgramCache]: Analyzing trace with hash 57426337, now seen corresponding path program 1 times [2024-10-11 05:04:35,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:35,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868493675] [2024-10-11 05:04:35,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:35,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:35,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:35,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:35,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:35,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:35,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 05:04:35,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:35,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 05:04:35,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:35,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 05:04:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:35,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:04:35,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:35,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868493675] [2024-10-11 05:04:35,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868493675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:35,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:35,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:04:35,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33722567] [2024-10-11 05:04:35,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:35,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:04:35,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:35,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:04:35,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:35,901 INFO L87 Difference]: Start difference. First operand 9968 states and 14701 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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)