./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.06.cil-1.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.06.cil-1.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 2299ca1c26d35c3e5f6d860495fd40e041317a8644bf02bee237b59c63427ec2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 05:03:19,704 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 05:03:19,770 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:19,774 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 05:03:19,776 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 05:03:19,803 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 05:03:19,804 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 05:03:19,804 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 05:03:19,805 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 05:03:19,806 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 05:03:19,806 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 05:03:19,807 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 05:03:19,807 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 05:03:19,808 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 05:03:19,809 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 05:03:19,809 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 05:03:19,810 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 05:03:19,813 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 05:03:19,813 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 05:03:19,813 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 05:03:19,813 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 05:03:19,814 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 05:03:19,814 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 05:03:19,814 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 05:03:19,814 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 05:03:19,814 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 05:03:19,815 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 05:03:19,815 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 05:03:19,815 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 05:03:19,815 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 05:03:19,815 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 05:03:19,815 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 05:03:19,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:03:19,816 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 05:03:19,816 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 05:03:19,816 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 05:03:19,816 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 05:03:19,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 05:03:19,816 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 05:03:19,817 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 05:03:19,817 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 05:03:19,818 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 05:03:19,819 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 -> 2299ca1c26d35c3e5f6d860495fd40e041317a8644bf02bee237b59c63427ec2 [2024-10-11 05:03:20,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 05:03:20,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 05:03:20,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 05:03:20,091 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 05:03:20,092 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 05:03:20,093 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.06.cil-1.c [2024-10-11 05:03:21,481 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 05:03:21,677 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 05:03:21,678 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-1.c [2024-10-11 05:03:21,688 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/91a31b895/8c7770ad852f444eacd5fd08cd782fae/FLAGee67da76d [2024-10-11 05:03:21,699 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/91a31b895/8c7770ad852f444eacd5fd08cd782fae [2024-10-11 05:03:21,701 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 05:03:21,702 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 05:03:21,705 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 05:03:21,706 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 05:03:21,710 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 05:03:21,710 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:03:21" (1/1) ... [2024-10-11 05:03:21,711 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@584737a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:03:21, skipping insertion in model container [2024-10-11 05:03:21,711 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:03:21" (1/1) ... [2024-10-11 05:03:21,746 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 05:03:21,865 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.06.cil-1.c[914,927] [2024-10-11 05:03:21,898 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.06.cil-1.c[7115,7128] [2024-10-11 05:03:22,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:03:22,021 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 05:03:22,030 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.06.cil-1.c[914,927] [2024-10-11 05:03:22,081 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.06.cil-1.c[7115,7128] [2024-10-11 05:03:22,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:03:22,145 INFO L204 MainTranslator]: Completed translation [2024-10-11 05:03:22,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:03:22 WrapperNode [2024-10-11 05:03:22,145 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 05:03:22,146 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 05:03:22,146 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 05:03:22,146 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 05:03:22,152 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:22" (1/1) ... [2024-10-11 05:03:22,167 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:22" (1/1) ... [2024-10-11 05:03:22,222 INFO L138 Inliner]: procedures = 65, calls = 76, calls flagged for inlining = 33, calls inlined = 33, statements flattened = 714 [2024-10-11 05:03:22,227 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 05:03:22,227 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 05:03:22,227 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 05:03:22,228 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 05:03:22,238 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:22" (1/1) ... [2024-10-11 05:03:22,238 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:22" (1/1) ... [2024-10-11 05:03:22,243 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:22" (1/1) ... [2024-10-11 05:03:22,271 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:22,272 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:22" (1/1) ... [2024-10-11 05:03:22,272 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:22" (1/1) ... [2024-10-11 05:03:22,283 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:22" (1/1) ... [2024-10-11 05:03:22,298 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:22" (1/1) ... [2024-10-11 05:03:22,300 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:22" (1/1) ... [2024-10-11 05:03:22,302 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:22" (1/1) ... [2024-10-11 05:03:22,305 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 05:03:22,305 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 05:03:22,306 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 05:03:22,306 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 05:03:22,306 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:03:22" (1/1) ... [2024-10-11 05:03:22,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:03:22,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:03:22,338 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:22,343 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:22,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 05:03:22,379 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 05:03:22,379 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 05:03:22,379 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-11 05:03:22,379 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-11 05:03:22,379 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-11 05:03:22,379 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-11 05:03:22,379 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-11 05:03:22,380 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-11 05:03:22,380 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-10-11 05:03:22,380 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-10-11 05:03:22,380 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-11 05:03:22,380 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-11 05:03:22,380 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-11 05:03:22,380 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-11 05:03:22,380 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-10-11 05:03:22,381 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-10-11 05:03:22,381 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-11 05:03:22,381 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-11 05:03:22,381 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-10-11 05:03:22,381 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-10-11 05:03:22,381 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-11 05:03:22,381 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-11 05:03:22,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 05:03:22,381 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-11 05:03:22,382 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-11 05:03:22,382 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-10-11 05:03:22,382 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-10-11 05:03:22,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 05:03:22,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 05:03:22,382 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-11 05:03:22,382 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-11 05:03:22,382 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-10-11 05:03:22,382 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-10-11 05:03:22,463 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 05:03:22,465 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 05:03:23,092 INFO L? ?]: Removed 95 outVars from TransFormulas that were not future-live. [2024-10-11 05:03:23,092 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 05:03:23,165 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 05:03:23,166 INFO L314 CfgBuilder]: Removed 13 assume(true) statements. [2024-10-11 05:03:23,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:03:23 BoogieIcfgContainer [2024-10-11 05:03:23,166 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 05:03:23,168 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 05:03:23,168 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 05:03:23,170 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 05:03:23,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:03:21" (1/3) ... [2024-10-11 05:03:23,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67d97cc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:03:23, skipping insertion in model container [2024-10-11 05:03:23,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:03:22" (2/3) ... [2024-10-11 05:03:23,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67d97cc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:03:23, skipping insertion in model container [2024-10-11 05:03:23,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:03:23" (3/3) ... [2024-10-11 05:03:23,173 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.06.cil-1.c [2024-10-11 05:03:23,186 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 05:03:23,187 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 05:03:23,250 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 05:03:23,256 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;@7dc7dbf6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 05:03:23,256 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 05:03:23,264 INFO L276 IsEmpty]: Start isEmpty. Operand has 309 states, 255 states have (on average 1.6901960784313725) internal successors, (431), 263 states have internal predecessors, (431), 36 states have call successors, (36), 15 states have call predecessors, (36), 15 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 05:03:23,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:03:23,273 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:23,273 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:23,274 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:23,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:23,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1352984849, now seen corresponding path program 1 times [2024-10-11 05:03:23,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:23,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929450631] [2024-10-11 05:03:23,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:23,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:23,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:23,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:23,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:23,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:23,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:23,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:23,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:23,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:23,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:23,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:23,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:23,737 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:23,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:23,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929450631] [2024-10-11 05:03:23,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929450631] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:23,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:23,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:03:23,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308546924] [2024-10-11 05:03:23,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:23,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:03:23,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:23,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:03:23,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:03:23,774 INFO L87 Difference]: Start difference. First operand has 309 states, 255 states have (on average 1.6901960784313725) internal successors, (431), 263 states have internal predecessors, (431), 36 states have call successors, (36), 15 states have call predecessors, (36), 15 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) 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:25,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:25,077 INFO L93 Difference]: Finished difference Result 723 states and 1169 transitions. [2024-10-11 05:03:25,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:03:25,079 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:25,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:25,096 INFO L225 Difference]: With dead ends: 723 [2024-10-11 05:03:25,097 INFO L226 Difference]: Without dead ends: 428 [2024-10-11 05:03:25,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:03:25,106 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 806 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 1258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:25,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 1230 Invalid, 1258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 05:03:25,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-10-11 05:03:25,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 391. [2024-10-11 05:03:25,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 320 states have (on average 1.546875) internal successors, (495), 327 states have internal predecessors, (495), 47 states have call successors, (47), 22 states have call predecessors, (47), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2024-10-11 05:03:25,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 590 transitions. [2024-10-11 05:03:25,208 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 590 transitions. Word has length 58 [2024-10-11 05:03:25,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:25,208 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 590 transitions. [2024-10-11 05:03:25,209 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:25,209 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 590 transitions. [2024-10-11 05:03:25,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:03:25,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:25,212 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:03:25,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 05:03:25,213 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:25,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:25,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1218751185, now seen corresponding path program 1 times [2024-10-11 05:03:25,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:25,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323611691] [2024-10-11 05:03:25,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:25,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:25,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:25,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:25,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:25,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:25,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:25,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:25,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:25,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:25,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:25,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:25,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:25,474 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:25,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:25,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323611691] [2024-10-11 05:03:25,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323611691] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:25,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:25,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:03:25,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897758247] [2024-10-11 05:03:25,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:25,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:03:25,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:25,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:03:25,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:03:25,483 INFO L87 Difference]: Start difference. First operand 391 states and 590 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:26,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:26,680 INFO L93 Difference]: Finished difference Result 711 states and 1040 transitions. [2024-10-11 05:03:26,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 05:03:26,681 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:26,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:26,690 INFO L225 Difference]: With dead ends: 711 [2024-10-11 05:03:26,692 INFO L226 Difference]: Without dead ends: 549 [2024-10-11 05:03:26,693 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:26,695 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 1128 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1153 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 1430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:26,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1153 Valid, 1234 Invalid, 1430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:03:26,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2024-10-11 05:03:26,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 479. [2024-10-11 05:03:26,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 388 states have (on average 1.5231958762886597) internal successors, (591), 397 states have internal predecessors, (591), 58 states have call successors, (58), 29 states have call predecessors, (58), 31 states have return successors, (67), 56 states have call predecessors, (67), 54 states have call successors, (67) [2024-10-11 05:03:26,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 716 transitions. [2024-10-11 05:03:26,768 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 716 transitions. Word has length 58 [2024-10-11 05:03:26,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:26,770 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 716 transitions. [2024-10-11 05:03:26,770 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:26,770 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 716 transitions. [2024-10-11 05:03:26,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:03:26,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:26,775 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:26,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 05:03:26,776 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:26,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:26,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1147943409, now seen corresponding path program 1 times [2024-10-11 05:03:26,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:26,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149659521] [2024-10-11 05:03:26,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:26,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:26,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:26,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:26,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:26,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:26,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:26,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:26,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:26,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:26,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:26,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:26,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:26,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:26,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:26,986 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:26,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:26,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149659521] [2024-10-11 05:03:26,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149659521] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:26,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:26,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 05:03:26,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45661680] [2024-10-11 05:03:26,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:26,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 05:03:26,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:26,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 05:03:26,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:03:26,992 INFO L87 Difference]: Start difference. First operand 479 states and 716 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:28,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:28,740 INFO L93 Difference]: Finished difference Result 1717 states and 2468 transitions. [2024-10-11 05:03:28,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-11 05:03:28,741 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:28,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:28,750 INFO L225 Difference]: With dead ends: 1717 [2024-10-11 05:03:28,750 INFO L226 Difference]: Without dead ends: 1455 [2024-10-11 05:03:28,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 05:03:28,753 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 2449 mSDsluCounter, 1397 mSDsCounter, 0 mSdLazyCounter, 1665 mSolverCounterSat, 510 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2463 SdHoareTripleChecker+Valid, 1689 SdHoareTripleChecker+Invalid, 2175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 510 IncrementalHoareTripleChecker+Valid, 1665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:28,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2463 Valid, 1689 Invalid, 2175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [510 Valid, 1665 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 05:03:28,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2024-10-11 05:03:28,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 1302. [2024-10-11 05:03:28,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 1028 states have (on average 1.4231517509727627) internal successors, (1463), 1052 states have internal predecessors, (1463), 146 states have call successors, (146), 112 states have call predecessors, (146), 126 states have return successors, (178), 140 states have call predecessors, (178), 142 states have call successors, (178) [2024-10-11 05:03:28,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 1787 transitions. [2024-10-11 05:03:28,894 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 1787 transitions. Word has length 58 [2024-10-11 05:03:28,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:28,894 INFO L471 AbstractCegarLoop]: Abstraction has 1302 states and 1787 transitions. [2024-10-11 05:03:28,895 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:28,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1787 transitions. [2024-10-11 05:03:28,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 05:03:28,897 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:28,897 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:28,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 05:03:28,897 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:28,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:28,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1595237125, now seen corresponding path program 1 times [2024-10-11 05:03:28,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:28,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317453641] [2024-10-11 05:03:28,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:28,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:28,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:28,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:28,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:28,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:28,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:29,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:29,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:29,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:29,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:29,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:29,035 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:29,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:29,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317453641] [2024-10-11 05:03:29,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317453641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:29,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:29,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:03:29,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803868725] [2024-10-11 05:03:29,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:29,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:03:29,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:29,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:03:29,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:03:29,037 INFO L87 Difference]: Start difference. First operand 1302 states and 1787 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:03:30,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:30,535 INFO L93 Difference]: Finished difference Result 2525 states and 3431 transitions. [2024-10-11 05:03:30,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 05:03:30,536 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2024-10-11 05:03:30,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:30,549 INFO L225 Difference]: With dead ends: 2525 [2024-10-11 05:03:30,550 INFO L226 Difference]: Without dead ends: 1446 [2024-10-11 05:03:30,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:03:30,556 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 385 mSDsluCounter, 1434 mSDsCounter, 0 mSdLazyCounter, 1457 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 1687 SdHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:30,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 1687 Invalid, 1535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1457 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 05:03:30,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2024-10-11 05:03:30,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 1326. [2024-10-11 05:03:30,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1326 states, 1046 states have (on average 1.4082217973231357) internal successors, (1473), 1070 states have internal predecessors, (1473), 146 states have call successors, (146), 112 states have call predecessors, (146), 132 states have return successors, (184), 146 states have call predecessors, (184), 142 states have call successors, (184) [2024-10-11 05:03:30,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 1803 transitions. [2024-10-11 05:03:30,670 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 1803 transitions. Word has length 59 [2024-10-11 05:03:30,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:30,672 INFO L471 AbstractCegarLoop]: Abstraction has 1326 states and 1803 transitions. [2024-10-11 05:03:30,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:03:30,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1803 transitions. [2024-10-11 05:03:30,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 05:03:30,674 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:30,675 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:30,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 05:03:30,676 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:30,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:30,677 INFO L85 PathProgramCache]: Analyzing trace with hash 327990909, now seen corresponding path program 1 times [2024-10-11 05:03:30,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:30,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103828853] [2024-10-11 05:03:30,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:30,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:30,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:30,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:30,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:30,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:30,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:30,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:30,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:30,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:30,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:30,937 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:30,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:30,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103828853] [2024-10-11 05:03:30,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103828853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:30,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:30,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:03:30,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493971857] [2024-10-11 05:03:30,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:30,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:03:30,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:30,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:03:30,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:03:30,942 INFO L87 Difference]: Start difference. First operand 1326 states and 1803 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:32,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:32,094 INFO L93 Difference]: Finished difference Result 2574 states and 3404 transitions. [2024-10-11 05:03:32,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 05:03:32,095 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:32,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:32,105 INFO L225 Difference]: With dead ends: 2574 [2024-10-11 05:03:32,105 INFO L226 Difference]: Without dead ends: 1678 [2024-10-11 05:03:32,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2024-10-11 05:03:32,112 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 1132 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:32,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1155 Valid, 1034 Invalid, 1362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:03:32,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2024-10-11 05:03:32,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1271. [2024-10-11 05:03:32,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 1007 states have (on average 1.4061569016881827) internal successors, (1416), 1026 states have internal predecessors, (1416), 140 states have call successors, (140), 107 states have call predecessors, (140), 122 states have return successors, (169), 139 states have call predecessors, (169), 136 states have call successors, (169) [2024-10-11 05:03:32,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1725 transitions. [2024-10-11 05:03:32,261 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 1725 transitions. Word has length 59 [2024-10-11 05:03:32,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:32,262 INFO L471 AbstractCegarLoop]: Abstraction has 1271 states and 1725 transitions. [2024-10-11 05:03:32,262 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:32,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1725 transitions. [2024-10-11 05:03:32,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 05:03:32,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:32,265 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:32,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 05:03:32,265 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:32,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:32,266 INFO L85 PathProgramCache]: Analyzing trace with hash 546845627, now seen corresponding path program 1 times [2024-10-11 05:03:32,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:32,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699275593] [2024-10-11 05:03:32,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:32,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:32,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:32,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:32,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:32,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:32,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:32,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:32,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:32,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:32,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:32,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:32,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:32,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:32,389 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:32,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:32,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699275593] [2024-10-11 05:03:32,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699275593] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:32,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:32,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:03:32,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846004036] [2024-10-11 05:03:32,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:32,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:03:32,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:32,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:03:32,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:32,391 INFO L87 Difference]: Start difference. First operand 1271 states and 1725 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:33,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:33,288 INFO L93 Difference]: Finished difference Result 3443 states and 4561 transitions. [2024-10-11 05:03:33,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 05:03:33,289 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:33,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:33,304 INFO L225 Difference]: With dead ends: 3443 [2024-10-11 05:03:33,304 INFO L226 Difference]: Without dead ends: 2396 [2024-10-11 05:03:33,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-10-11 05:03:33,309 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 1107 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1134 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:33,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1134 Valid, 837 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:03:33,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2024-10-11 05:03:33,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 2280. [2024-10-11 05:03:33,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2280 states, 1757 states have (on average 1.3392145702902676) internal successors, (2353), 1800 states have internal predecessors, (2353), 270 states have call successors, (270), 206 states have call predecessors, (270), 251 states have return successors, (381), 276 states have call predecessors, (381), 266 states have call successors, (381) [2024-10-11 05:03:33,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 3004 transitions. [2024-10-11 05:03:33,508 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 3004 transitions. Word has length 59 [2024-10-11 05:03:33,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:33,511 INFO L471 AbstractCegarLoop]: Abstraction has 2280 states and 3004 transitions. [2024-10-11 05:03:33,515 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:33,515 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 3004 transitions. [2024-10-11 05:03:33,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 05:03:33,516 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:33,517 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:33,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 05:03:33,517 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:33,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:33,517 INFO L85 PathProgramCache]: Analyzing trace with hash 455283125, now seen corresponding path program 1 times [2024-10-11 05:03:33,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:33,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339114425] [2024-10-11 05:03:33,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:33,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:33,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:33,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:33,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:33,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:33,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:33,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:33,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:33,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:33,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:33,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:33,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:33,661 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,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:33,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339114425] [2024-10-11 05:03:33,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339114425] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:33,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:33,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:03:33,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491847585] [2024-10-11 05:03:33,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:33,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:03:33,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:33,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:03:33,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:03:33,665 INFO L87 Difference]: Start difference. First operand 2280 states and 3004 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:34,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:34,576 INFO L93 Difference]: Finished difference Result 5422 states and 7060 transitions. [2024-10-11 05:03:34,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:03:34,577 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:34,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:34,594 INFO L225 Difference]: With dead ends: 5422 [2024-10-11 05:03:34,594 INFO L226 Difference]: Without dead ends: 3371 [2024-10-11 05:03:34,600 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:34,601 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 553 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:34,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 1004 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:03:34,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3371 states. [2024-10-11 05:03:34,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3371 to 3050. [2024-10-11 05:03:34,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3050 states, 2338 states have (on average 1.322070145423439) internal successors, (3091), 2388 states have internal predecessors, (3091), 366 states have call successors, (366), 286 states have call predecessors, (366), 344 states have return successors, (500), 378 states have call predecessors, (500), 362 states have call successors, (500) [2024-10-11 05:03:34,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3050 states to 3050 states and 3957 transitions. [2024-10-11 05:03:34,825 INFO L78 Accepts]: Start accepts. Automaton has 3050 states and 3957 transitions. Word has length 60 [2024-10-11 05:03:34,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:34,826 INFO L471 AbstractCegarLoop]: Abstraction has 3050 states and 3957 transitions. [2024-10-11 05:03:34,826 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:34,826 INFO L276 IsEmpty]: Start isEmpty. Operand 3050 states and 3957 transitions. [2024-10-11 05:03:34,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 05:03:34,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:34,827 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:34,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 05:03:34,827 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:34,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:34,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1180510132, now seen corresponding path program 1 times [2024-10-11 05:03:34,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:34,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991643892] [2024-10-11 05:03:34,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:34,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:34,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:34,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:34,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:34,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:34,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:34,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:34,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:34,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:34,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:34,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:34,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:34,916 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,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:34,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991643892] [2024-10-11 05:03:34,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991643892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:34,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:34,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:03:34,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904631463] [2024-10-11 05:03:34,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:34,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:03:34,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:34,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:03:34,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:03:34,922 INFO L87 Difference]: Start difference. First operand 3050 states and 3957 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:35,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:35,678 INFO L93 Difference]: Finished difference Result 6740 states and 8660 transitions. [2024-10-11 05:03:35,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:03:35,678 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:35,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:35,700 INFO L225 Difference]: With dead ends: 6740 [2024-10-11 05:03:35,701 INFO L226 Difference]: Without dead ends: 3917 [2024-10-11 05:03:35,707 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:35,709 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 1070 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:35,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1098 Valid, 689 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:03:35,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3917 states. [2024-10-11 05:03:36,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3917 to 3575. [2024-10-11 05:03:36,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3575 states, 2743 states have (on average 1.3142544659132336) internal successors, (3605), 2797 states have internal predecessors, (3605), 425 states have call successors, (425), 336 states have call predecessors, (425), 405 states have return successors, (582), 444 states have call predecessors, (582), 421 states have call successors, (582) [2024-10-11 05:03:36,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3575 states to 3575 states and 4612 transitions. [2024-10-11 05:03:36,099 INFO L78 Accepts]: Start accepts. Automaton has 3575 states and 4612 transitions. Word has length 66 [2024-10-11 05:03:36,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:36,099 INFO L471 AbstractCegarLoop]: Abstraction has 3575 states and 4612 transitions. [2024-10-11 05:03:36,100 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:36,100 INFO L276 IsEmpty]: Start isEmpty. Operand 3575 states and 4612 transitions. [2024-10-11 05:03:36,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 05:03:36,101 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:36,101 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:36,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 05:03:36,101 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:36,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:36,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1719551705, now seen corresponding path program 1 times [2024-10-11 05:03:36,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:36,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361067277] [2024-10-11 05:03:36,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:36,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:36,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:36,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:36,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:36,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:36,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:36,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:36,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:36,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:36,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:36,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:36,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:36,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:36,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:36,205 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:36,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:36,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361067277] [2024-10-11 05:03:36,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361067277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:36,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:36,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:03:36,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289721897] [2024-10-11 05:03:36,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:36,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:03:36,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:36,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:03:36,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:36,208 INFO L87 Difference]: Start difference. First operand 3575 states and 4612 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:37,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:37,391 INFO L93 Difference]: Finished difference Result 4683 states and 5994 transitions. [2024-10-11 05:03:37,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 05:03:37,392 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:37,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:37,418 INFO L225 Difference]: With dead ends: 4683 [2024-10-11 05:03:37,418 INFO L226 Difference]: Without dead ends: 4680 [2024-10-11 05:03:37,422 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:37,424 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 1290 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1299 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:37,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1299 Valid, 856 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:03:37,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4680 states. [2024-10-11 05:03:37,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4680 to 4002. [2024-10-11 05:03:37,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4002 states, 3060 states have (on average 1.304248366013072) internal successors, (3991), 3118 states have internal predecessors, (3991), 478 states have call successors, (478), 380 states have call predecessors, (478), 462 states have return successors, (664), 506 states have call predecessors, (664), 475 states have call successors, (664) [2024-10-11 05:03:37,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4002 states to 4002 states and 5133 transitions. [2024-10-11 05:03:37,765 INFO L78 Accepts]: Start accepts. Automaton has 4002 states and 5133 transitions. Word has length 67 [2024-10-11 05:03:37,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:37,765 INFO L471 AbstractCegarLoop]: Abstraction has 4002 states and 5133 transitions. [2024-10-11 05:03:37,766 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:37,766 INFO L276 IsEmpty]: Start isEmpty. Operand 4002 states and 5133 transitions. [2024-10-11 05:03:37,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 05:03:37,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:37,768 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:37,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 05:03:37,768 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:37,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:37,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1765467294, now seen corresponding path program 1 times [2024-10-11 05:03:37,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:37,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396684735] [2024-10-11 05:03:37,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:37,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:37,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:37,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:37,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:37,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:37,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:37,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:37,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:37,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:37,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:37,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:37,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:37,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:37,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:37,931 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:37,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:37,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396684735] [2024-10-11 05:03:37,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396684735] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:03:37,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966115940] [2024-10-11 05:03:37,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:37,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:03:37,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:03:37,935 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:37,938 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:38,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:38,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 05:03:38,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:03:38,278 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:38,279 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 05:03:38,365 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:38,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966115940] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 05:03:38,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 05:03:38,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2024-10-11 05:03:38,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970231496] [2024-10-11 05:03:38,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 05:03:38,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 05:03:38,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:38,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 05:03:38,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:03:38,369 INFO L87 Difference]: Start difference. First operand 4002 states and 5133 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:40,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:40,694 INFO L93 Difference]: Finished difference Result 8209 states and 10407 transitions. [2024-10-11 05:03:40,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-11 05:03:40,695 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:40,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:40,753 INFO L225 Difference]: With dead ends: 8209 [2024-10-11 05:03:40,754 INFO L226 Difference]: Without dead ends: 8206 [2024-10-11 05:03:40,765 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:40,766 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 1224 mSDsluCounter, 1478 mSDsCounter, 0 mSdLazyCounter, 2083 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1282 SdHoareTripleChecker+Valid, 1806 SdHoareTripleChecker+Invalid, 2228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 2083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:40,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1282 Valid, 1806 Invalid, 2228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 2083 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 05:03:40,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8206 states. [2024-10-11 05:03:41,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8206 to 7181. [2024-10-11 05:03:41,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7181 states, 5472 states have (on average 1.2905701754385965) internal successors, (7062), 5574 states have internal predecessors, (7062), 857 states have call successors, (857), 694 states have call predecessors, (857), 850 states have return successors, (1201), 915 states have call predecessors, (1201), 854 states have call successors, (1201) [2024-10-11 05:03:41,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7181 states to 7181 states and 9120 transitions. [2024-10-11 05:03:41,690 INFO L78 Accepts]: Start accepts. Automaton has 7181 states and 9120 transitions. Word has length 68 [2024-10-11 05:03:41,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:41,690 INFO L471 AbstractCegarLoop]: Abstraction has 7181 states and 9120 transitions. [2024-10-11 05:03:41,691 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:41,691 INFO L276 IsEmpty]: Start isEmpty. Operand 7181 states and 9120 transitions. [2024-10-11 05:03:41,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 05:03:41,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:41,692 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:41,710 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:41,893 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,SelfDestructingSolverStorable9 [2024-10-11 05:03:41,894 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:41,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:41,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1942506137, now seen corresponding path program 2 times [2024-10-11 05:03:41,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:41,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717358328] [2024-10-11 05:03:41,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:41,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:41,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:41,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:41,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:41,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:41,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:41,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:41,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:41,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:41,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:41,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:41,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:41,968 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:41,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:41,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717358328] [2024-10-11 05:03:41,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717358328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:41,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:41,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:03:41,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263361751] [2024-10-11 05:03:41,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:41,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:03:41,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:41,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:03:41,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:03:41,970 INFO L87 Difference]: Start difference. First operand 7181 states and 9120 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:43,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:43,038 INFO L93 Difference]: Finished difference Result 9691 states and 12332 transitions. [2024-10-11 05:03:43,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 05:03:43,039 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:43,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:43,054 INFO L225 Difference]: With dead ends: 9691 [2024-10-11 05:03:43,054 INFO L226 Difference]: Without dead ends: 3986 [2024-10-11 05:03:43,063 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:43,063 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 795 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:43,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 923 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:03:43,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3986 states. [2024-10-11 05:03:43,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3986 to 2941. [2024-10-11 05:03:43,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2941 states, 2264 states have (on average 1.2901943462897527) internal successors, (2921), 2300 states have internal predecessors, (2921), 350 states have call successors, (350), 276 states have call predecessors, (350), 325 states have return successors, (460), 367 states have call predecessors, (460), 347 states have call successors, (460) [2024-10-11 05:03:43,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2941 states to 2941 states and 3731 transitions. [2024-10-11 05:03:43,345 INFO L78 Accepts]: Start accepts. Automaton has 2941 states and 3731 transitions. Word has length 71 [2024-10-11 05:03:43,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:43,346 INFO L471 AbstractCegarLoop]: Abstraction has 2941 states and 3731 transitions. [2024-10-11 05:03:43,347 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:43,347 INFO L276 IsEmpty]: Start isEmpty. Operand 2941 states and 3731 transitions. [2024-10-11 05:03:43,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 05:03:43,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:43,349 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:43,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 05:03:43,350 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:43,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:43,350 INFO L85 PathProgramCache]: Analyzing trace with hash 854652747, now seen corresponding path program 1 times [2024-10-11 05:03:43,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:43,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453150979] [2024-10-11 05:03:43,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:43,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:43,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:43,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:43,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:43,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:43,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:43,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:43,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:43,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:43,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:03:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:43,480 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:43,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:43,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453150979] [2024-10-11 05:03:43,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453150979] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:43,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:43,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:03:43,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385202462] [2024-10-11 05:03:43,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:43,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:03:43,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:43,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:03:43,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:03:43,482 INFO L87 Difference]: Start difference. First operand 2941 states and 3731 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:44,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:44,904 INFO L93 Difference]: Finished difference Result 8543 states and 10741 transitions. [2024-10-11 05:03:44,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 05:03:44,905 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:44,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:44,924 INFO L225 Difference]: With dead ends: 8543 [2024-10-11 05:03:44,924 INFO L226 Difference]: Without dead ends: 5030 [2024-10-11 05:03:44,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2024-10-11 05:03:44,931 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 839 mSDsluCounter, 1247 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:44,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 1513 Invalid, 1330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 05:03:44,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5030 states. [2024-10-11 05:03:45,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5030 to 4683. [2024-10-11 05:03:45,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4683 states, 3551 states have (on average 1.2562658406082794) internal successors, (4461), 3618 states have internal predecessors, (4461), 568 states have call successors, (568), 448 states have call predecessors, (568), 562 states have return successors, (854), 619 states have call predecessors, (854), 565 states have call successors, (854) [2024-10-11 05:03:45,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4683 states to 4683 states and 5883 transitions. [2024-10-11 05:03:45,380 INFO L78 Accepts]: Start accepts. Automaton has 4683 states and 5883 transitions. Word has length 76 [2024-10-11 05:03:45,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:45,380 INFO L471 AbstractCegarLoop]: Abstraction has 4683 states and 5883 transitions. [2024-10-11 05:03:45,380 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:45,380 INFO L276 IsEmpty]: Start isEmpty. Operand 4683 states and 5883 transitions. [2024-10-11 05:03:45,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 05:03:45,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:45,382 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:45,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 05:03:45,382 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:45,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:45,382 INFO L85 PathProgramCache]: Analyzing trace with hash -91040578, now seen corresponding path program 1 times [2024-10-11 05:03:45,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:45,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620428942] [2024-10-11 05:03:45,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:45,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:45,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:45,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:45,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:45,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:45,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:45,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:45,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:45,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:45,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:45,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 05:03:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:45,483 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:45,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:45,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620428942] [2024-10-11 05:03:45,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620428942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:45,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:45,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:03:45,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765557432] [2024-10-11 05:03:45,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:45,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:03:45,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:45,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:03:45,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:03:45,486 INFO L87 Difference]: Start difference. First operand 4683 states and 5883 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:47,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:47,291 INFO L93 Difference]: Finished difference Result 8711 states and 10818 transitions. [2024-10-11 05:03:47,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 05:03:47,292 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:47,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:47,320 INFO L225 Difference]: With dead ends: 8711 [2024-10-11 05:03:47,320 INFO L226 Difference]: Without dead ends: 4778 [2024-10-11 05:03:47,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2024-10-11 05:03:47,334 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 1988 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 432 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2021 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 1637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 432 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:47,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2021 Valid, 1106 Invalid, 1637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [432 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:03:47,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4778 states. [2024-10-11 05:03:48,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4778 to 4412. [2024-10-11 05:03:48,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4412 states, 3328 states have (on average 1.2328725961538463) internal successors, (4103), 3397 states have internal predecessors, (4103), 538 states have call successors, (538), 430 states have call predecessors, (538), 544 states have return successors, (745), 587 states have call predecessors, (745), 535 states have call successors, (745) [2024-10-11 05:03:48,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4412 states to 4412 states and 5386 transitions. [2024-10-11 05:03:48,123 INFO L78 Accepts]: Start accepts. Automaton has 4412 states and 5386 transitions. Word has length 86 [2024-10-11 05:03:48,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:48,124 INFO L471 AbstractCegarLoop]: Abstraction has 4412 states and 5386 transitions. [2024-10-11 05:03:48,124 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:48,124 INFO L276 IsEmpty]: Start isEmpty. Operand 4412 states and 5386 transitions. [2024-10-11 05:03:48,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 05:03:48,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:48,126 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] [2024-10-11 05:03:48,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 05:03:48,126 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:48,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:48,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1641909896, now seen corresponding path program 1 times [2024-10-11 05:03:48,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:48,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649999329] [2024-10-11 05:03:48,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:48,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:48,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:48,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 05:03:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:48,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 05:03:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:48,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:03:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:48,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 05:03:48,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:48,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:48,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:48,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649999329] [2024-10-11 05:03:48,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649999329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:48,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:48,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:03:48,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831144634] [2024-10-11 05:03:48,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:48,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:03:48,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:48,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:03:48,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:03:48,198 INFO L87 Difference]: Start difference. First operand 4412 states and 5386 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 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:03:49,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:49,819 INFO L93 Difference]: Finished difference Result 4687 states and 5835 transitions. [2024-10-11 05:03:49,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:03:49,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 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 102 [2024-10-11 05:03:49,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:49,835 INFO L225 Difference]: With dead ends: 4687 [2024-10-11 05:03:49,836 INFO L226 Difference]: Without dead ends: 4482 [2024-10-11 05:03:49,837 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:03:49,838 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 657 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:49,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 613 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 05:03:49,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4482 states. [2024-10-11 05:03:50,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4482 to 4412. [2024-10-11 05:03:50,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4412 states, 3328 states have (on average 1.2325721153846154) internal successors, (4102), 3397 states have internal predecessors, (4102), 538 states have call successors, (538), 430 states have call predecessors, (538), 544 states have return successors, (745), 587 states have call predecessors, (745), 535 states have call successors, (745) [2024-10-11 05:03:50,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4412 states to 4412 states and 5385 transitions. [2024-10-11 05:03:50,601 INFO L78 Accepts]: Start accepts. Automaton has 4412 states and 5385 transitions. Word has length 102 [2024-10-11 05:03:50,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:50,602 INFO L471 AbstractCegarLoop]: Abstraction has 4412 states and 5385 transitions. [2024-10-11 05:03:50,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 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:03:50,602 INFO L276 IsEmpty]: Start isEmpty. Operand 4412 states and 5385 transitions. [2024-10-11 05:03:50,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 05:03:50,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:50,605 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] [2024-10-11 05:03:50,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 05:03:50,606 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:50,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:50,606 INFO L85 PathProgramCache]: Analyzing trace with hash -235153334, now seen corresponding path program 1 times [2024-10-11 05:03:50,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:50,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353982122] [2024-10-11 05:03:50,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:50,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:50,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:50,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 05:03:50,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:50,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 05:03:50,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:50,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:03:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:50,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 05:03:50,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:50,762 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:50,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:50,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353982122] [2024-10-11 05:03:50,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353982122] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:50,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:50,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:03:50,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956850608] [2024-10-11 05:03:50,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:50,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:03:50,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:50,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:03:50,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:50,765 INFO L87 Difference]: Start difference. First operand 4412 states and 5385 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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:03:53,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:53,396 INFO L93 Difference]: Finished difference Result 4978 states and 6320 transitions. [2024-10-11 05:03:53,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:03:53,397 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 102 [2024-10-11 05:03:53,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:53,411 INFO L225 Difference]: With dead ends: 4978 [2024-10-11 05:03:53,412 INFO L226 Difference]: Without dead ends: 4775 [2024-10-11 05:03:53,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:03:53,414 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 1000 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 2432 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 2524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 2432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:53,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1023 Valid, 1525 Invalid, 2524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 2432 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 05:03:53,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4775 states. [2024-10-11 05:03:54,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4775 to 4624. [2024-10-11 05:03:54,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4624 states, 3515 states have (on average 1.253769559032717) internal successors, (4407), 3586 states have internal predecessors, (4407), 555 states have call successors, (555), 436 states have call predecessors, (555), 552 states have return successors, (769), 605 states have call predecessors, (769), 552 states have call successors, (769) [2024-10-11 05:03:54,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4624 states to 4624 states and 5731 transitions. [2024-10-11 05:03:54,706 INFO L78 Accepts]: Start accepts. Automaton has 4624 states and 5731 transitions. Word has length 102 [2024-10-11 05:03:54,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:54,707 INFO L471 AbstractCegarLoop]: Abstraction has 4624 states and 5731 transitions. [2024-10-11 05:03:54,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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:03:54,707 INFO L276 IsEmpty]: Start isEmpty. Operand 4624 states and 5731 transitions. [2024-10-11 05:03:54,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 05:03:54,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:54,715 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] [2024-10-11 05:03:54,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 05:03:54,717 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:54,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:54,718 INFO L85 PathProgramCache]: Analyzing trace with hash 2101239176, now seen corresponding path program 1 times [2024-10-11 05:03:54,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:54,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797330144] [2024-10-11 05:03:54,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:54,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:54,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:54,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:54,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 05:03:54,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:55,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 05:03:55,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:55,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:03:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:55,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 05:03:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:55,132 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:55,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:55,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797330144] [2024-10-11 05:03:55,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797330144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:55,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:55,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:03:55,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508851137] [2024-10-11 05:03:55,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:55,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:03:55,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:55,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:03:55,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:55,136 INFO L87 Difference]: Start difference. First operand 4624 states and 5731 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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:03:57,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:57,930 INFO L93 Difference]: Finished difference Result 5692 states and 7482 transitions. [2024-10-11 05:03:57,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:03:57,931 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 102 [2024-10-11 05:03:57,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:57,961 INFO L225 Difference]: With dead ends: 5692 [2024-10-11 05:03:57,961 INFO L226 Difference]: Without dead ends: 5279 [2024-10-11 05:03:57,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:03:57,974 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 1025 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 2229 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 2329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 2229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:57,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1048 Valid, 1435 Invalid, 2329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 2229 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 05:03:57,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5279 states. [2024-10-11 05:03:59,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5279 to 5012. [2024-10-11 05:03:59,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5012 states, 3859 states have (on average 1.2847888053899974) internal successors, (4958), 3932 states have internal predecessors, (4958), 585 states have call successors, (585), 448 states have call predecessors, (585), 566 states have return successors, (809), 637 states have call predecessors, (809), 582 states have call successors, (809) [2024-10-11 05:03:59,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5012 states to 5012 states and 6352 transitions. [2024-10-11 05:03:59,139 INFO L78 Accepts]: Start accepts. Automaton has 5012 states and 6352 transitions. Word has length 102 [2024-10-11 05:03:59,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:59,140 INFO L471 AbstractCegarLoop]: Abstraction has 5012 states and 6352 transitions. [2024-10-11 05:03:59,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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:03:59,140 INFO L276 IsEmpty]: Start isEmpty. Operand 5012 states and 6352 transitions. [2024-10-11 05:03:59,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 05:03:59,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:59,153 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:03:59,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 05:03:59,153 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:59,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:59,154 INFO L85 PathProgramCache]: Analyzing trace with hash -317245302, now seen corresponding path program 1 times [2024-10-11 05:03:59,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:59,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151347795] [2024-10-11 05:03:59,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:59,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:59,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:59,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:59,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 05:03:59,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:59,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 05:03:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:59,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:03:59,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:59,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 05:03:59,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:59,324 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,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:59,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151347795] [2024-10-11 05:03:59,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151347795] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:59,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:59,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:03:59,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057350916] [2024-10-11 05:03:59,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:59,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:03:59,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:59,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:03:59,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:59,326 INFO L87 Difference]: Start difference. First operand 5012 states and 6352 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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:01,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:01,115 INFO L93 Difference]: Finished difference Result 6085 states and 8126 transitions. [2024-10-11 05:04:01,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:04:01,115 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 102 [2024-10-11 05:04:01,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:01,136 INFO L225 Difference]: With dead ends: 6085 [2024-10-11 05:04:01,136 INFO L226 Difference]: Without dead ends: 5282 [2024-10-11 05:04:01,141 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:01,141 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 949 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 973 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:01,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [973 Valid, 730 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:04:01,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5282 states. [2024-10-11 05:04:02,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5282 to 5012. [2024-10-11 05:04:02,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5012 states, 3859 states have (on average 1.2834931329359938) internal successors, (4953), 3932 states have internal predecessors, (4953), 585 states have call successors, (585), 448 states have call predecessors, (585), 566 states have return successors, (809), 637 states have call predecessors, (809), 582 states have call successors, (809) [2024-10-11 05:04:02,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5012 states to 5012 states and 6347 transitions. [2024-10-11 05:04:02,114 INFO L78 Accepts]: Start accepts. Automaton has 5012 states and 6347 transitions. Word has length 102 [2024-10-11 05:04:02,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:02,114 INFO L471 AbstractCegarLoop]: Abstraction has 5012 states and 6347 transitions. [2024-10-11 05:04:02,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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:02,115 INFO L276 IsEmpty]: Start isEmpty. Operand 5012 states and 6347 transitions. [2024-10-11 05:04:02,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 05:04:02,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:02,118 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] [2024-10-11 05:04:02,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 05:04:02,119 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:02,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:02,119 INFO L85 PathProgramCache]: Analyzing trace with hash 2098591048, now seen corresponding path program 1 times [2024-10-11 05:04:02,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:02,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283557206] [2024-10-11 05:04:02,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:02,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:02,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:02,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:02,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:02,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 05:04:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:02,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 05:04:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:02,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:04:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:02,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 05:04:02,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:02,245 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,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:02,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283557206] [2024-10-11 05:04:02,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283557206] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:02,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:02,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:04:02,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755319606] [2024-10-11 05:04:02,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:02,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:04:02,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:02,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:04:02,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:02,248 INFO L87 Difference]: Start difference. First operand 5012 states and 6347 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:04,200 INFO L93 Difference]: Finished difference Result 6081 states and 8105 transitions. [2024-10-11 05:04:04,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:04:04,201 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 102 [2024-10-11 05:04:04,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:04,223 INFO L225 Difference]: With dead ends: 6081 [2024-10-11 05:04:04,224 INFO L226 Difference]: Without dead ends: 5278 [2024-10-11 05:04:04,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:04:04,231 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 814 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 1334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:04,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 880 Invalid, 1334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 05:04:04,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5278 states. [2024-10-11 05:04:05,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5278 to 5012. [2024-10-11 05:04:05,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5012 states, 3859 states have (on average 1.2821974604819901) internal successors, (4948), 3932 states have internal predecessors, (4948), 585 states have call successors, (585), 448 states have call predecessors, (585), 566 states have return successors, (809), 637 states have call predecessors, (809), 582 states have call successors, (809) [2024-10-11 05:04:05,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5012 states to 5012 states and 6342 transitions. [2024-10-11 05:04:05,149 INFO L78 Accepts]: Start accepts. Automaton has 5012 states and 6342 transitions. Word has length 102 [2024-10-11 05:04:05,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:05,149 INFO L471 AbstractCegarLoop]: Abstraction has 5012 states and 6342 transitions. [2024-10-11 05:04:05,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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,150 INFO L276 IsEmpty]: Start isEmpty. Operand 5012 states and 6342 transitions. [2024-10-11 05:04:05,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 05:04:05,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:05,157 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] [2024-10-11 05:04:05,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 05:04:05,157 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:05,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:05,161 INFO L85 PathProgramCache]: Analyzing trace with hash -871520054, now seen corresponding path program 1 times [2024-10-11 05:04:05,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:05,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131776574] [2024-10-11 05:04:05,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:05,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:05,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:05,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:05,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 05:04:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:05,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 05:04:05,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:05,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:04:05,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:05,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 05:04:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:05,347 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,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:05,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131776574] [2024-10-11 05:04:05,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131776574] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:05,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:05,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:04:05,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092566179] [2024-10-11 05:04:05,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:05,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:04:05,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:05,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:04:05,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:05,352 INFO L87 Difference]: Start difference. First operand 5012 states and 6342 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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:06,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:06,965 INFO L93 Difference]: Finished difference Result 6076 states and 8082 transitions. [2024-10-11 05:04:06,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:04:06,965 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 102 [2024-10-11 05:04:06,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:06,983 INFO L225 Difference]: With dead ends: 6076 [2024-10-11 05:04:06,983 INFO L226 Difference]: Without dead ends: 5273 [2024-10-11 05:04:06,987 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:06,987 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 945 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 1236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:06,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 730 Invalid, 1236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 05:04:06,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5273 states. [2024-10-11 05:04:07,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5273 to 5012. [2024-10-11 05:04:07,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5012 states, 3859 states have (on average 1.2809017880279865) internal successors, (4943), 3932 states have internal predecessors, (4943), 585 states have call successors, (585), 448 states have call predecessors, (585), 566 states have return successors, (809), 637 states have call predecessors, (809), 582 states have call successors, (809) [2024-10-11 05:04:07,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5012 states to 5012 states and 6337 transitions. [2024-10-11 05:04:07,873 INFO L78 Accepts]: Start accepts. Automaton has 5012 states and 6337 transitions. Word has length 102 [2024-10-11 05:04:07,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:07,874 INFO L471 AbstractCegarLoop]: Abstraction has 5012 states and 6337 transitions. [2024-10-11 05:04:07,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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,874 INFO L276 IsEmpty]: Start isEmpty. Operand 5012 states and 6337 transitions. [2024-10-11 05:04:07,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 05:04:07,877 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:07,877 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] [2024-10-11 05:04:07,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 05:04:07,878 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:07,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:07,878 INFO L85 PathProgramCache]: Analyzing trace with hash 695237896, now seen corresponding path program 1 times [2024-10-11 05:04:07,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:07,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509796789] [2024-10-11 05:04:07,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:07,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:07,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:07,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:07,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:07,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 05:04:07,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:07,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 05:04:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:07,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:04:08,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:08,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 05:04:08,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:08,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:08,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:08,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509796789] [2024-10-11 05:04:08,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509796789] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:08,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:08,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:04:08,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149164542] [2024-10-11 05:04:08,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:08,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:04:08,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:08,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:04:08,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:08,005 INFO L87 Difference]: Start difference. First operand 5012 states and 6337 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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:10,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:10,999 INFO L93 Difference]: Finished difference Result 7069 states and 9653 transitions. [2024-10-11 05:04:11,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:04:11,000 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 102 [2024-10-11 05:04:11,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:11,022 INFO L225 Difference]: With dead ends: 7069 [2024-10-11 05:04:11,023 INFO L226 Difference]: Without dead ends: 6268 [2024-10-11 05:04:11,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:04:11,027 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 991 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 2338 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1014 SdHoareTripleChecker+Valid, 1522 SdHoareTripleChecker+Invalid, 2432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 2338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:11,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1014 Valid, 1522 Invalid, 2432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 2338 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 05:04:11,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6268 states. [2024-10-11 05:04:12,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6268 to 5799. [2024-10-11 05:04:12,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5799 states, 4558 states have (on average 1.326020184291356) internal successors, (6044), 4635 states have internal predecessors, (6044), 645 states have call successors, (645), 472 states have call predecessors, (645), 594 states have return successors, (895), 701 states have call predecessors, (895), 642 states have call successors, (895) [2024-10-11 05:04:12,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5799 states to 5799 states and 7584 transitions. [2024-10-11 05:04:12,137 INFO L78 Accepts]: Start accepts. Automaton has 5799 states and 7584 transitions. Word has length 102 [2024-10-11 05:04:12,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:12,137 INFO L471 AbstractCegarLoop]: Abstraction has 5799 states and 7584 transitions. [2024-10-11 05:04:12,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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,138 INFO L276 IsEmpty]: Start isEmpty. Operand 5799 states and 7584 transitions. [2024-10-11 05:04:12,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 05:04:12,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:12,142 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] [2024-10-11 05:04:12,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 05:04:12,142 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:12,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:12,143 INFO L85 PathProgramCache]: Analyzing trace with hash -362600182, now seen corresponding path program 1 times [2024-10-11 05:04:12,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:12,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100405793] [2024-10-11 05:04:12,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:12,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:12,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:12,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:12,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:12,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 05:04:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:12,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 05:04:12,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:12,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:04:12,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:12,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 05:04:12,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:12,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:04:12,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:12,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100405793] [2024-10-11 05:04:12,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100405793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:12,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:12,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:04:12,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217241308] [2024-10-11 05:04:12,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:12,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:04:12,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:12,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:04:12,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:12,298 INFO L87 Difference]: Start difference. First operand 5799 states and 7584 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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:15,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:15,507 INFO L93 Difference]: Finished difference Result 10488 states and 15138 transitions. [2024-10-11 05:04:15,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:04:15,508 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 102 [2024-10-11 05:04:15,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:15,538 INFO L225 Difference]: With dead ends: 10488 [2024-10-11 05:04:15,539 INFO L226 Difference]: Without dead ends: 8900 [2024-10-11 05:04:15,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:04:15,548 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 1053 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 2702 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 2798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 2702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:15,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 1517 Invalid, 2798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 2702 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 05:04:15,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8900 states. [2024-10-11 05:04:16,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8900 to 7364. [2024-10-11 05:04:16,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7364 states, 5955 states have (on average 1.385054575986566) internal successors, (8248), 6040 states have internal predecessors, (8248), 757 states have call successors, (757), 520 states have call predecessors, (757), 650 states have return successors, (1077), 821 states have call predecessors, (1077), 754 states have call successors, (1077) [2024-10-11 05:04:16,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7364 states to 7364 states and 10082 transitions. [2024-10-11 05:04:16,618 INFO L78 Accepts]: Start accepts. Automaton has 7364 states and 10082 transitions. Word has length 102 [2024-10-11 05:04:16,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:16,618 INFO L471 AbstractCegarLoop]: Abstraction has 7364 states and 10082 transitions. [2024-10-11 05:04:16,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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,619 INFO L276 IsEmpty]: Start isEmpty. Operand 7364 states and 10082 transitions. [2024-10-11 05:04:16,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 05:04:16,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:16,624 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 05:04:16,625 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:16,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:16,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1505102648, now seen corresponding path program 1 times [2024-10-11 05:04:16,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:16,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169742677] [2024-10-11 05:04:16,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:16,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:16,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:16,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:16,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:16,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 05:04:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:16,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 05:04:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:16,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:04:16,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:16,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 05:04:16,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:16,762 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:16,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:16,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169742677] [2024-10-11 05:04:16,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169742677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:16,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:16,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:04:16,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816075695] [2024-10-11 05:04:16,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:16,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:04:16,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:16,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:04:16,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:16,765 INFO L87 Difference]: Start difference. First operand 7364 states and 10082 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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:18,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:18,990 INFO L93 Difference]: Finished difference Result 11414 states and 16687 transitions. [2024-10-11 05:04:18,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:04:18,991 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 102 [2024-10-11 05:04:18,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:19,023 INFO L225 Difference]: With dead ends: 11414 [2024-10-11 05:04:19,024 INFO L226 Difference]: Without dead ends: 8259 [2024-10-11 05:04:19,035 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:19,036 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 947 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:19,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 729 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:04:19,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8259 states. [2024-10-11 05:04:20,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8259 to 7364. [2024-10-11 05:04:20,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7364 states, 5955 states have (on average 1.3821998320738875) internal successors, (8231), 6040 states have internal predecessors, (8231), 757 states have call successors, (757), 520 states have call predecessors, (757), 650 states have return successors, (1077), 821 states have call predecessors, (1077), 754 states have call successors, (1077) [2024-10-11 05:04:20,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7364 states to 7364 states and 10065 transitions. [2024-10-11 05:04:20,600 INFO L78 Accepts]: Start accepts. Automaton has 7364 states and 10065 transitions. Word has length 102 [2024-10-11 05:04:20,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:20,601 INFO L471 AbstractCegarLoop]: Abstraction has 7364 states and 10065 transitions. [2024-10-11 05:04:20,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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,601 INFO L276 IsEmpty]: Start isEmpty. Operand 7364 states and 10065 transitions. [2024-10-11 05:04:20,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 05:04:20,607 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:20,607 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] [2024-10-11 05:04:20,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 05:04:20,607 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:20,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:20,608 INFO L85 PathProgramCache]: Analyzing trace with hash -666068986, now seen corresponding path program 1 times [2024-10-11 05:04:20,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:20,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902038330] [2024-10-11 05:04:20,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:20,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:20,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:20,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 05:04:20,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:20,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 05:04:20,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:20,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:04:20,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:20,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 05:04:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:20,809 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:20,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:20,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902038330] [2024-10-11 05:04:20,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902038330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:20,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:20,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:04:20,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382182600] [2024-10-11 05:04:20,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:20,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:04:20,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:20,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:04:20,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:20,811 INFO L87 Difference]: Start difference. First operand 7364 states and 10065 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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:24,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:24,689 INFO L93 Difference]: Finished difference Result 16063 states and 24086 transitions. [2024-10-11 05:04:24,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:04:24,689 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 102 [2024-10-11 05:04:24,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:24,731 INFO L225 Difference]: With dead ends: 16063 [2024-10-11 05:04:24,731 INFO L226 Difference]: Without dead ends: 12910 [2024-10-11 05:04:24,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:04:24,744 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 1136 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 2109 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1166 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 2214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 2109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:24,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1166 Valid, 1435 Invalid, 2214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 2109 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 05:04:24,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12910 states. [2024-10-11 05:04:26,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12910 to 10525. [2024-10-11 05:04:26,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10525 states, 8788 states have (on average 1.443445607646791) internal successors, (12685), 8889 states have internal predecessors, (12685), 973 states have call successors, (973), 616 states have call predecessors, (973), 762 states have return successors, (1487), 1053 states have call predecessors, (1487), 970 states have call successors, (1487) [2024-10-11 05:04:26,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10525 states to 10525 states and 15145 transitions. [2024-10-11 05:04:26,261 INFO L78 Accepts]: Start accepts. Automaton has 10525 states and 15145 transitions. Word has length 102 [2024-10-11 05:04:26,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:26,262 INFO L471 AbstractCegarLoop]: Abstraction has 10525 states and 15145 transitions. [2024-10-11 05:04:26,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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,263 INFO L276 IsEmpty]: Start isEmpty. Operand 10525 states and 15145 transitions. [2024-10-11 05:04:26,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 05:04:26,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:26,270 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] [2024-10-11 05:04:26,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 05:04:26,270 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:26,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:26,271 INFO L85 PathProgramCache]: Analyzing trace with hash -639003384, now seen corresponding path program 1 times [2024-10-11 05:04:26,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:26,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788073907] [2024-10-11 05:04:26,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:26,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:26,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:26,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 05:04:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:26,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 05:04:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:26,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:04:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:26,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 05:04:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:26,408 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:26,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:26,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788073907] [2024-10-11 05:04:26,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788073907] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:26,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:26,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:04:26,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848519376] [2024-10-11 05:04:26,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:26,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:04:26,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:26,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:04:26,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:26,410 INFO L87 Difference]: Start difference. First operand 10525 states and 15145 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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:30,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:30,870 INFO L93 Difference]: Finished difference Result 27386 states and 42496 transitions. [2024-10-11 05:04:30,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:04:30,871 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 102 [2024-10-11 05:04:30,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:30,920 INFO L225 Difference]: With dead ends: 27386 [2024-10-11 05:04:30,920 INFO L226 Difference]: Without dead ends: 21072 [2024-10-11 05:04:30,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:04:30,936 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 1091 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 2215 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 2312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 2215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:30,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1121 Valid, 1514 Invalid, 2312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 2215 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 05:04:30,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21072 states. [2024-10-11 05:04:33,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21072 to 16847. [2024-10-11 05:04:33,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16847 states, 14470 states have (on average 1.4944713199723565) internal successors, (21625), 14603 states have internal predecessors, (21625), 1389 states have call successors, (1389), 808 states have call predecessors, (1389), 986 states have return successors, (2453), 1501 states have call predecessors, (2453), 1386 states have call successors, (2453) [2024-10-11 05:04:33,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16847 states to 16847 states and 25467 transitions. [2024-10-11 05:04:33,110 INFO L78 Accepts]: Start accepts. Automaton has 16847 states and 25467 transitions. Word has length 102 [2024-10-11 05:04:33,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:33,110 INFO L471 AbstractCegarLoop]: Abstraction has 16847 states and 25467 transitions. [2024-10-11 05:04:33,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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:33,111 INFO L276 IsEmpty]: Start isEmpty. Operand 16847 states and 25467 transitions. [2024-10-11 05:04:33,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 05:04:33,123 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:33,123 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] [2024-10-11 05:04:33,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 05:04:33,124 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:33,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:33,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1578627014, now seen corresponding path program 1 times [2024-10-11 05:04:33,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:33,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064799725] [2024-10-11 05:04:33,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:33,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:33,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:33,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 05:04:33,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:33,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 05:04:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:33,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:04:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:33,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 05:04:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:33,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:04:33,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:33,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064799725] [2024-10-11 05:04:33,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064799725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:33,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:33,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:04:33,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522431609] [2024-10-11 05:04:33,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:33,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:04:33,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:33,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:04:33,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:33,413 INFO L87 Difference]: Start difference. First operand 16847 states and 25467 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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:36,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:36,375 INFO L93 Difference]: Finished difference Result 32604 states and 51633 transitions. [2024-10-11 05:04:36,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:04:36,376 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 102 [2024-10-11 05:04:36,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:36,429 INFO L225 Difference]: With dead ends: 32604 [2024-10-11 05:04:36,429 INFO L226 Difference]: Without dead ends: 19966 [2024-10-11 05:04:36,482 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:36,483 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 947 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:36,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 729 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 05:04:36,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19966 states. [2024-10-11 05:04:39,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19966 to 16847. [2024-10-11 05:04:39,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16847 states, 14470 states have (on average 1.4899792674498964) internal successors, (21560), 14603 states have internal predecessors, (21560), 1389 states have call successors, (1389), 808 states have call predecessors, (1389), 986 states have return successors, (2453), 1501 states have call predecessors, (2453), 1386 states have call successors, (2453) [2024-10-11 05:04:39,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16847 states to 16847 states and 25402 transitions. [2024-10-11 05:04:39,814 INFO L78 Accepts]: Start accepts. Automaton has 16847 states and 25402 transitions. Word has length 102 [2024-10-11 05:04:39,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:39,814 INFO L471 AbstractCegarLoop]: Abstraction has 16847 states and 25402 transitions. [2024-10-11 05:04:39,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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:39,815 INFO L276 IsEmpty]: Start isEmpty. Operand 16847 states and 25402 transitions. [2024-10-11 05:04:39,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 05:04:39,824 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:39,824 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] [2024-10-11 05:04:39,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 05:04:39,824 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:39,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:39,825 INFO L85 PathProgramCache]: Analyzing trace with hash -982235832, now seen corresponding path program 1 times [2024-10-11 05:04:39,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:39,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791736353] [2024-10-11 05:04:39,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:39,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:39,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:39,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 05:04:39,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:40,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 05:04:40,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:40,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:04:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:40,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 05:04:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:40,036 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:40,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:40,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791736353] [2024-10-11 05:04:40,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791736353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:40,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:40,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:04:40,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766523257] [2024-10-11 05:04:40,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:40,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:04:40,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:40,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:04:40,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:40,041 INFO L87 Difference]: Start difference. First operand 16847 states and 25402 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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:46,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:46,995 INFO L93 Difference]: Finished difference Result 48720 states and 77530 transitions. [2024-10-11 05:04:46,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:04:46,996 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 102 [2024-10-11 05:04:46,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted.