./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_1.cil-2+token_ring.05.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.05.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2468c605d5c29b15a54525a5c6944fa0a2b4d36426cacd5fefa10555cb2b8a7a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 21:41:00,833 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 21:41:00,871 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 21:41:00,874 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 21:41:00,874 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 21:41:00,888 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 21:41:00,889 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 21:41:00,889 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 21:41:00,889 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 21:41:00,890 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 21:41:00,890 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 21:41:00,893 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 21:41:00,894 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 21:41:00,894 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 21:41:00,894 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 21:41:00,895 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 21:41:00,895 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 21:41:00,895 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 21:41:00,895 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 21:41:00,896 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 21:41:00,896 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 21:41:00,900 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 21:41:00,901 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 21:41:00,901 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 21:41:00,901 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 21:41:00,901 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 21:41:00,902 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 21:41:00,902 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 21:41:00,902 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 21:41:00,902 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 21:41:00,902 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 21:41:00,903 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 21:41:00,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:41:00,903 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 21:41:00,903 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 21:41:00,904 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 21:41:00,904 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 21:41:00,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 21:41:00,904 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 21:41:00,904 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 21:41:00,905 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 21:41:00,906 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 21:41:00,907 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2468c605d5c29b15a54525a5c6944fa0a2b4d36426cacd5fefa10555cb2b8a7a [2024-10-12 21:41:01,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 21:41:01,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 21:41:01,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 21:41:01,082 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 21:41:01,083 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 21:41:01,084 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.05.cil-2.c [2024-10-12 21:41:02,341 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 21:41:02,554 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 21:41:02,555 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.05.cil-2.c [2024-10-12 21:41:02,565 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d09dc1593/c36bf9fed9fd4c219494bdf60243784b/FLAG820a60a61 [2024-10-12 21:41:02,577 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d09dc1593/c36bf9fed9fd4c219494bdf60243784b [2024-10-12 21:41:02,579 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 21:41:02,580 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 21:41:02,581 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 21:41:02,581 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 21:41:02,585 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 21:41:02,586 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:41:02" (1/1) ... [2024-10-12 21:41:02,587 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@410dbd88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:02, skipping insertion in model container [2024-10-12 21:41:02,587 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:41:02" (1/1) ... [2024-10-12 21:41:02,618 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 21:41:02,761 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_1.cil-2+token_ring.05.cil-2.c[913,926] [2024-10-12 21:41:02,812 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_1.cil-2+token_ring.05.cil-2.c[5977,5990] [2024-10-12 21:41:02,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:41:02,882 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 21:41:02,891 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_1.cil-2+token_ring.05.cil-2.c[913,926] [2024-10-12 21:41:02,914 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_1.cil-2+token_ring.05.cil-2.c[5977,5990] [2024-10-12 21:41:02,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:41:02,998 INFO L204 MainTranslator]: Completed translation [2024-10-12 21:41:02,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:02 WrapperNode [2024-10-12 21:41:02,999 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 21:41:03,000 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 21:41:03,000 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 21:41:03,000 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 21:41:03,009 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:02" (1/1) ... [2024-10-12 21:41:03,029 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:02" (1/1) ... [2024-10-12 21:41:03,070 INFO L138 Inliner]: procedures = 58, calls = 64, calls flagged for inlining = 32, calls inlined = 32, statements flattened = 669 [2024-10-12 21:41:03,074 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 21:41:03,075 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 21:41:03,075 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 21:41:03,075 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 21:41:03,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:02" (1/1) ... [2024-10-12 21:41:03,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:02" (1/1) ... [2024-10-12 21:41:03,093 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:02" (1/1) ... [2024-10-12 21:41:03,119 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 21:41:03,120 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:02" (1/1) ... [2024-10-12 21:41:03,125 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:02" (1/1) ... [2024-10-12 21:41:03,133 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:02" (1/1) ... [2024-10-12 21:41:03,139 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:02" (1/1) ... [2024-10-12 21:41:03,141 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:02" (1/1) ... [2024-10-12 21:41:03,143 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:02" (1/1) ... [2024-10-12 21:41:03,145 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 21:41:03,146 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 21:41:03,146 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 21:41:03,146 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 21:41:03,147 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:02" (1/1) ... [2024-10-12 21:41:03,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:41:03,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:41:03,187 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 21:41:03,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 21:41:03,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 21:41:03,260 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 21:41:03,260 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 21:41:03,260 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-10-12 21:41:03,260 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-10-12 21:41:03,260 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-12 21:41:03,261 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-12 21:41:03,261 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-12 21:41:03,261 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-12 21:41:03,261 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-12 21:41:03,261 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-12 21:41:03,261 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-12 21:41:03,261 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-12 21:41:03,261 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-12 21:41:03,261 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-12 21:41:03,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 21:41:03,262 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-12 21:41:03,262 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-12 21:41:03,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 21:41:03,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 21:41:03,262 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-12 21:41:03,262 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-12 21:41:03,262 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-10-12 21:41:03,262 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-10-12 21:41:03,380 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 21:41:03,383 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 21:41:03,887 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2024-10-12 21:41:03,888 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 21:41:03,939 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 21:41:03,940 INFO L314 CfgBuilder]: Removed 12 assume(true) statements. [2024-10-12 21:41:03,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:41:03 BoogieIcfgContainer [2024-10-12 21:41:03,940 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 21:41:03,943 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 21:41:03,943 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 21:41:03,946 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 21:41:03,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 09:41:02" (1/3) ... [2024-10-12 21:41:03,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@291dca96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:41:03, skipping insertion in model container [2024-10-12 21:41:03,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:41:02" (2/3) ... [2024-10-12 21:41:03,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@291dca96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:41:03, skipping insertion in model container [2024-10-12 21:41:03,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:41:03" (3/3) ... [2024-10-12 21:41:03,948 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.05.cil-2.c [2024-10-12 21:41:03,960 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 21:41:03,960 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 21:41:04,021 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 21:41:04,026 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;@438223ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 21:41:04,026 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 21:41:04,032 INFO L276 IsEmpty]: Start isEmpty. Operand has 258 states, 218 states have (on average 1.6972477064220184) internal successors, (370), 225 states have internal predecessors, (370), 27 states have call successors, (27), 10 states have call predecessors, (27), 10 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-12 21:41:04,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-12 21:41:04,042 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:04,043 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] [2024-10-12 21:41:04,043 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:04,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:04,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1842572142, now seen corresponding path program 1 times [2024-10-12 21:41:04,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:04,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928259604] [2024-10-12 21:41:04,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:04,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:04,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:04,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:04,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:04,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:41:04,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:04,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:41:04,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:04,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928259604] [2024-10-12 21:41:04,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928259604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:04,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:04,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:41:04,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791899716] [2024-10-12 21:41:04,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:04,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:41:04,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:04,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:41:04,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:41:04,360 INFO L87 Difference]: Start difference. First operand has 258 states, 218 states have (on average 1.6972477064220184) internal successors, (370), 225 states have internal predecessors, (370), 27 states have call successors, (27), 10 states have call predecessors, (27), 10 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 21:41:04,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:04,834 INFO L93 Difference]: Finished difference Result 563 states and 926 transitions. [2024-10-12 21:41:04,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:41:04,838 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2024-10-12 21:41:04,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:04,850 INFO L225 Difference]: With dead ends: 563 [2024-10-12 21:41:04,856 INFO L226 Difference]: Without dead ends: 315 [2024-10-12 21:41:04,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:41:04,867 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 500 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:04,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 486 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 21:41:04,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-10-12 21:41:04,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 309. [2024-10-12 21:41:04,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 265 states have (on average 1.5433962264150944) internal successors, (409), 270 states have internal predecessors, (409), 31 states have call successors, (31), 12 states have call predecessors, (31), 11 states have return successors, (33), 27 states have call predecessors, (33), 27 states have call successors, (33) [2024-10-12 21:41:04,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 473 transitions. [2024-10-12 21:41:04,947 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 473 transitions. Word has length 37 [2024-10-12 21:41:04,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:04,947 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 473 transitions. [2024-10-12 21:41:04,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 21:41:04,948 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 473 transitions. [2024-10-12 21:41:04,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-12 21:41:04,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:04,951 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] [2024-10-12 21:41:04,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 21:41:04,951 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:04,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:04,952 INFO L85 PathProgramCache]: Analyzing trace with hash -425398402, now seen corresponding path program 1 times [2024-10-12 21:41:04,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:04,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793498795] [2024-10-12 21:41:04,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:04,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:05,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:05,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:05,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:41:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:05,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:41:05,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:05,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793498795] [2024-10-12 21:41:05,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793498795] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:05,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:05,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:41:05,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283007490] [2024-10-12 21:41:05,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:05,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:41:05,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:05,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:41:05,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:41:05,055 INFO L87 Difference]: Start difference. First operand 309 states and 473 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 21:41:05,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:05,330 INFO L93 Difference]: Finished difference Result 543 states and 817 transitions. [2024-10-12 21:41:05,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:41:05,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2024-10-12 21:41:05,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:05,333 INFO L225 Difference]: With dead ends: 543 [2024-10-12 21:41:05,333 INFO L226 Difference]: Without dead ends: 432 [2024-10-12 21:41:05,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:41:05,335 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 513 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:05,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 479 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 21:41:05,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-10-12 21:41:05,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 409. [2024-10-12 21:41:05,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 352 states have (on average 1.4971590909090908) internal successors, (527), 358 states have internal predecessors, (527), 39 states have call successors, (39), 16 states have call predecessors, (39), 16 states have return successors, (47), 35 states have call predecessors, (47), 35 states have call successors, (47) [2024-10-12 21:41:05,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 613 transitions. [2024-10-12 21:41:05,360 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 613 transitions. Word has length 38 [2024-10-12 21:41:05,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:05,360 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 613 transitions. [2024-10-12 21:41:05,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 21:41:05,360 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 613 transitions. [2024-10-12 21:41:05,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-12 21:41:05,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:05,362 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] [2024-10-12 21:41:05,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 21:41:05,363 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:05,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:05,363 INFO L85 PathProgramCache]: Analyzing trace with hash 522643096, now seen corresponding path program 1 times [2024-10-12 21:41:05,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:05,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292779051] [2024-10-12 21:41:05,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:05,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:05,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:05,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:05,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 21:41:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:05,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:41:05,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:05,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292779051] [2024-10-12 21:41:05,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292779051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:05,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:05,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:41:05,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237017] [2024-10-12 21:41:05,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:05,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:41:05,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:05,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:41:05,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:41:05,482 INFO L87 Difference]: Start difference. First operand 409 states and 613 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 21:41:05,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:05,804 INFO L93 Difference]: Finished difference Result 829 states and 1194 transitions. [2024-10-12 21:41:05,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:41:05,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2024-10-12 21:41:05,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:05,811 INFO L225 Difference]: With dead ends: 829 [2024-10-12 21:41:05,811 INFO L226 Difference]: Without dead ends: 618 [2024-10-12 21:41:05,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:41:05,814 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 214 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:05,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 661 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 21:41:05,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-10-12 21:41:05,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 514. [2024-10-12 21:41:05,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 445 states have (on average 1.4741573033707864) internal successors, (656), 453 states have internal predecessors, (656), 45 states have call successors, (45), 22 states have call predecessors, (45), 22 states have return successors, (53), 39 states have call predecessors, (53), 41 states have call successors, (53) [2024-10-12 21:41:05,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 754 transitions. [2024-10-12 21:41:05,857 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 754 transitions. Word has length 39 [2024-10-12 21:41:05,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:05,858 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 754 transitions. [2024-10-12 21:41:05,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 21:41:05,858 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 754 transitions. [2024-10-12 21:41:05,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 21:41:05,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:05,864 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] [2024-10-12 21:41:05,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 21:41:05,864 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:05,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:05,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1026612791, now seen corresponding path program 1 times [2024-10-12 21:41:05,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:05,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460797423] [2024-10-12 21:41:05,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:05,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:05,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:05,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:05,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 21:41:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:05,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:41:05,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:05,993 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-12 21:41:05,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:05,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460797423] [2024-10-12 21:41:05,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460797423] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:05,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:05,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:41:05,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162612274] [2024-10-12 21:41:05,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:05,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:41:05,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:05,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:41:06,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:41:06,001 INFO L87 Difference]: Start difference. First operand 514 states and 754 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 21:41:06,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:06,490 INFO L93 Difference]: Finished difference Result 1030 states and 1471 transitions. [2024-10-12 21:41:06,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:41:06,491 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 54 [2024-10-12 21:41:06,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:06,495 INFO L225 Difference]: With dead ends: 1030 [2024-10-12 21:41:06,495 INFO L226 Difference]: Without dead ends: 714 [2024-10-12 21:41:06,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:41:06,498 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 199 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:06,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 705 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 21:41:06,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2024-10-12 21:41:06,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 680. [2024-10-12 21:41:06,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 587 states have (on average 1.4173764906303237) internal successors, (832), 597 states have internal predecessors, (832), 59 states have call successors, (59), 30 states have call predecessors, (59), 32 states have return successors, (77), 53 states have call predecessors, (77), 55 states have call successors, (77) [2024-10-12 21:41:06,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 968 transitions. [2024-10-12 21:41:06,548 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 968 transitions. Word has length 54 [2024-10-12 21:41:06,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:06,550 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 968 transitions. [2024-10-12 21:41:06,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 21:41:06,551 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 968 transitions. [2024-10-12 21:41:06,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 21:41:06,555 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:06,555 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 21:41:06,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 21:41:06,555 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:06,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:06,556 INFO L85 PathProgramCache]: Analyzing trace with hash -169003874, now seen corresponding path program 1 times [2024-10-12 21:41:06,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:06,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178672483] [2024-10-12 21:41:06,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:06,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:06,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:06,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:06,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:06,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 21:41:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:06,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:41:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:06,623 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 21:41:06,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:06,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178672483] [2024-10-12 21:41:06,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178672483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:06,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:06,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:41:06,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210747550] [2024-10-12 21:41:06,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:06,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:41:06,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:06,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:41:06,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:41:06,627 INFO L87 Difference]: Start difference. First operand 680 states and 968 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 21:41:06,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:06,911 INFO L93 Difference]: Finished difference Result 1259 states and 1747 transitions. [2024-10-12 21:41:06,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:41:06,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2024-10-12 21:41:06,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:06,917 INFO L225 Difference]: With dead ends: 1259 [2024-10-12 21:41:06,921 INFO L226 Difference]: Without dead ends: 857 [2024-10-12 21:41:06,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:41:06,923 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 499 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:06,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 491 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 21:41:06,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2024-10-12 21:41:06,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 808. [2024-10-12 21:41:06,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 699 states have (on average 1.3834048640915593) internal successors, (967), 711 states have internal predecessors, (967), 67 states have call successors, (67), 36 states have call predecessors, (67), 40 states have return successors, (91), 61 states have call predecessors, (91), 63 states have call successors, (91) [2024-10-12 21:41:06,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1125 transitions. [2024-10-12 21:41:06,951 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1125 transitions. Word has length 59 [2024-10-12 21:41:06,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:06,951 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1125 transitions. [2024-10-12 21:41:06,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 21:41:06,952 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1125 transitions. [2024-10-12 21:41:06,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 21:41:06,953 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:06,953 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 21:41:06,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 21:41:06,953 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:06,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:06,953 INFO L85 PathProgramCache]: Analyzing trace with hash 208415176, now seen corresponding path program 1 times [2024-10-12 21:41:06,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:06,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295261836] [2024-10-12 21:41:06,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:06,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:06,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:06,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:06,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:41:06,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:07,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:41:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:07,040 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 21:41:07,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:07,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295261836] [2024-10-12 21:41:07,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295261836] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:41:07,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221644146] [2024-10-12 21:41:07,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:07,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:41:07,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:41:07,049 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:41:07,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 21:41:07,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:07,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 21:41:07,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:41:07,149 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 21:41:07,150 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:41:07,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221644146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:07,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:41:07,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-12 21:41:07,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460756523] [2024-10-12 21:41:07,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:07,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:41:07,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:07,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:41:07,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:41:07,152 INFO L87 Difference]: Start difference. First operand 808 states and 1125 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 21:41:07,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:07,245 INFO L93 Difference]: Finished difference Result 1296 states and 1799 transitions. [2024-10-12 21:41:07,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:41:07,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-10-12 21:41:07,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:07,248 INFO L225 Difference]: With dead ends: 1296 [2024-10-12 21:41:07,249 INFO L226 Difference]: Without dead ends: 813 [2024-10-12 21:41:07,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:41:07,250 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 0 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:07,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1069 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:41:07,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2024-10-12 21:41:07,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2024-10-12 21:41:07,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 704 states have (on average 1.3693181818181819) internal successors, (964), 716 states have internal predecessors, (964), 67 states have call successors, (67), 36 states have call predecessors, (67), 40 states have return successors, (91), 61 states have call predecessors, (91), 63 states have call successors, (91) [2024-10-12 21:41:07,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1122 transitions. [2024-10-12 21:41:07,283 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1122 transitions. Word has length 60 [2024-10-12 21:41:07,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:07,284 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 1122 transitions. [2024-10-12 21:41:07,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 21:41:07,284 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1122 transitions. [2024-10-12 21:41:07,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 21:41:07,285 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:07,286 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 21:41:07,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 21:41:07,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-12 21:41:07,490 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:07,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:07,491 INFO L85 PathProgramCache]: Analyzing trace with hash -635590326, now seen corresponding path program 1 times [2024-10-12 21:41:07,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:07,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503989235] [2024-10-12 21:41:07,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:07,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:07,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:07,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:07,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:41:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:07,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:41:07,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:07,579 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 21:41:07,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:07,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503989235] [2024-10-12 21:41:07,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503989235] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:41:07,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058898230] [2024-10-12 21:41:07,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:07,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:41:07,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:41:07,581 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:41:07,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 21:41:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:07,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 21:41:07,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:41:07,654 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 21:41:07,654 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:41:07,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058898230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:07,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:41:07,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-12 21:41:07,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138862064] [2024-10-12 21:41:07,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:07,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:41:07,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:07,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:41:07,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:41:07,655 INFO L87 Difference]: Start difference. First operand 813 states and 1122 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 21:41:07,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:07,739 INFO L93 Difference]: Finished difference Result 1239 states and 1701 transitions. [2024-10-12 21:41:07,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:41:07,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-10-12 21:41:07,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:07,742 INFO L225 Difference]: With dead ends: 1239 [2024-10-12 21:41:07,742 INFO L226 Difference]: Without dead ends: 710 [2024-10-12 21:41:07,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:41:07,743 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 0 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:07,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1069 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:41:07,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-10-12 21:41:07,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 703. [2024-10-12 21:41:07,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 612 states have (on average 1.3741830065359477) internal successors, (841), 622 states have internal predecessors, (841), 57 states have call successors, (57), 30 states have call predecessors, (57), 32 states have return successors, (72), 51 states have call predecessors, (72), 53 states have call successors, (72) [2024-10-12 21:41:07,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 970 transitions. [2024-10-12 21:41:07,794 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 970 transitions. Word has length 60 [2024-10-12 21:41:07,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:07,794 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 970 transitions. [2024-10-12 21:41:07,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 21:41:07,794 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 970 transitions. [2024-10-12 21:41:07,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 21:41:07,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:07,796 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 21:41:07,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 21:41:07,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-12 21:41:07,997 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:07,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:07,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1162049290, now seen corresponding path program 1 times [2024-10-12 21:41:07,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:07,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283908728] [2024-10-12 21:41:07,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:07,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:08,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:08,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:08,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:41:08,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:08,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:41:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:08,059 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-12 21:41:08,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:08,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283908728] [2024-10-12 21:41:08,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283908728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:08,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:08,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:41:08,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817045953] [2024-10-12 21:41:08,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:08,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:41:08,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:08,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:41:08,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:41:08,060 INFO L87 Difference]: Start difference. First operand 703 states and 970 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 21:41:08,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:08,362 INFO L93 Difference]: Finished difference Result 788 states and 1073 transitions. [2024-10-12 21:41:08,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:41:08,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 60 [2024-10-12 21:41:08,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:08,366 INFO L225 Difference]: With dead ends: 788 [2024-10-12 21:41:08,366 INFO L226 Difference]: Without dead ends: 785 [2024-10-12 21:41:08,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:41:08,367 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 851 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:08,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 488 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 21:41:08,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2024-10-12 21:41:08,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 702. [2024-10-12 21:41:08,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 612 states have (on average 1.3709150326797386) internal successors, (839), 621 states have internal predecessors, (839), 56 states have call successors, (56), 30 states have call predecessors, (56), 32 states have return successors, (72), 51 states have call predecessors, (72), 53 states have call successors, (72) [2024-10-12 21:41:08,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 967 transitions. [2024-10-12 21:41:08,392 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 967 transitions. Word has length 60 [2024-10-12 21:41:08,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:08,392 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 967 transitions. [2024-10-12 21:41:08,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 21:41:08,393 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 967 transitions. [2024-10-12 21:41:08,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 21:41:08,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:08,394 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 21:41:08,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 21:41:08,394 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:08,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:08,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1662876575, now seen corresponding path program 1 times [2024-10-12 21:41:08,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:08,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577131150] [2024-10-12 21:41:08,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:08,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:08,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:08,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:41:08,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:08,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:41:08,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:08,509 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-12 21:41:08,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:08,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577131150] [2024-10-12 21:41:08,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577131150] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:41:08,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765445519] [2024-10-12 21:41:08,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:08,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:41:08,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:41:08,516 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:41:08,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 21:41:08,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:08,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 21:41:08,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:41:08,880 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:41:08,880 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:41:08,946 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-12 21:41:08,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765445519] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:41:08,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:41:08,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 8 [2024-10-12 21:41:08,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653468648] [2024-10-12 21:41:08,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:41:08,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:41:08,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:08,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:41:08,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:41:08,948 INFO L87 Difference]: Start difference. First operand 702 states and 967 transitions. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-12 21:41:09,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:09,541 INFO L93 Difference]: Finished difference Result 1505 states and 2002 transitions. [2024-10-12 21:41:09,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 21:41:09,542 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 61 [2024-10-12 21:41:09,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:09,549 INFO L225 Difference]: With dead ends: 1505 [2024-10-12 21:41:09,549 INFO L226 Difference]: Without dead ends: 1502 [2024-10-12 21:41:09,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-12 21:41:09,551 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 695 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:09,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 1222 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 21:41:09,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2024-10-12 21:41:09,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1005. [2024-10-12 21:41:09,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 879 states have (on average 1.348122866894198) internal successors, (1185), 894 states have internal predecessors, (1185), 75 states have call successors, (75), 43 states have call predecessors, (75), 49 states have return successors, (102), 68 states have call predecessors, (102), 72 states have call successors, (102) [2024-10-12 21:41:09,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1362 transitions. [2024-10-12 21:41:09,600 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1362 transitions. Word has length 61 [2024-10-12 21:41:09,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:09,600 INFO L471 AbstractCegarLoop]: Abstraction has 1005 states and 1362 transitions. [2024-10-12 21:41:09,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-12 21:41:09,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1362 transitions. [2024-10-12 21:41:09,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 21:41:09,603 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:09,603 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 21:41:09,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-12 21:41:09,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:41:09,804 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:09,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:09,805 INFO L85 PathProgramCache]: Analyzing trace with hash -401503642, now seen corresponding path program 2 times [2024-10-12 21:41:09,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:09,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34279865] [2024-10-12 21:41:09,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:09,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:09,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:09,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:41:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:09,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:41:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:09,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 21:41:09,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:09,859 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 21:41:09,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:09,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34279865] [2024-10-12 21:41:09,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34279865] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:09,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:09,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:41:09,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11611706] [2024-10-12 21:41:09,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:09,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:41:09,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:09,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:41:09,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:41:09,861 INFO L87 Difference]: Start difference. First operand 1005 states and 1362 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-12 21:41:10,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:10,135 INFO L93 Difference]: Finished difference Result 1633 states and 2179 transitions. [2024-10-12 21:41:10,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:41:10,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 78 [2024-10-12 21:41:10,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:10,140 INFO L225 Difference]: With dead ends: 1633 [2024-10-12 21:41:10,140 INFO L226 Difference]: Without dead ends: 974 [2024-10-12 21:41:10,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:41:10,142 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 512 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:10,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 507 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 21:41:10,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2024-10-12 21:41:10,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 897. [2024-10-12 21:41:10,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 784 states have (on average 1.3482142857142858) internal successors, (1057), 799 states have internal predecessors, (1057), 68 states have call successors, (68), 38 states have call predecessors, (68), 43 states have return successors, (91), 60 states have call predecessors, (91), 65 states have call successors, (91) [2024-10-12 21:41:10,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1216 transitions. [2024-10-12 21:41:10,179 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1216 transitions. Word has length 78 [2024-10-12 21:41:10,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:10,180 INFO L471 AbstractCegarLoop]: Abstraction has 897 states and 1216 transitions. [2024-10-12 21:41:10,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-12 21:41:10,180 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1216 transitions. [2024-10-12 21:41:10,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 21:41:10,182 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:10,182 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:10,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 21:41:10,182 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:10,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:10,183 INFO L85 PathProgramCache]: Analyzing trace with hash -43566558, now seen corresponding path program 1 times [2024-10-12 21:41:10,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:10,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973948396] [2024-10-12 21:41:10,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:10,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:10,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:10,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:41:10,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:10,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:41:10,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:10,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 21:41:10,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:10,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 21:41:10,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:10,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 21:41:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:10,254 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-12 21:41:10,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:10,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973948396] [2024-10-12 21:41:10,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973948396] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:41:10,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816191646] [2024-10-12 21:41:10,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:10,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:41:10,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:41:10,257 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:41:10,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 21:41:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:10,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 21:41:10,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:41:10,352 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-12 21:41:10,353 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:41:10,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816191646] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:10,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:41:10,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-12 21:41:10,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013082972] [2024-10-12 21:41:10,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:10,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:41:10,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:10,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:41:10,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:41:10,355 INFO L87 Difference]: Start difference. First operand 897 states and 1216 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-12 21:41:10,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:10,419 INFO L93 Difference]: Finished difference Result 1180 states and 1572 transitions. [2024-10-12 21:41:10,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:41:10,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 92 [2024-10-12 21:41:10,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:10,420 INFO L225 Difference]: With dead ends: 1180 [2024-10-12 21:41:10,421 INFO L226 Difference]: Without dead ends: 193 [2024-10-12 21:41:10,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:41:10,422 INFO L432 NwaCegarLoop]: 392 mSDtfsCounter, 55 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:10,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 728 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:41:10,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-10-12 21:41:10,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2024-10-12 21:41:10,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 165 states have (on average 1.6) internal successors, (264), 167 states have internal predecessors, (264), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-12 21:41:10,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 304 transitions. [2024-10-12 21:41:10,430 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 304 transitions. Word has length 92 [2024-10-12 21:41:10,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:10,430 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 304 transitions. [2024-10-12 21:41:10,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-12 21:41:10,430 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 304 transitions. [2024-10-12 21:41:10,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 21:41:10,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:10,431 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:10,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 21:41:10,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:41:10,636 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:10,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:10,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1427183430, now seen corresponding path program 1 times [2024-10-12 21:41:10,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:10,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316848854] [2024-10-12 21:41:10,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:10,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:10,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:41:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:10,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 21:41:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:10,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 21:41:10,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:10,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 21:41:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:10,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 21:41:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:10,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:41:10,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:10,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316848854] [2024-10-12 21:41:10,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316848854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:10,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:10,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:41:10,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199544126] [2024-10-12 21:41:10,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:10,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:41:10,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:10,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:41:10,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:41:10,742 INFO L87 Difference]: Start difference. First operand 193 states and 304 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:12,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:12,122 INFO L93 Difference]: Finished difference Result 691 states and 1121 transitions. [2024-10-12 21:41:12,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:41:12,123 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 92 [2024-10-12 21:41:12,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:12,126 INFO L225 Difference]: With dead ends: 691 [2024-10-12 21:41:12,126 INFO L226 Difference]: Without dead ends: 510 [2024-10-12 21:41:12,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:41:12,127 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 694 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 1915 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 1971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:12,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 1163 Invalid, 1971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1915 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 21:41:12,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2024-10-12 21:41:12,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 381. [2024-10-12 21:41:12,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 329 states have (on average 1.6109422492401215) internal successors, (530), 333 states have internal predecessors, (530), 37 states have call successors, (37), 13 states have call predecessors, (37), 14 states have return successors, (42), 36 states have call predecessors, (42), 35 states have call successors, (42) [2024-10-12 21:41:12,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 609 transitions. [2024-10-12 21:41:12,147 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 609 transitions. Word has length 92 [2024-10-12 21:41:12,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:12,148 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 609 transitions. [2024-10-12 21:41:12,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:12,148 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 609 transitions. [2024-10-12 21:41:12,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 21:41:12,149 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:12,149 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:12,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 21:41:12,149 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:12,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:12,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1454249032, now seen corresponding path program 1 times [2024-10-12 21:41:12,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:12,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621964086] [2024-10-12 21:41:12,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:12,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:12,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:12,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:41:12,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:12,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 21:41:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:12,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 21:41:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:12,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 21:41:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:12,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 21:41:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:12,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:41:12,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:12,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621964086] [2024-10-12 21:41:12,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621964086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:12,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:12,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:41:12,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577274344] [2024-10-12 21:41:12,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:12,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:41:12,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:12,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:41:12,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:41:12,264 INFO L87 Difference]: Start difference. First operand 381 states and 609 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:13,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:13,652 INFO L93 Difference]: Finished difference Result 1319 states and 2136 transitions. [2024-10-12 21:41:13,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:41:13,653 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 92 [2024-10-12 21:41:13,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:13,657 INFO L225 Difference]: With dead ends: 1319 [2024-10-12 21:41:13,657 INFO L226 Difference]: Without dead ends: 952 [2024-10-12 21:41:13,658 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-12 21:41:13,659 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 698 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 1806 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 1870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:13,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 1079 Invalid, 1870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1806 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 21:41:13,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2024-10-12 21:41:13,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 725. [2024-10-12 21:41:13,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 631 states have (on average 1.6022187004754358) internal successors, (1011), 637 states have internal predecessors, (1011), 65 states have call successors, (65), 25 states have call predecessors, (65), 28 states have return successors, (80), 66 states have call predecessors, (80), 63 states have call successors, (80) [2024-10-12 21:41:13,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1156 transitions. [2024-10-12 21:41:13,699 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1156 transitions. Word has length 92 [2024-10-12 21:41:13,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:13,700 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 1156 transitions. [2024-10-12 21:41:13,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:13,700 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1156 transitions. [2024-10-12 21:41:13,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 21:41:13,701 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:13,701 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:13,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 21:41:13,701 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:13,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:13,701 INFO L85 PathProgramCache]: Analyzing trace with hash -623087866, now seen corresponding path program 1 times [2024-10-12 21:41:13,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:13,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455434955] [2024-10-12 21:41:13,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:13,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:13,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:13,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:41:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:13,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 21:41:13,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:13,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 21:41:13,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:13,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 21:41:13,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:13,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 21:41:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:13,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:41:13,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:13,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455434955] [2024-10-12 21:41:13,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455434955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:13,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:13,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:41:13,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784150391] [2024-10-12 21:41:13,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:13,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:41:13,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:13,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:41:13,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:41:13,798 INFO L87 Difference]: Start difference. First operand 725 states and 1156 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:14,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:14,491 INFO L93 Difference]: Finished difference Result 1666 states and 2702 transitions. [2024-10-12 21:41:14,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:41:14,491 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 92 [2024-10-12 21:41:14,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:14,496 INFO L225 Difference]: With dead ends: 1666 [2024-10-12 21:41:14,496 INFO L226 Difference]: Without dead ends: 953 [2024-10-12 21:41:14,498 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-12 21:41:14,498 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 614 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:14,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 486 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 21:41:14,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2024-10-12 21:41:14,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 725. [2024-10-12 21:41:14,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 631 states have (on average 1.5942947702060222) internal successors, (1006), 637 states have internal predecessors, (1006), 65 states have call successors, (65), 25 states have call predecessors, (65), 28 states have return successors, (80), 66 states have call predecessors, (80), 63 states have call successors, (80) [2024-10-12 21:41:14,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1151 transitions. [2024-10-12 21:41:14,539 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1151 transitions. Word has length 92 [2024-10-12 21:41:14,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:14,539 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 1151 transitions. [2024-10-12 21:41:14,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:14,539 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1151 transitions. [2024-10-12 21:41:14,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 21:41:14,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:14,542 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:14,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 21:41:14,544 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:14,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:14,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1111016584, now seen corresponding path program 1 times [2024-10-12 21:41:14,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:14,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799347980] [2024-10-12 21:41:14,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:14,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:14,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:41:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:14,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 21:41:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:14,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 21:41:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:14,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 21:41:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:14,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 21:41:14,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:14,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:41:14,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:14,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799347980] [2024-10-12 21:41:14,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799347980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:14,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:14,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:41:14,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637382264] [2024-10-12 21:41:14,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:14,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:41:14,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:14,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:41:14,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:41:14,644 INFO L87 Difference]: Start difference. First operand 725 states and 1151 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:15,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:15,352 INFO L93 Difference]: Finished difference Result 1662 states and 2681 transitions. [2024-10-12 21:41:15,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:41:15,353 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 92 [2024-10-12 21:41:15,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:15,357 INFO L225 Difference]: With dead ends: 1662 [2024-10-12 21:41:15,357 INFO L226 Difference]: Without dead ends: 949 [2024-10-12 21:41:15,360 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-12 21:41:15,360 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 537 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:15,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 582 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 21:41:15,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2024-10-12 21:41:15,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 725. [2024-10-12 21:41:15,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 631 states have (on average 1.5863708399366085) internal successors, (1001), 637 states have internal predecessors, (1001), 65 states have call successors, (65), 25 states have call predecessors, (65), 28 states have return successors, (80), 66 states have call predecessors, (80), 63 states have call successors, (80) [2024-10-12 21:41:15,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1146 transitions. [2024-10-12 21:41:15,401 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1146 transitions. Word has length 92 [2024-10-12 21:41:15,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:15,401 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 1146 transitions. [2024-10-12 21:41:15,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:15,401 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1146 transitions. [2024-10-12 21:41:15,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 21:41:15,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:15,402 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:15,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 21:41:15,402 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:15,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:15,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1998239430, now seen corresponding path program 1 times [2024-10-12 21:41:15,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:15,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723051841] [2024-10-12 21:41:15,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:15,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:15,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:41:15,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:15,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 21:41:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:15,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 21:41:15,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:15,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 21:41:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:15,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 21:41:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:15,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:41:15,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:15,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723051841] [2024-10-12 21:41:15,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723051841] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:15,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:15,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:41:15,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681219089] [2024-10-12 21:41:15,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:15,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:41:15,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:15,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:41:15,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:41:15,511 INFO L87 Difference]: Start difference. First operand 725 states and 1146 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:16,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:16,186 INFO L93 Difference]: Finished difference Result 1657 states and 2658 transitions. [2024-10-12 21:41:16,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:41:16,186 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 92 [2024-10-12 21:41:16,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:16,190 INFO L225 Difference]: With dead ends: 1657 [2024-10-12 21:41:16,191 INFO L226 Difference]: Without dead ends: 944 [2024-10-12 21:41:16,192 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-12 21:41:16,192 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 535 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:16,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 582 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 21:41:16,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2024-10-12 21:41:16,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 725. [2024-10-12 21:41:16,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 631 states have (on average 1.578446909667195) internal successors, (996), 637 states have internal predecessors, (996), 65 states have call successors, (65), 25 states have call predecessors, (65), 28 states have return successors, (80), 66 states have call predecessors, (80), 63 states have call successors, (80) [2024-10-12 21:41:16,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1141 transitions. [2024-10-12 21:41:16,232 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1141 transitions. Word has length 92 [2024-10-12 21:41:16,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:16,232 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 1141 transitions. [2024-10-12 21:41:16,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:16,233 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1141 transitions. [2024-10-12 21:41:16,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 21:41:16,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:16,234 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:16,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 21:41:16,234 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:16,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:16,234 INFO L85 PathProgramCache]: Analyzing trace with hash 87196872, now seen corresponding path program 1 times [2024-10-12 21:41:16,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:16,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910874169] [2024-10-12 21:41:16,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:16,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:16,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:41:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:16,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 21:41:16,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:16,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 21:41:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:16,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 21:41:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:16,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 21:41:16,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:16,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:41:16,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:16,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910874169] [2024-10-12 21:41:16,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910874169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:16,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:16,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:41:16,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091741962] [2024-10-12 21:41:16,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:16,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:41:16,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:16,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:41:16,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:41:16,359 INFO L87 Difference]: Start difference. First operand 725 states and 1141 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:17,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:17,524 INFO L93 Difference]: Finished difference Result 2800 states and 4451 transitions. [2024-10-12 21:41:17,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:41:17,524 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 92 [2024-10-12 21:41:17,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:17,532 INFO L225 Difference]: With dead ends: 2800 [2024-10-12 21:41:17,532 INFO L226 Difference]: Without dead ends: 2089 [2024-10-12 21:41:17,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:41:17,534 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 880 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 1727 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 1796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:17,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 1081 Invalid, 1796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1727 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 21:41:17,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2024-10-12 21:41:17,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 1416. [2024-10-12 21:41:17,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1416 states, 1242 states have (on average 1.5724637681159421) internal successors, (1953), 1252 states have internal predecessors, (1953), 117 states have call successors, (117), 49 states have call predecessors, (117), 56 states have return successors, (158), 122 states have call predecessors, (158), 115 states have call successors, (158) [2024-10-12 21:41:17,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2228 transitions. [2024-10-12 21:41:17,618 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2228 transitions. Word has length 92 [2024-10-12 21:41:17,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:17,619 INFO L471 AbstractCegarLoop]: Abstraction has 1416 states and 2228 transitions. [2024-10-12 21:41:17,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:17,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2228 transitions. [2024-10-12 21:41:17,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 21:41:17,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:17,620 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:17,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 21:41:17,620 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:17,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:17,621 INFO L85 PathProgramCache]: Analyzing trace with hash 164097670, now seen corresponding path program 1 times [2024-10-12 21:41:17,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:17,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435294695] [2024-10-12 21:41:17,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:17,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:17,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:17,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:41:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:17,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 21:41:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:17,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 21:41:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:17,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 21:41:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:17,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 21:41:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:17,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:41:17,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:17,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435294695] [2024-10-12 21:41:17,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435294695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:17,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:17,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:41:17,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665642743] [2024-10-12 21:41:17,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:17,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:41:17,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:17,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:41:17,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:41:17,782 INFO L87 Difference]: Start difference. First operand 1416 states and 2228 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:19,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:19,444 INFO L93 Difference]: Finished difference Result 5403 states and 8594 transitions. [2024-10-12 21:41:19,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:41:19,445 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 92 [2024-10-12 21:41:19,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:19,461 INFO L225 Difference]: With dead ends: 5403 [2024-10-12 21:41:19,461 INFO L226 Difference]: Without dead ends: 4001 [2024-10-12 21:41:19,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:41:19,465 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 739 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 2001 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 2065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 2001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:19,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 1107 Invalid, 2065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 2001 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 21:41:19,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4001 states. [2024-10-12 21:41:19,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4001 to 2717. [2024-10-12 21:41:19,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2717 states, 2387 states have (on average 1.5622119815668203) internal successors, (3729), 2405 states have internal predecessors, (3729), 217 states have call successors, (217), 97 states have call predecessors, (217), 112 states have return successors, (328), 230 states have call predecessors, (328), 215 states have call successors, (328) [2024-10-12 21:41:19,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2717 states to 2717 states and 4274 transitions. [2024-10-12 21:41:19,670 INFO L78 Accepts]: Start accepts. Automaton has 2717 states and 4274 transitions. Word has length 92 [2024-10-12 21:41:19,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:19,671 INFO L471 AbstractCegarLoop]: Abstraction has 2717 states and 4274 transitions. [2024-10-12 21:41:19,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:19,671 INFO L276 IsEmpty]: Start isEmpty. Operand 2717 states and 4274 transitions. [2024-10-12 21:41:19,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 21:41:19,673 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:19,673 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:19,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 21:41:19,673 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:19,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:19,674 INFO L85 PathProgramCache]: Analyzing trace with hash -803252984, now seen corresponding path program 1 times [2024-10-12 21:41:19,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:19,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180841160] [2024-10-12 21:41:19,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:19,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:19,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:19,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:41:19,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:19,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 21:41:19,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:19,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 21:41:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:19,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 21:41:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:19,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 21:41:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:19,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:41:19,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:19,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180841160] [2024-10-12 21:41:19,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180841160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:19,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:19,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:41:19,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758641067] [2024-10-12 21:41:19,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:19,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:41:19,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:19,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:41:19,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:41:19,782 INFO L87 Difference]: Start difference. First operand 2717 states and 4274 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:21,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:21,499 INFO L93 Difference]: Finished difference Result 10050 states and 15996 transitions. [2024-10-12 21:41:21,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:41:21,499 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 92 [2024-10-12 21:41:21,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:21,528 INFO L225 Difference]: With dead ends: 10050 [2024-10-12 21:41:21,528 INFO L226 Difference]: Without dead ends: 7347 [2024-10-12 21:41:21,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:41:21,536 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 724 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 1876 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 1938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:21,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 1119 Invalid, 1938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1876 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 21:41:21,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7347 states. [2024-10-12 21:41:21,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7347 to 5414. [2024-10-12 21:41:21,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5414 states, 4780 states have (on average 1.5629707112970712) internal successors, (7471), 4814 states have internal predecessors, (7471), 409 states have call successors, (409), 193 states have call predecessors, (409), 224 states have return successors, (714), 438 states have call predecessors, (714), 407 states have call successors, (714) [2024-10-12 21:41:21,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5414 states to 5414 states and 8594 transitions. [2024-10-12 21:41:21,953 INFO L78 Accepts]: Start accepts. Automaton has 5414 states and 8594 transitions. Word has length 92 [2024-10-12 21:41:21,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:21,953 INFO L471 AbstractCegarLoop]: Abstraction has 5414 states and 8594 transitions. [2024-10-12 21:41:21,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:21,954 INFO L276 IsEmpty]: Start isEmpty. Operand 5414 states and 8594 transitions. [2024-10-12 21:41:21,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 21:41:21,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:21,957 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:21,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 21:41:21,957 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:21,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:21,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1295879158, now seen corresponding path program 1 times [2024-10-12 21:41:21,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:21,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106135550] [2024-10-12 21:41:21,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:21,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:21,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:22,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:41:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:22,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 21:41:22,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:22,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 21:41:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:22,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 21:41:22,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:22,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 21:41:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:22,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:41:22,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:22,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106135550] [2024-10-12 21:41:22,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106135550] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:22,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:22,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:41:22,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435749703] [2024-10-12 21:41:22,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:22,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:41:22,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:22,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:41:22,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:41:22,089 INFO L87 Difference]: Start difference. First operand 5414 states and 8594 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:24,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:24,070 INFO L93 Difference]: Finished difference Result 19549 states and 31358 transitions. [2024-10-12 21:41:24,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:41:24,071 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 92 [2024-10-12 21:41:24,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:24,115 INFO L225 Difference]: With dead ends: 19549 [2024-10-12 21:41:24,116 INFO L226 Difference]: Without dead ends: 14149 [2024-10-12 21:41:24,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:41:24,132 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 756 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 1670 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 1735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:24,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 1119 Invalid, 1735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1670 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 21:41:24,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14149 states. [2024-10-12 21:41:24,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14149 to 10808. [2024-10-12 21:41:24,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10808 states, 9582 states have (on average 1.5640784804842414) internal successors, (14987), 9648 states have internal predecessors, (14987), 777 states have call successors, (777), 385 states have call predecessors, (777), 448 states have return successors, (1632), 838 states have call predecessors, (1632), 775 states have call successors, (1632) [2024-10-12 21:41:24,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10808 states to 10808 states and 17396 transitions. [2024-10-12 21:41:24,949 INFO L78 Accepts]: Start accepts. Automaton has 10808 states and 17396 transitions. Word has length 92 [2024-10-12 21:41:24,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:24,949 INFO L471 AbstractCegarLoop]: Abstraction has 10808 states and 17396 transitions. [2024-10-12 21:41:24,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:24,950 INFO L276 IsEmpty]: Start isEmpty. Operand 10808 states and 17396 transitions. [2024-10-12 21:41:24,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 21:41:24,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:24,958 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:24,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 21:41:24,958 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:24,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:24,958 INFO L85 PathProgramCache]: Analyzing trace with hash -341939000, now seen corresponding path program 1 times [2024-10-12 21:41:24,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:24,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981404347] [2024-10-12 21:41:24,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:24,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:24,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:24,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:41:24,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:25,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 21:41:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:25,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 21:41:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:25,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 21:41:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:25,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 21:41:25,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:25,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:41:25,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:25,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981404347] [2024-10-12 21:41:25,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981404347] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:25,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:25,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:41:25,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48628250] [2024-10-12 21:41:25,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:25,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:41:25,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:25,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:41:25,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:41:25,045 INFO L87 Difference]: Start difference. First operand 10808 states and 17396 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:26,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:26,462 INFO L93 Difference]: Finished difference Result 24193 states and 39587 transitions. [2024-10-12 21:41:26,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:41:26,462 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 92 [2024-10-12 21:41:26,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:26,503 INFO L225 Difference]: With dead ends: 24193 [2024-10-12 21:41:26,503 INFO L226 Difference]: Without dead ends: 13397 [2024-10-12 21:41:26,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 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-12 21:41:26,528 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 536 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:26,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 581 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 21:41:26,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13397 states. [2024-10-12 21:41:27,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13397 to 10808. [2024-10-12 21:41:27,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10808 states, 9582 states have (on average 1.5572949279899813) internal successors, (14922), 9648 states have internal predecessors, (14922), 777 states have call successors, (777), 385 states have call predecessors, (777), 448 states have return successors, (1632), 838 states have call predecessors, (1632), 775 states have call successors, (1632) [2024-10-12 21:41:27,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10808 states to 10808 states and 17331 transitions. [2024-10-12 21:41:27,501 INFO L78 Accepts]: Start accepts. Automaton has 10808 states and 17331 transitions. Word has length 92 [2024-10-12 21:41:27,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:27,502 INFO L471 AbstractCegarLoop]: Abstraction has 10808 states and 17331 transitions. [2024-10-12 21:41:27,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:27,503 INFO L276 IsEmpty]: Start isEmpty. Operand 10808 states and 17331 transitions. [2024-10-12 21:41:27,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 21:41:27,510 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:27,510 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:27,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 21:41:27,510 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:27,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:27,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1558092726, now seen corresponding path program 1 times [2024-10-12 21:41:27,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:27,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93042265] [2024-10-12 21:41:27,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:27,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:27,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:41:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:27,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 21:41:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:27,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 21:41:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:27,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 21:41:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:27,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 21:41:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:27,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:41:27,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:27,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93042265] [2024-10-12 21:41:27,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93042265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:27,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:41:27,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:41:27,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478512436] [2024-10-12 21:41:27,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:27,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:41:27,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:27,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:41:27,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:41:27,595 INFO L87 Difference]: Start difference. First operand 10808 states and 17331 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:29,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:29,881 INFO L93 Difference]: Finished difference Result 30576 states and 48953 transitions. [2024-10-12 21:41:29,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:41:29,883 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 92 [2024-10-12 21:41:29,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:29,947 INFO L225 Difference]: With dead ends: 30576 [2024-10-12 21:41:29,948 INFO L226 Difference]: Without dead ends: 19782 [2024-10-12 21:41:29,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-12 21:41:29,976 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 917 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 1473 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 1556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:29,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 843 Invalid, 1556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1473 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 21:41:29,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19782 states. [2024-10-12 21:41:31,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19782 to 16043. [2024-10-12 21:41:31,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16043 states, 14192 states have (on average 1.5451662908680948) internal successors, (21929), 14322 states have internal predecessors, (21929), 1178 states have call successors, (1178), 577 states have call predecessors, (1178), 672 states have return successors, (2307), 1207 states have call predecessors, (2307), 1176 states have call successors, (2307) [2024-10-12 21:41:31,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16043 states to 16043 states and 25414 transitions. [2024-10-12 21:41:31,686 INFO L78 Accepts]: Start accepts. Automaton has 16043 states and 25414 transitions. Word has length 92 [2024-10-12 21:41:31,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:31,688 INFO L471 AbstractCegarLoop]: Abstraction has 16043 states and 25414 transitions. [2024-10-12 21:41:31,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:41:31,688 INFO L276 IsEmpty]: Start isEmpty. Operand 16043 states and 25414 transitions. [2024-10-12 21:41:31,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-12 21:41:31,722 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:31,722 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:31,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 21:41:31,723 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:31,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:31,723 INFO L85 PathProgramCache]: Analyzing trace with hash 907813625, now seen corresponding path program 1 times [2024-10-12 21:41:31,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:31,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90596115] [2024-10-12 21:41:31,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:31,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:31,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:31,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:41:31,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:31,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 21:41:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:31,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 21:41:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:31,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 21:41:31,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:31,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 21:41:31,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:31,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 21:41:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:31,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 21:41:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:31,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-12 21:41:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:31,864 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-12 21:41:31,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:31,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90596115] [2024-10-12 21:41:31,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90596115] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:41:31,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119863587] [2024-10-12 21:41:31,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:31,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:41:31,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:41:31,868 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:41:31,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 21:41:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:31,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 21:41:31,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:41:32,035 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-12 21:41:32,035 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:41:32,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119863587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:32,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:41:32,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-12 21:41:32,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475757371] [2024-10-12 21:41:32,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:32,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:41:32,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:32,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:41:32,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:41:32,040 INFO L87 Difference]: Start difference. First operand 16043 states and 25414 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 21:41:34,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:34,119 INFO L93 Difference]: Finished difference Result 47811 states and 76240 transitions. [2024-10-12 21:41:34,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:41:34,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 148 [2024-10-12 21:41:34,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:34,202 INFO L225 Difference]: With dead ends: 47811 [2024-10-12 21:41:34,203 INFO L226 Difference]: Without dead ends: 31782 [2024-10-12 21:41:34,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:41:34,232 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 251 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:34,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 523 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:41:34,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31782 states. [2024-10-12 21:41:36,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31782 to 31682. [2024-10-12 21:41:36,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31682 states, 28037 states have (on average 1.5414273995077932) internal successors, (43217), 28295 states have internal predecessors, (43217), 2300 states have call successors, (2300), 1153 states have call predecessors, (2300), 1344 states have return successors, (4495), 2297 states have call predecessors, (4495), 2298 states have call successors, (4495) [2024-10-12 21:41:37,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31682 states to 31682 states and 50012 transitions. [2024-10-12 21:41:37,020 INFO L78 Accepts]: Start accepts. Automaton has 31682 states and 50012 transitions. Word has length 148 [2024-10-12 21:41:37,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:37,021 INFO L471 AbstractCegarLoop]: Abstraction has 31682 states and 50012 transitions. [2024-10-12 21:41:37,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 21:41:37,021 INFO L276 IsEmpty]: Start isEmpty. Operand 31682 states and 50012 transitions. [2024-10-12 21:41:37,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-12 21:41:37,084 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:37,085 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:37,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-12 21:41:37,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-12 21:41:37,286 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:37,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:37,286 INFO L85 PathProgramCache]: Analyzing trace with hash -846949513, now seen corresponding path program 1 times [2024-10-12 21:41:37,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:37,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882401178] [2024-10-12 21:41:37,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:37,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:37,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:37,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:41:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:37,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 21:41:37,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:37,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 21:41:37,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:37,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 21:41:37,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:37,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 21:41:37,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:37,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 21:41:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:37,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 21:41:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:37,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-12 21:41:37,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:37,409 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-12 21:41:37,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:37,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882401178] [2024-10-12 21:41:37,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882401178] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:41:37,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282332425] [2024-10-12 21:41:37,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:37,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:41:37,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:41:37,412 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:41:37,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-12 21:41:37,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:37,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 21:41:37,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:41:37,569 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-12 21:41:37,570 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:41:37,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282332425] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:37,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:41:37,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-12 21:41:37,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647383904] [2024-10-12 21:41:37,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:37,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:41:37,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:37,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:41:37,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:41:37,573 INFO L87 Difference]: Start difference. First operand 31682 states and 50012 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 21:41:42,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:41:42,196 INFO L93 Difference]: Finished difference Result 94248 states and 149716 transitions. [2024-10-12 21:41:42,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:41:42,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 148 [2024-10-12 21:41:42,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:41:42,388 INFO L225 Difference]: With dead ends: 94248 [2024-10-12 21:41:42,389 INFO L226 Difference]: Without dead ends: 62580 [2024-10-12 21:41:42,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:41:42,454 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 241 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:41:42,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 523 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:41:42,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62580 states. [2024-10-12 21:41:47,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62580 to 62384. [2024-10-12 21:41:47,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62384 states, 55295 states have (on average 1.538529704313229) internal successors, (85073), 55809 states have internal predecessors, (85073), 4400 states have call successors, (4400), 2305 states have call predecessors, (4400), 2688 states have return successors, (8727), 4333 states have call predecessors, (8727), 4398 states have call successors, (8727) [2024-10-12 21:41:47,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62384 states to 62384 states and 98200 transitions. [2024-10-12 21:41:47,334 INFO L78 Accepts]: Start accepts. Automaton has 62384 states and 98200 transitions. Word has length 148 [2024-10-12 21:41:47,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:41:47,334 INFO L471 AbstractCegarLoop]: Abstraction has 62384 states and 98200 transitions. [2024-10-12 21:41:47,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 21:41:47,335 INFO L276 IsEmpty]: Start isEmpty. Operand 62384 states and 98200 transitions. [2024-10-12 21:41:47,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-12 21:41:47,399 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:41:47,399 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:41:47,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-12 21:41:47,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:41:47,603 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:41:47,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:41:47,604 INFO L85 PathProgramCache]: Analyzing trace with hash -185996939, now seen corresponding path program 1 times [2024-10-12 21:41:47,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:41:47,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868237828] [2024-10-12 21:41:47,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:47,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:41:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:47,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:41:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:47,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 21:41:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:47,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 21:41:47,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:47,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 21:41:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:47,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 21:41:47,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:47,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 21:41:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:47,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 21:41:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:47,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-12 21:41:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:47,703 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-12 21:41:47,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:41:47,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868237828] [2024-10-12 21:41:47,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868237828] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:41:47,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424914695] [2024-10-12 21:41:47,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:41:47,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:41:47,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:41:47,705 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 21:41:47,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-12 21:41:47,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:41:47,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 21:41:47,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:41:47,854 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-12 21:41:47,855 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:41:47,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424914695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:41:47,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:41:47,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-12 21:41:47,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906462317] [2024-10-12 21:41:47,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:41:47,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:41:47,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:41:47,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:41:47,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:41:47,857 INFO L87 Difference]: Start difference. First operand 62384 states and 98200 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)