./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.09.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.09.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 43061c6fd2cf55dd1721985927e668f0444e5f80f3517bfb8a4405f126e779da --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 22:54:07,938 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 22:54:08,016 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 22:54:08,021 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 22:54:08,024 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 22:54:08,047 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 22:54:08,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 22:54:08,047 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 22:54:08,048 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 22:54:08,048 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 22:54:08,048 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 22:54:08,049 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 22:54:08,049 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 22:54:08,049 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 22:54:08,049 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 22:54:08,050 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 22:54:08,050 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 22:54:08,050 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 22:54:08,050 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 22:54:08,051 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 22:54:08,051 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 22:54:08,054 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 22:54:08,054 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 22:54:08,055 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 22:54:08,055 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 22:54:08,055 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 22:54:08,055 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 22:54:08,055 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 22:54:08,056 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 22:54:08,056 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 22:54:08,056 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 22:54:08,056 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 22:54:08,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:54:08,057 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 22:54:08,057 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 22:54:08,057 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 22:54:08,057 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 22:54:08,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 22:54:08,058 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 22:54:08,058 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 22:54:08,058 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 22:54:08,059 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 22:54:08,059 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 -> 43061c6fd2cf55dd1721985927e668f0444e5f80f3517bfb8a4405f126e779da [2024-11-11 22:54:08,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 22:54:08,284 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 22:54:08,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 22:54:08,289 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 22:54:08,289 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 22:54:08,290 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.09.cil-2.c [2024-11-11 22:54:09,560 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 22:54:09,742 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 22:54:09,743 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.09.cil-2.c [2024-11-11 22:54:09,755 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e53b56345/4c8da359a95247e086fc30bddadcbf54/FLAG534642625 [2024-11-11 22:54:09,770 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e53b56345/4c8da359a95247e086fc30bddadcbf54 [2024-11-11 22:54:09,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 22:54:09,773 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 22:54:09,779 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 22:54:09,779 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 22:54:09,783 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 22:54:09,784 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:54:09" (1/1) ... [2024-11-11 22:54:09,784 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30a5f609 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:09, skipping insertion in model container [2024-11-11 22:54:09,784 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:54:09" (1/1) ... [2024-11-11 22:54:09,821 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 22:54:09,943 WARN L250 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.09.cil-2.c[913,926] [2024-11-11 22:54:09,982 WARN L250 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.09.cil-2.c[5977,5990] [2024-11-11 22:54:10,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:54:10,085 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 22:54:10,095 WARN L250 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.09.cil-2.c[913,926] [2024-11-11 22:54:10,105 WARN L250 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.09.cil-2.c[5977,5990] [2024-11-11 22:54:10,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:54:10,202 INFO L204 MainTranslator]: Completed translation [2024-11-11 22:54:10,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:10 WrapperNode [2024-11-11 22:54:10,203 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 22:54:10,204 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 22:54:10,204 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 22:54:10,204 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 22:54:10,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:10" (1/1) ... [2024-11-11 22:54:10,221 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:10" (1/1) ... [2024-11-11 22:54:10,259 INFO L138 Inliner]: procedures = 66, calls = 76, calls flagged for inlining = 40, calls inlined = 40, statements flattened = 909 [2024-11-11 22:54:10,259 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 22:54:10,260 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 22:54:10,260 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 22:54:10,260 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 22:54:10,269 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:10" (1/1) ... [2024-11-11 22:54:10,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:10" (1/1) ... [2024-11-11 22:54:10,272 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:10" (1/1) ... [2024-11-11 22:54:10,287 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-11-11 22:54:10,287 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:10" (1/1) ... [2024-11-11 22:54:10,287 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:10" (1/1) ... [2024-11-11 22:54:10,296 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:10" (1/1) ... [2024-11-11 22:54:10,308 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:10" (1/1) ... [2024-11-11 22:54:10,310 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:10" (1/1) ... [2024-11-11 22:54:10,317 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:10" (1/1) ... [2024-11-11 22:54:10,326 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 22:54:10,327 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 22:54:10,328 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 22:54:10,328 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 22:54:10,328 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:10" (1/1) ... [2024-11-11 22:54:10,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:54:10,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:54:10,359 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-11-11 22:54:10,361 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-11-11 22:54:10,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 22:54:10,398 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-11 22:54:10,398 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-11 22:54:10,398 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-11-11 22:54:10,398 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-11-11 22:54:10,398 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-11 22:54:10,398 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-11 22:54:10,399 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-11 22:54:10,399 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-11 22:54:10,399 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-11 22:54:10,399 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-11 22:54:10,399 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-11 22:54:10,399 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-11 22:54:10,399 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-11 22:54:10,399 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-11 22:54:10,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 22:54:10,399 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-11 22:54:10,400 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-11 22:54:10,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 22:54:10,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 22:54:10,400 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-11 22:54:10,400 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-11 22:54:10,400 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-11-11 22:54:10,400 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-11-11 22:54:10,499 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 22:54:10,502 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 22:54:11,163 INFO L? ?]: Removed 113 outVars from TransFormulas that were not future-live. [2024-11-11 22:54:11,164 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 22:54:11,191 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 22:54:11,195 INFO L316 CfgBuilder]: Removed 16 assume(true) statements. [2024-11-11 22:54:11,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:54:11 BoogieIcfgContainer [2024-11-11 22:54:11,196 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 22:54:11,198 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 22:54:11,198 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 22:54:11,202 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 22:54:11,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 10:54:09" (1/3) ... [2024-11-11 22:54:11,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79cefc7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:54:11, skipping insertion in model container [2024-11-11 22:54:11,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:54:10" (2/3) ... [2024-11-11 22:54:11,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79cefc7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:54:11, skipping insertion in model container [2024-11-11 22:54:11,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:54:11" (3/3) ... [2024-11-11 22:54:11,205 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.09.cil-2.c [2024-11-11 22:54:11,219 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 22:54:11,219 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-11 22:54:11,292 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 22:54:11,297 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;@289a54bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 22:54:11,297 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-11 22:54:11,303 INFO L276 IsEmpty]: Start isEmpty. Operand has 397 states, 353 states have (on average 1.6232294617563738) internal successors, (573), 360 states have internal predecessors, (573), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-11 22:54:11,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-11 22:54:11,315 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:11,316 INFO L218 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] [2024-11-11 22:54:11,316 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:11,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:11,322 INFO L85 PathProgramCache]: Analyzing trace with hash 492351257, now seen corresponding path program 1 times [2024-11-11 22:54:11,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:11,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154296222] [2024-11-11 22:54:11,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:11,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:11,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:11,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:54:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:11,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 22:54:11,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:11,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:54:11,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:11,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154296222] [2024-11-11 22:54:11,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154296222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:11,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:11,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 22:54:11,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830191813] [2024-11-11 22:54:11,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:11,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:54:11,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:11,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:54:11,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 22:54:11,669 INFO L87 Difference]: Start difference. First operand has 397 states, 353 states have (on average 1.6232294617563738) internal successors, (573), 360 states have internal predecessors, (573), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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-11-11 22:54:12,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:12,157 INFO L93 Difference]: Finished difference Result 841 states and 1344 transitions. [2024-11-11 22:54:12,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:54:12,159 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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 44 [2024-11-11 22:54:12,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:12,170 INFO L225 Difference]: With dead ends: 841 [2024-11-11 22:54:12,170 INFO L226 Difference]: Without dead ends: 456 [2024-11-11 22:54:12,182 INFO L434 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-11-11 22:54:12,185 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 786 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:12,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 766 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 22:54:12,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-11-11 22:54:12,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 450. [2024-11-11 22:54:12,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 402 states have (on average 1.507462686567164) internal successors, (606), 407 states have internal predecessors, (606), 35 states have call successors, (35), 12 states have call predecessors, (35), 11 states have return successors, (37), 31 states have call predecessors, (37), 31 states have call successors, (37) [2024-11-11 22:54:12,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 678 transitions. [2024-11-11 22:54:12,256 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 678 transitions. Word has length 44 [2024-11-11 22:54:12,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:12,257 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 678 transitions. [2024-11-11 22:54:12,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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-11-11 22:54:12,257 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 678 transitions. [2024-11-11 22:54:12,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-11 22:54:12,260 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:12,260 INFO L218 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] [2024-11-11 22:54:12,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 22:54:12,261 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:12,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:12,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1310916311, now seen corresponding path program 1 times [2024-11-11 22:54:12,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:12,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117236625] [2024-11-11 22:54:12,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:12,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:12,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:54:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:12,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-11 22:54:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:12,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:54:12,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:12,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117236625] [2024-11-11 22:54:12,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117236625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:12,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:12,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 22:54:12,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889328640] [2024-11-11 22:54:12,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:12,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:54:12,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:12,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:54:12,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 22:54:12,362 INFO L87 Difference]: Start difference. First operand 450 states and 678 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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-11-11 22:54:12,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:12,804 INFO L93 Difference]: Finished difference Result 698 states and 1018 transitions. [2024-11-11 22:54:12,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:54:12,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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 45 [2024-11-11 22:54:12,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:12,807 INFO L225 Difference]: With dead ends: 698 [2024-11-11 22:54:12,808 INFO L226 Difference]: Without dead ends: 574 [2024-11-11 22:54:12,808 INFO L434 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-11-11 22:54:12,809 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 310 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:12,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 1055 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 22:54:12,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-11-11 22:54:12,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 517. [2024-11-11 22:54:12,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 463 states have (on average 1.490280777537797) internal successors, (690), 468 states have internal predecessors, (690), 38 states have call successors, (38), 15 states have call predecessors, (38), 14 states have return successors, (40), 34 states have call predecessors, (40), 34 states have call successors, (40) [2024-11-11 22:54:12,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 768 transitions. [2024-11-11 22:54:12,838 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 768 transitions. Word has length 45 [2024-11-11 22:54:12,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:12,839 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 768 transitions. [2024-11-11 22:54:12,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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-11-11 22:54:12,839 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 768 transitions. [2024-11-11 22:54:12,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-11 22:54:12,844 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:12,844 INFO L218 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] [2024-11-11 22:54:12,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 22:54:12,844 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:12,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:12,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1699693524, now seen corresponding path program 1 times [2024-11-11 22:54:12,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:12,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763844599] [2024-11-11 22:54:12,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:12,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:12,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:54:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:12,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-11 22:54:12,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:12,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:54:12,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:12,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763844599] [2024-11-11 22:54:12,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763844599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:12,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:12,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 22:54:12,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968244328] [2024-11-11 22:54:12,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:12,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:54:12,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:12,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:54:12,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 22:54:12,911 INFO L87 Difference]: Start difference. First operand 517 states and 768 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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-11-11 22:54:13,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:13,251 INFO L93 Difference]: Finished difference Result 925 states and 1327 transitions. [2024-11-11 22:54:13,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:54:13,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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 45 [2024-11-11 22:54:13,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:13,255 INFO L225 Difference]: With dead ends: 925 [2024-11-11 22:54:13,255 INFO L226 Difference]: Without dead ends: 734 [2024-11-11 22:54:13,256 INFO L434 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-11-11 22:54:13,257 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 796 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:13,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 763 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 22:54:13,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2024-11-11 22:54:13,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 682. [2024-11-11 22:54:13,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 609 states have (on average 1.444991789819376) internal successors, (880), 617 states have internal predecessors, (880), 49 states have call successors, (49), 22 states have call predecessors, (49), 22 states have return successors, (57), 43 states have call predecessors, (57), 45 states have call successors, (57) [2024-11-11 22:54:13,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 986 transitions. [2024-11-11 22:54:13,303 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 986 transitions. Word has length 45 [2024-11-11 22:54:13,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:13,303 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 986 transitions. [2024-11-11 22:54:13,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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-11-11 22:54:13,304 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 986 transitions. [2024-11-11 22:54:13,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-11 22:54:13,306 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:13,306 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:54:13,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 22:54:13,307 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:13,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:13,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1801249655, now seen corresponding path program 1 times [2024-11-11 22:54:13,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:13,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040435351] [2024-11-11 22:54:13,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:13,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:13,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:54:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:13,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-11 22:54:13,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:13,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 22:54:13,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:13,429 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-11 22:54:13,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:13,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040435351] [2024-11-11 22:54:13,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040435351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:13,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:13,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 22:54:13,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783580281] [2024-11-11 22:54:13,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:13,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:54:13,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:13,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:54:13,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 22:54:13,433 INFO L87 Difference]: Start difference. First operand 682 states and 986 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 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-11-11 22:54:13,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:13,870 INFO L93 Difference]: Finished difference Result 1266 states and 1771 transitions. [2024-11-11 22:54:13,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:54:13,871 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 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 62 [2024-11-11 22:54:13,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:13,875 INFO L225 Difference]: With dead ends: 1266 [2024-11-11 22:54:13,876 INFO L226 Difference]: Without dead ends: 910 [2024-11-11 22:54:13,877 INFO L434 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-11-11 22:54:13,878 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 294 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:13,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1108 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 22:54:13,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2024-11-11 22:54:13,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 872. [2024-11-11 22:54:13,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 775 states have (on average 1.3935483870967742) internal successors, (1080), 785 states have internal predecessors, (1080), 63 states have call successors, (63), 30 states have call predecessors, (63), 32 states have return successors, (81), 57 states have call predecessors, (81), 59 states have call successors, (81) [2024-11-11 22:54:13,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1224 transitions. [2024-11-11 22:54:13,932 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1224 transitions. Word has length 62 [2024-11-11 22:54:13,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:13,933 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1224 transitions. [2024-11-11 22:54:13,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 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-11-11 22:54:13,934 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1224 transitions. [2024-11-11 22:54:13,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-11 22:54:13,936 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:13,937 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:54:13,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 22:54:13,937 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:13,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:13,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1372884258, now seen corresponding path program 1 times [2024-11-11 22:54:13,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:13,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274149382] [2024-11-11 22:54:13,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:13,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:13,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:54:13,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:13,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:54:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:13,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 22:54:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:14,002 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-11 22:54:14,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:14,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274149382] [2024-11-11 22:54:14,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274149382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:14,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:14,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 22:54:14,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400881191] [2024-11-11 22:54:14,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:14,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:54:14,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:14,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:54:14,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 22:54:14,004 INFO L87 Difference]: Start difference. First operand 872 states and 1224 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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-11-11 22:54:14,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:14,314 INFO L93 Difference]: Finished difference Result 1525 states and 2077 transitions. [2024-11-11 22:54:14,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:54:14,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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 67 [2024-11-11 22:54:14,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:14,322 INFO L225 Difference]: With dead ends: 1525 [2024-11-11 22:54:14,322 INFO L226 Difference]: Without dead ends: 1071 [2024-11-11 22:54:14,324 INFO L434 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-11-11 22:54:14,325 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 783 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:14,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 762 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 22:54:14,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2024-11-11 22:54:14,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1016. [2024-11-11 22:54:14,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 903 states have (on average 1.363233665559247) internal successors, (1231), 915 states have internal predecessors, (1231), 71 states have call successors, (71), 36 states have call predecessors, (71), 40 states have return successors, (95), 65 states have call predecessors, (95), 67 states have call successors, (95) [2024-11-11 22:54:14,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1397 transitions. [2024-11-11 22:54:14,379 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1397 transitions. Word has length 67 [2024-11-11 22:54:14,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:14,380 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1397 transitions. [2024-11-11 22:54:14,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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-11-11 22:54:14,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1397 transitions. [2024-11-11 22:54:14,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-11 22:54:14,381 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:14,382 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 22:54:14,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 22:54:14,382 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:14,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:14,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1498194643, now seen corresponding path program 1 times [2024-11-11 22:54:14,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:14,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537520600] [2024-11-11 22:54:14,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:14,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:14,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:14,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:54:14,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:14,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:54:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:14,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 22:54:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:14,488 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 22:54:14,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:14,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537520600] [2024-11-11 22:54:14,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537520600] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:54:14,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532721597] [2024-11-11 22:54:14,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:14,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:54:14,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:54:14,496 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-11-11 22:54:14,497 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-11-11 22:54:14,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:14,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 22:54:14,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:54:14,616 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 22:54:14,616 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 22:54:14,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532721597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:14,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 22:54:14,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-11 22:54:14,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585138734] [2024-11-11 22:54:14,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:14,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:54:14,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:14,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:54:14,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:54:14,618 INFO L87 Difference]: Start difference. First operand 1016 states and 1397 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 22:54:14,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:14,667 INFO L93 Difference]: Finished difference Result 1559 states and 2120 transitions. [2024-11-11 22:54:14,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:54:14,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (4), 3 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 68 [2024-11-11 22:54:14,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:14,672 INFO L225 Difference]: With dead ends: 1559 [2024-11-11 22:54:14,672 INFO L226 Difference]: Without dead ends: 1014 [2024-11-11 22:54:14,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 74 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-11-11 22:54:14,675 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 72 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:14,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1195 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:54:14,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2024-11-11 22:54:14,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 970. [2024-11-11 22:54:14,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 863 states have (on average 1.3511008111239862) internal successors, (1166), 875 states have internal predecessors, (1166), 67 states have call successors, (67), 34 states have call predecessors, (67), 38 states have return successors, (89), 61 states have call predecessors, (89), 63 states have call successors, (89) [2024-11-11 22:54:14,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1322 transitions. [2024-11-11 22:54:14,717 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1322 transitions. Word has length 68 [2024-11-11 22:54:14,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:14,717 INFO L471 AbstractCegarLoop]: Abstraction has 970 states and 1322 transitions. [2024-11-11 22:54:14,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 22:54:14,717 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1322 transitions. [2024-11-11 22:54:14,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-11 22:54:14,719 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:14,719 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:54:14,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 22:54:14,919 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-11-11 22:54:14,923 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:14,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:14,924 INFO L85 PathProgramCache]: Analyzing trace with hash 681777132, now seen corresponding path program 1 times [2024-11-11 22:54:14,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:14,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254744713] [2024-11-11 22:54:14,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:14,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:14,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:54:14,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:14,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:54:14,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:15,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 22:54:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:15,021 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 22:54:15,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:15,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254744713] [2024-11-11 22:54:15,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254744713] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:54:15,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863160061] [2024-11-11 22:54:15,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:15,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:54:15,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:54:15,027 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-11-11 22:54:15,029 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-11-11 22:54:15,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:15,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 22:54:15,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:54:15,220 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:54:15,220 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:54:15,252 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-11 22:54:15,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863160061] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-11 22:54:15,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-11 22:54:15,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2024-11-11 22:54:15,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037325501] [2024-11-11 22:54:15,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:15,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:54:15,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:15,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:54:15,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:54:15,254 INFO L87 Difference]: Start difference. First operand 970 states and 1322 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 22:54:15,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:15,394 INFO L93 Difference]: Finished difference Result 1022 states and 1384 transitions. [2024-11-11 22:54:15,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 22:54:15,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 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 68 [2024-11-11 22:54:15,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:15,398 INFO L225 Difference]: With dead ends: 1022 [2024-11-11 22:54:15,398 INFO L226 Difference]: Without dead ends: 1019 [2024-11-11 22:54:15,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:54:15,399 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 1061 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1061 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:15,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1061 Valid, 673 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 22:54:15,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2024-11-11 22:54:15,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 969. [2024-11-11 22:54:15,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 863 states have (on average 1.3487833140208574) internal successors, (1164), 874 states have internal predecessors, (1164), 66 states have call successors, (66), 34 states have call predecessors, (66), 38 states have return successors, (89), 61 states have call predecessors, (89), 63 states have call successors, (89) [2024-11-11 22:54:15,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1319 transitions. [2024-11-11 22:54:15,443 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1319 transitions. Word has length 68 [2024-11-11 22:54:15,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:15,444 INFO L471 AbstractCegarLoop]: Abstraction has 969 states and 1319 transitions. [2024-11-11 22:54:15,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 22:54:15,444 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1319 transitions. [2024-11-11 22:54:15,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-11 22:54:15,445 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:15,446 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:54:15,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-11 22:54:15,649 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-11-11 22:54:15,650 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:15,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:15,650 INFO L85 PathProgramCache]: Analyzing trace with hash -340955775, now seen corresponding path program 1 times [2024-11-11 22:54:15,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:15,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899345810] [2024-11-11 22:54:15,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:15,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:15,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:54:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:15,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:54:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:15,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 22:54:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:15,725 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 22:54:15,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:15,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899345810] [2024-11-11 22:54:15,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899345810] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:54:15,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106098008] [2024-11-11 22:54:15,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:15,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:54:15,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:54:15,730 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-11-11 22:54:15,740 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-11-11 22:54:15,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:15,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-11 22:54:15,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:54:16,027 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:54:16,028 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:54:16,089 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-11 22:54:16,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106098008] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 22:54:16,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 22:54:16,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 11 [2024-11-11 22:54:16,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571843870] [2024-11-11 22:54:16,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 22:54:16,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 22:54:16,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:16,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 22:54:16,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:54:16,091 INFO L87 Difference]: Start difference. First operand 969 states and 1319 transitions. Second operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-11 22:54:17,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:17,238 INFO L93 Difference]: Finished difference Result 2286 states and 3025 transitions. [2024-11-11 22:54:17,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-11 22:54:17,239 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 69 [2024-11-11 22:54:17,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:17,246 INFO L225 Difference]: With dead ends: 2286 [2024-11-11 22:54:17,246 INFO L226 Difference]: Without dead ends: 1790 [2024-11-11 22:54:17,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2024-11-11 22:54:17,249 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 953 mSDsluCounter, 2930 mSDsCounter, 0 mSdLazyCounter, 2108 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 983 SdHoareTripleChecker+Valid, 3381 SdHoareTripleChecker+Invalid, 2147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 2108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:17,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [983 Valid, 3381 Invalid, 2147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 2108 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 22:54:17,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2024-11-11 22:54:17,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1322. [2024-11-11 22:54:17,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1322 states, 1177 states have (on average 1.3101104502973662) internal successors, (1542), 1196 states have internal predecessors, (1542), 86 states have call successors, (86), 48 states have call predecessors, (86), 57 states have return successors, (123), 78 states have call predecessors, (123), 83 states have call successors, (123) [2024-11-11 22:54:17,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1751 transitions. [2024-11-11 22:54:17,307 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1751 transitions. Word has length 69 [2024-11-11 22:54:17,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:17,307 INFO L471 AbstractCegarLoop]: Abstraction has 1322 states and 1751 transitions. [2024-11-11 22:54:17,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-11 22:54:17,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1751 transitions. [2024-11-11 22:54:17,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-11 22:54:17,310 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:17,310 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1] [2024-11-11 22:54:17,324 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-11-11 22:54:17,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:54:17,515 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:17,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:17,516 INFO L85 PathProgramCache]: Analyzing trace with hash -734762725, now seen corresponding path program 1 times [2024-11-11 22:54:17,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:17,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654924593] [2024-11-11 22:54:17,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:17,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:17,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:54:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:17,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:54:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:17,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 22:54:17,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:17,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 22:54:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:17,630 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-11 22:54:17,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:17,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654924593] [2024-11-11 22:54:17,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654924593] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:54:17,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018256326] [2024-11-11 22:54:17,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:17,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:54:17,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:54:17,632 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-11-11 22:54:17,633 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-11-11 22:54:17,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:17,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 22:54:17,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:54:17,756 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-11 22:54:17,757 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 22:54:17,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018256326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:17,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 22:54:17,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-11 22:54:17,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506151452] [2024-11-11 22:54:17,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:17,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:54:17,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:17,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:54:17,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:54:17,758 INFO L87 Difference]: Start difference. First operand 1322 states and 1751 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, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-11 22:54:17,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:17,808 INFO L93 Difference]: Finished difference Result 1987 states and 2592 transitions. [2024-11-11 22:54:17,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:54:17,808 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, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 88 [2024-11-11 22:54:17,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:17,813 INFO L225 Difference]: With dead ends: 1987 [2024-11-11 22:54:17,813 INFO L226 Difference]: Without dead ends: 1244 [2024-11-11 22:54:17,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 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-11-11 22:54:17,816 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 545 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:17,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 688 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:54:17,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2024-11-11 22:54:17,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1235. [2024-11-11 22:54:17,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 1100 states have (on average 1.3072727272727274) internal successors, (1438), 1118 states have internal predecessors, (1438), 82 states have call successors, (82), 44 states have call predecessors, (82), 51 states have return successors, (115), 73 states have call predecessors, (115), 79 states have call successors, (115) [2024-11-11 22:54:17,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1635 transitions. [2024-11-11 22:54:17,863 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1635 transitions. Word has length 88 [2024-11-11 22:54:17,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:17,864 INFO L471 AbstractCegarLoop]: Abstraction has 1235 states and 1635 transitions. [2024-11-11 22:54:17,864 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, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-11 22:54:17,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1635 transitions. [2024-11-11 22:54:17,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-11 22:54:17,866 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:17,866 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-11-11 22:54:17,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-11 22:54:18,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:54:18,067 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:18,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:18,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1460677985, now seen corresponding path program 1 times [2024-11-11 22:54:18,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:18,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938132996] [2024-11-11 22:54:18,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:18,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:18,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:54:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:18,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:54:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:18,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 22:54:18,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:18,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 22:54:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:18,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 22:54:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:18,150 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-11 22:54:18,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:18,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938132996] [2024-11-11 22:54:18,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938132996] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:54:18,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717237555] [2024-11-11 22:54:18,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:18,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:54:18,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:54:18,153 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-11-11 22:54:18,164 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-11-11 22:54:18,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:18,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 22:54:18,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:54:18,285 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 22:54:18,285 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 22:54:18,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717237555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:18,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 22:54:18,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-11 22:54:18,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082645507] [2024-11-11 22:54:18,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:18,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:54:18,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:18,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:54:18,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:54:18,287 INFO L87 Difference]: Start difference. First operand 1235 states and 1635 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-11-11 22:54:18,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:18,340 INFO L93 Difference]: Finished difference Result 1612 states and 2096 transitions. [2024-11-11 22:54:18,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:54:18,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 103 [2024-11-11 22:54:18,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:18,343 INFO L225 Difference]: With dead ends: 1612 [2024-11-11 22:54:18,343 INFO L226 Difference]: Without dead ends: 320 [2024-11-11 22:54:18,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 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-11-11 22:54:18,345 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 61 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:18,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1191 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:54:18,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-11 22:54:18,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2024-11-11 22:54:18,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 288 states have (on average 1.5520833333333333) internal successors, (447), 290 states have internal predecessors, (447), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-11 22:54:18,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 495 transitions. [2024-11-11 22:54:18,361 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 495 transitions. Word has length 103 [2024-11-11 22:54:18,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:18,361 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 495 transitions. [2024-11-11 22:54:18,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-11-11 22:54:18,362 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 495 transitions. [2024-11-11 22:54:18,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-11 22:54:18,363 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:18,363 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:54:18,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-11 22:54:18,564 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,SelfDestructingSolverStorable9 [2024-11-11 22:54:18,564 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:18,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:18,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1516933778, now seen corresponding path program 1 times [2024-11-11 22:54:18,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:18,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938225857] [2024-11-11 22:54:18,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:18,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:18,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:54:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:18,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 22:54:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:18,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 22:54:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:18,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 22:54:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:18,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 22:54:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:18,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:54:18,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:18,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938225857] [2024-11-11 22:54:18,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938225857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:18,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:18,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:54:18,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960845612] [2024-11-11 22:54:18,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:18,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:54:18,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:18,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:54:18,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:54:18,694 INFO L87 Difference]: Start difference. First operand 320 states and 495 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:54:19,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:19,699 INFO L93 Difference]: Finished difference Result 738 states and 1161 transitions. [2024-11-11 22:54:19,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 22:54:19,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 146 [2024-11-11 22:54:19,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:19,702 INFO L225 Difference]: With dead ends: 738 [2024-11-11 22:54:19,702 INFO L226 Difference]: Without dead ends: 429 [2024-11-11 22:54:19,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:54:19,703 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 829 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:19,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 651 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 22:54:19,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-11-11 22:54:19,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 320. [2024-11-11 22:54:19,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 288 states have (on average 1.5486111111111112) internal successors, (446), 290 states have internal predecessors, (446), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-11 22:54:19,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 494 transitions. [2024-11-11 22:54:19,718 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 494 transitions. Word has length 146 [2024-11-11 22:54:19,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:19,719 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 494 transitions. [2024-11-11 22:54:19,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:54:19,719 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 494 transitions. [2024-11-11 22:54:19,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-11 22:54:19,720 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:19,720 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:54:19,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 22:54:19,720 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:19,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:19,720 INFO L85 PathProgramCache]: Analyzing trace with hash 100506672, now seen corresponding path program 1 times [2024-11-11 22:54:19,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:19,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547898683] [2024-11-11 22:54:19,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:19,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:19,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:54:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:19,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 22:54:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:19,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 22:54:19,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:19,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 22:54:19,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:19,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 22:54:19,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:19,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:54:19,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:19,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547898683] [2024-11-11 22:54:19,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547898683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:19,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:19,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:54:19,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662084372] [2024-11-11 22:54:19,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:19,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:54:19,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:19,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:54:19,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:54:19,897 INFO L87 Difference]: Start difference. First operand 320 states and 494 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 4 states have internal predecessors, (135), 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-11-11 22:54:21,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:21,673 INFO L93 Difference]: Finished difference Result 1154 states and 1825 transitions. [2024-11-11 22:54:21,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:54:21,674 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 4 states have internal predecessors, (135), 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 146 [2024-11-11 22:54:21,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:21,678 INFO L225 Difference]: With dead ends: 1154 [2024-11-11 22:54:21,679 INFO L226 Difference]: Without dead ends: 852 [2024-11-11 22:54:21,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:54:21,680 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 1248 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 1759 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1264 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 1863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:21,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1264 Valid, 1111 Invalid, 1863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1759 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 22:54:21,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2024-11-11 22:54:21,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 633. [2024-11-11 22:54:21,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 576 states have (on average 1.5607638888888888) internal successors, (899), 579 states have internal predecessors, (899), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (44), 41 states have call predecessors, (44), 41 states have call successors, (44) [2024-11-11 22:54:21,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 986 transitions. [2024-11-11 22:54:21,711 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 986 transitions. Word has length 146 [2024-11-11 22:54:21,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:21,712 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 986 transitions. [2024-11-11 22:54:21,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 4 states have internal predecessors, (135), 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-11-11 22:54:21,712 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 986 transitions. [2024-11-11 22:54:21,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-11 22:54:21,713 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:21,713 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:54:21,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 22:54:21,713 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:21,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:21,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1700958932, now seen corresponding path program 1 times [2024-11-11 22:54:21,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:21,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207436856] [2024-11-11 22:54:21,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:21,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:21,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:21,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:54:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:21,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 22:54:21,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:21,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 22:54:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:21,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 22:54:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:21,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 22:54:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:21,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:54:21,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:21,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207436856] [2024-11-11 22:54:21,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207436856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:21,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:21,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:54:21,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302749811] [2024-11-11 22:54:21,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:21,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:54:21,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:21,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:54:21,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:54:21,897 INFO L87 Difference]: Start difference. First operand 633 states and 986 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-11 22:54:24,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:24,045 INFO L93 Difference]: Finished difference Result 1902 states and 3012 transitions. [2024-11-11 22:54:24,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:54:24,045 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 146 [2024-11-11 22:54:24,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:24,050 INFO L225 Difference]: With dead ends: 1902 [2024-11-11 22:54:24,050 INFO L226 Difference]: Without dead ends: 1287 [2024-11-11 22:54:24,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:54:24,052 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 1346 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 2505 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1362 SdHoareTripleChecker+Valid, 1448 SdHoareTripleChecker+Invalid, 2594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 2505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:24,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1362 Valid, 1448 Invalid, 2594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 2505 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-11 22:54:24,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2024-11-11 22:54:24,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 925. [2024-11-11 22:54:24,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 843 states have (on average 1.5539739027283512) internal successors, (1310), 847 states have internal predecessors, (1310), 61 states have call successors, (61), 19 states have call predecessors, (61), 20 states have return successors, (64), 60 states have call predecessors, (64), 59 states have call successors, (64) [2024-11-11 22:54:24,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1435 transitions. [2024-11-11 22:54:24,093 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1435 transitions. Word has length 146 [2024-11-11 22:54:24,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:24,093 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1435 transitions. [2024-11-11 22:54:24,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-11 22:54:24,093 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1435 transitions. [2024-11-11 22:54:24,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-11 22:54:24,094 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:24,094 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:54:24,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 22:54:24,095 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:24,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:24,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1887411758, now seen corresponding path program 1 times [2024-11-11 22:54:24,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:24,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273051052] [2024-11-11 22:54:24,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:24,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:24,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:54:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:24,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 22:54:24,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:24,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 22:54:24,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:24,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 22:54:24,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:24,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 22:54:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:24,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:54:24,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:24,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273051052] [2024-11-11 22:54:24,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273051052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:24,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:24,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:54:24,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334046495] [2024-11-11 22:54:24,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:24,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:54:24,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:24,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:54:24,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:54:24,288 INFO L87 Difference]: Start difference. First operand 925 states and 1435 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-11 22:54:26,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:26,352 INFO L93 Difference]: Finished difference Result 3005 states and 4749 transitions. [2024-11-11 22:54:26,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:54:26,353 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 146 [2024-11-11 22:54:26,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:26,360 INFO L225 Difference]: With dead ends: 3005 [2024-11-11 22:54:26,360 INFO L226 Difference]: Without dead ends: 2098 [2024-11-11 22:54:26,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:54:26,362 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 1273 mSDsluCounter, 1665 mSDsCounter, 0 mSdLazyCounter, 2789 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1289 SdHoareTripleChecker+Valid, 2149 SdHoareTripleChecker+Invalid, 2850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:26,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1289 Valid, 2149 Invalid, 2850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2789 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-11 22:54:26,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2098 states. [2024-11-11 22:54:26,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2098 to 1510. [2024-11-11 22:54:26,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1510 states, 1378 states have (on average 1.5478955007256894) internal successors, (2133), 1384 states have internal predecessors, (2133), 97 states have call successors, (97), 31 states have call predecessors, (97), 34 states have return successors, (108), 98 states have call predecessors, (108), 95 states have call successors, (108) [2024-11-11 22:54:26,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 2338 transitions. [2024-11-11 22:54:26,431 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 2338 transitions. Word has length 146 [2024-11-11 22:54:26,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:26,431 INFO L471 AbstractCegarLoop]: Abstraction has 1510 states and 2338 transitions. [2024-11-11 22:54:26,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-11 22:54:26,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 2338 transitions. [2024-11-11 22:54:26,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-11 22:54:26,432 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:26,432 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:54:26,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 22:54:26,433 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:26,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:26,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1460517652, now seen corresponding path program 1 times [2024-11-11 22:54:26,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:26,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113403810] [2024-11-11 22:54:26,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:26,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:26,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:54:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:26,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 22:54:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:26,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 22:54:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:26,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 22:54:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:26,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 22:54:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:26,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:54:26,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:26,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113403810] [2024-11-11 22:54:26,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113403810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:26,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:26,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:54:26,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019702779] [2024-11-11 22:54:26,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:26,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:54:26,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:26,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:54:26,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:54:26,626 INFO L87 Difference]: Start difference. First operand 1510 states and 2338 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-11 22:54:28,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:28,880 INFO L93 Difference]: Finished difference Result 5130 states and 8076 transitions. [2024-11-11 22:54:28,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:54:28,880 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 146 [2024-11-11 22:54:28,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:28,894 INFO L225 Difference]: With dead ends: 5130 [2024-11-11 22:54:28,894 INFO L226 Difference]: Without dead ends: 3638 [2024-11-11 22:54:28,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:54:28,899 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 1265 mSDsluCounter, 1665 mSDsCounter, 0 mSdLazyCounter, 2786 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1281 SdHoareTripleChecker+Valid, 2149 SdHoareTripleChecker+Invalid, 2847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:28,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1281 Valid, 2149 Invalid, 2847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2786 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-11 22:54:28,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3638 states. [2024-11-11 22:54:29,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3638 to 2681. [2024-11-11 22:54:29,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2681 states, 2449 states have (on average 1.5430788076766027) internal successors, (3779), 2459 states have internal predecessors, (3779), 169 states have call successors, (169), 55 states have call predecessors, (169), 62 states have return successors, (202), 174 states have call predecessors, (202), 167 states have call successors, (202) [2024-11-11 22:54:29,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2681 states to 2681 states and 4150 transitions. [2024-11-11 22:54:29,048 INFO L78 Accepts]: Start accepts. Automaton has 2681 states and 4150 transitions. Word has length 146 [2024-11-11 22:54:29,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:29,048 INFO L471 AbstractCegarLoop]: Abstraction has 2681 states and 4150 transitions. [2024-11-11 22:54:29,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-11 22:54:29,048 INFO L276 IsEmpty]: Start isEmpty. Operand 2681 states and 4150 transitions. [2024-11-11 22:54:29,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-11 22:54:29,050 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:29,050 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:54:29,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 22:54:29,050 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:29,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:29,051 INFO L85 PathProgramCache]: Analyzing trace with hash -598684050, now seen corresponding path program 1 times [2024-11-11 22:54:29,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:29,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975865369] [2024-11-11 22:54:29,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:29,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:29,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:54:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:29,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 22:54:29,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:29,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 22:54:29,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:29,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 22:54:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:29,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 22:54:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:29,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:54:29,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:29,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975865369] [2024-11-11 22:54:29,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975865369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:29,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:29,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:54:29,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704449280] [2024-11-11 22:54:29,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:29,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:54:29,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:29,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:54:29,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:54:29,245 INFO L87 Difference]: Start difference. First operand 2681 states and 4150 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-11 22:54:31,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:31,550 INFO L93 Difference]: Finished difference Result 9379 states and 14746 transitions. [2024-11-11 22:54:31,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:54:31,551 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 146 [2024-11-11 22:54:31,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:31,576 INFO L225 Difference]: With dead ends: 9379 [2024-11-11 22:54:31,576 INFO L226 Difference]: Without dead ends: 6716 [2024-11-11 22:54:31,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:54:31,586 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 1261 mSDsluCounter, 1665 mSDsCounter, 0 mSdLazyCounter, 2777 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 2149 SdHoareTripleChecker+Invalid, 2838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:31,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1277 Valid, 2149 Invalid, 2838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2777 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-11 22:54:31,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6716 states. [2024-11-11 22:54:31,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6716 to 5028. [2024-11-11 22:54:31,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5028 states, 4596 states have (on average 1.5398172323759791) internal successors, (7077), 4614 states have internal predecessors, (7077), 313 states have call successors, (313), 103 states have call predecessors, (313), 118 states have return successors, (408), 326 states have call predecessors, (408), 311 states have call successors, (408) [2024-11-11 22:54:31,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5028 states to 5028 states and 7798 transitions. [2024-11-11 22:54:31,857 INFO L78 Accepts]: Start accepts. Automaton has 5028 states and 7798 transitions. Word has length 146 [2024-11-11 22:54:31,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:31,857 INFO L471 AbstractCegarLoop]: Abstraction has 5028 states and 7798 transitions. [2024-11-11 22:54:31,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-11 22:54:31,858 INFO L276 IsEmpty]: Start isEmpty. Operand 5028 states and 7798 transitions. [2024-11-11 22:54:31,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-11 22:54:31,861 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:31,861 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:54:31,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 22:54:31,861 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:31,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:31,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1645874348, now seen corresponding path program 1 times [2024-11-11 22:54:31,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:31,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012676441] [2024-11-11 22:54:31,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:31,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:31,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:54:31,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:31,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 22:54:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:32,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 22:54:32,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:32,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 22:54:32,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:32,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 22:54:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:32,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:54:32,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:32,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012676441] [2024-11-11 22:54:32,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012676441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:32,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:32,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:54:32,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31701708] [2024-11-11 22:54:32,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:32,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:54:32,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:32,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:54:32,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:54:32,031 INFO L87 Difference]: Start difference. First operand 5028 states and 7798 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-11 22:54:33,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:33,261 INFO L93 Difference]: Finished difference Result 11802 states and 18615 transitions. [2024-11-11 22:54:33,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:54:33,262 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 146 [2024-11-11 22:54:33,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:33,288 INFO L225 Difference]: With dead ends: 11802 [2024-11-11 22:54:33,288 INFO L226 Difference]: Without dead ends: 6792 [2024-11-11 22:54:33,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:54:33,299 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 1061 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1078 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 1366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:33,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1078 Valid, 904 Invalid, 1366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 22:54:33,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6792 states. [2024-11-11 22:54:33,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6792 to 5028. [2024-11-11 22:54:33,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5028 states, 4596 states have (on average 1.536118363794604) internal successors, (7060), 4614 states have internal predecessors, (7060), 313 states have call successors, (313), 103 states have call predecessors, (313), 118 states have return successors, (408), 326 states have call predecessors, (408), 311 states have call successors, (408) [2024-11-11 22:54:33,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5028 states to 5028 states and 7781 transitions. [2024-11-11 22:54:33,622 INFO L78 Accepts]: Start accepts. Automaton has 5028 states and 7781 transitions. Word has length 146 [2024-11-11 22:54:33,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:33,622 INFO L471 AbstractCegarLoop]: Abstraction has 5028 states and 7781 transitions. [2024-11-11 22:54:33,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-11 22:54:33,623 INFO L276 IsEmpty]: Start isEmpty. Operand 5028 states and 7781 transitions. [2024-11-11 22:54:33,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-11 22:54:33,626 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:33,626 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:54:33,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 22:54:33,627 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:33,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:33,627 INFO L85 PathProgramCache]: Analyzing trace with hash 2133921454, now seen corresponding path program 1 times [2024-11-11 22:54:33,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:33,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834277041] [2024-11-11 22:54:33,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:33,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:33,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:54:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:33,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 22:54:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:33,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 22:54:33,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:33,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 22:54:33,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:33,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 22:54:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:33,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:54:33,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:33,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834277041] [2024-11-11 22:54:33,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834277041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:33,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:33,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:54:33,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5498502] [2024-11-11 22:54:33,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:33,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:54:33,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:33,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:54:33,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:54:33,801 INFO L87 Difference]: Start difference. First operand 5028 states and 7781 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-11 22:54:35,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:35,095 INFO L93 Difference]: Finished difference Result 11767 states and 18495 transitions. [2024-11-11 22:54:35,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:54:35,095 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 146 [2024-11-11 22:54:35,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:35,115 INFO L225 Difference]: With dead ends: 11767 [2024-11-11 22:54:35,115 INFO L226 Difference]: Without dead ends: 6757 [2024-11-11 22:54:35,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:54:35,128 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 925 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 1386 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 1449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:35,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [942 Valid, 1079 Invalid, 1449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1386 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 22:54:35,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6757 states. [2024-11-11 22:54:35,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6757 to 5028. [2024-11-11 22:54:35,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5028 states, 4596 states have (on average 1.5324194952132288) internal successors, (7043), 4614 states have internal predecessors, (7043), 313 states have call successors, (313), 103 states have call predecessors, (313), 118 states have return successors, (408), 326 states have call predecessors, (408), 311 states have call successors, (408) [2024-11-11 22:54:35,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5028 states to 5028 states and 7764 transitions. [2024-11-11 22:54:35,410 INFO L78 Accepts]: Start accepts. Automaton has 5028 states and 7764 transitions. Word has length 146 [2024-11-11 22:54:35,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:35,410 INFO L471 AbstractCegarLoop]: Abstraction has 5028 states and 7764 transitions. [2024-11-11 22:54:35,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-11 22:54:35,410 INFO L276 IsEmpty]: Start isEmpty. Operand 5028 states and 7764 transitions. [2024-11-11 22:54:35,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-11 22:54:35,414 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:35,414 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:54:35,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 22:54:35,414 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:35,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:35,414 INFO L85 PathProgramCache]: Analyzing trace with hash 851749168, now seen corresponding path program 1 times [2024-11-11 22:54:35,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:35,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306739358] [2024-11-11 22:54:35,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:35,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:35,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:35,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:54:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:35,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 22:54:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:35,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 22:54:35,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:35,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 22:54:35,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:35,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 22:54:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:35,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:54:35,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:35,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306739358] [2024-11-11 22:54:35,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306739358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:35,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:35,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:54:35,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791175857] [2024-11-11 22:54:35,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:35,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:54:35,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:35,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:54:35,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:54:35,585 INFO L87 Difference]: Start difference. First operand 5028 states and 7764 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-11 22:54:38,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:38,321 INFO L93 Difference]: Finished difference Result 17823 states and 27874 transitions. [2024-11-11 22:54:38,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:54:38,321 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 146 [2024-11-11 22:54:38,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:38,362 INFO L225 Difference]: With dead ends: 17823 [2024-11-11 22:54:38,363 INFO L226 Difference]: Without dead ends: 12813 [2024-11-11 22:54:38,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:54:38,380 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 1248 mSDsluCounter, 1665 mSDsCounter, 0 mSdLazyCounter, 2695 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1264 SdHoareTripleChecker+Valid, 2149 SdHoareTripleChecker+Invalid, 2756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:38,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1264 Valid, 2149 Invalid, 2756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2695 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-11 22:54:38,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12813 states. [2024-11-11 22:54:38,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12813 to 9785. [2024-11-11 22:54:38,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9785 states, 8953 states have (on average 1.5295431698871886) internal successors, (13694), 8987 states have internal predecessors, (13694), 601 states have call successors, (601), 199 states have call predecessors, (601), 230 states have return successors, (874), 630 states have call predecessors, (874), 599 states have call successors, (874) [2024-11-11 22:54:38,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9785 states to 9785 states and 15169 transitions. [2024-11-11 22:54:38,952 INFO L78 Accepts]: Start accepts. Automaton has 9785 states and 15169 transitions. Word has length 146 [2024-11-11 22:54:38,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:38,953 INFO L471 AbstractCegarLoop]: Abstraction has 9785 states and 15169 transitions. [2024-11-11 22:54:38,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-11 22:54:38,954 INFO L276 IsEmpty]: Start isEmpty. Operand 9785 states and 15169 transitions. [2024-11-11 22:54:38,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-11 22:54:38,959 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:38,959 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:54:38,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 22:54:38,960 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:38,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:38,961 INFO L85 PathProgramCache]: Analyzing trace with hash -990726546, now seen corresponding path program 1 times [2024-11-11 22:54:38,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:38,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424265795] [2024-11-11 22:54:38,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:38,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:39,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:54:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:39,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 22:54:39,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:39,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 22:54:39,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:39,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 22:54:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:39,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 22:54:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:39,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:54:39,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:39,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424265795] [2024-11-11 22:54:39,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424265795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:39,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:39,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:54:39,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129618555] [2024-11-11 22:54:39,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:39,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:54:39,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:39,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:54:39,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:54:39,111 INFO L87 Difference]: Start difference. First operand 9785 states and 15169 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-11 22:54:40,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:40,857 INFO L93 Difference]: Finished difference Result 22717 states and 35760 transitions. [2024-11-11 22:54:40,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:54:40,858 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 146 [2024-11-11 22:54:40,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:40,907 INFO L225 Difference]: With dead ends: 22717 [2024-11-11 22:54:40,907 INFO L226 Difference]: Without dead ends: 12950 [2024-11-11 22:54:40,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:54:40,934 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 966 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 1293 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 983 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:40,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [983 Valid, 1078 Invalid, 1357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1293 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 22:54:40,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12950 states. [2024-11-11 22:54:41,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12950 to 9785. [2024-11-11 22:54:41,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9785 states, 8953 states have (on average 1.525857254551547) internal successors, (13661), 8987 states have internal predecessors, (13661), 601 states have call successors, (601), 199 states have call predecessors, (601), 230 states have return successors, (874), 630 states have call predecessors, (874), 599 states have call successors, (874) [2024-11-11 22:54:41,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9785 states to 9785 states and 15136 transitions. [2024-11-11 22:54:41,562 INFO L78 Accepts]: Start accepts. Automaton has 9785 states and 15136 transitions. Word has length 146 [2024-11-11 22:54:41,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:41,563 INFO L471 AbstractCegarLoop]: Abstraction has 9785 states and 15136 transitions. [2024-11-11 22:54:41,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-11 22:54:41,563 INFO L276 IsEmpty]: Start isEmpty. Operand 9785 states and 15136 transitions. [2024-11-11 22:54:41,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-11 22:54:41,569 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:41,569 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:54:41,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 22:54:41,570 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:41,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:41,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1582238064, now seen corresponding path program 1 times [2024-11-11 22:54:41,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:41,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307258242] [2024-11-11 22:54:41,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:41,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:41,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:54:41,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:41,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 22:54:41,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:41,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 22:54:41,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:41,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 22:54:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:41,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 22:54:41,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:41,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:54:41,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:41,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307258242] [2024-11-11 22:54:41,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307258242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:41,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:41,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:54:41,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426710131] [2024-11-11 22:54:41,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:41,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:54:41,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:41,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:54:41,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:54:41,744 INFO L87 Difference]: Start difference. First operand 9785 states and 15136 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-11 22:54:45,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:45,471 INFO L93 Difference]: Finished difference Result 39106 states and 61041 transitions. [2024-11-11 22:54:45,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 22:54:45,471 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 146 [2024-11-11 22:54:45,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:45,574 INFO L225 Difference]: With dead ends: 39106 [2024-11-11 22:54:45,575 INFO L226 Difference]: Without dead ends: 29339 [2024-11-11 22:54:45,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:54:45,604 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 1609 mSDsluCounter, 1657 mSDsCounter, 0 mSdLazyCounter, 2650 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1635 SdHoareTripleChecker+Valid, 2139 SdHoareTripleChecker+Invalid, 2714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 2650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:45,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1635 Valid, 2139 Invalid, 2714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 2650 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-11 22:54:45,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29339 states. [2024-11-11 22:54:46,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29339 to 19261. [2024-11-11 22:54:46,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19261 states, 17661 states have (on average 1.525111828322292) internal successors, (26935), 17727 states have internal predecessors, (26935), 1145 states have call successors, (1145), 391 states have call predecessors, (1145), 454 states have return successors, (1936), 1206 states have call predecessors, (1936), 1143 states have call successors, (1936) [2024-11-11 22:54:46,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19261 states to 19261 states and 30016 transitions. [2024-11-11 22:54:46,878 INFO L78 Accepts]: Start accepts. Automaton has 19261 states and 30016 transitions. Word has length 146 [2024-11-11 22:54:46,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:46,879 INFO L471 AbstractCegarLoop]: Abstraction has 19261 states and 30016 transitions. [2024-11-11 22:54:46,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-11 22:54:46,879 INFO L276 IsEmpty]: Start isEmpty. Operand 19261 states and 30016 transitions. [2024-11-11 22:54:46,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-11 22:54:46,889 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:46,889 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:54:46,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 22:54:46,889 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:46,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:46,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1249594926, now seen corresponding path program 1 times [2024-11-11 22:54:46,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:46,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245535761] [2024-11-11 22:54:46,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:46,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:46,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:54:46,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:46,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 22:54:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:47,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 22:54:47,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:47,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 22:54:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:47,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 22:54:47,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:47,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:54:47,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:47,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245535761] [2024-11-11 22:54:47,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245535761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:47,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:47,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:54:47,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119611914] [2024-11-11 22:54:47,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:47,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:54:47,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:47,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:54:47,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:54:47,048 INFO L87 Difference]: Start difference. First operand 19261 states and 30016 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-11 22:54:52,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:52,673 INFO L93 Difference]: Finished difference Result 76360 states and 120043 transitions. [2024-11-11 22:54:52,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 22:54:52,675 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 146 [2024-11-11 22:54:52,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:52,841 INFO L225 Difference]: With dead ends: 76360 [2024-11-11 22:54:52,841 INFO L226 Difference]: Without dead ends: 57117 [2024-11-11 22:54:52,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:54:52,885 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 1321 mSDsluCounter, 1654 mSDsCounter, 0 mSdLazyCounter, 3190 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1336 SdHoareTripleChecker+Valid, 2135 SdHoareTripleChecker+Invalid, 3253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:52,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1336 Valid, 2135 Invalid, 3253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3190 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-11 22:54:52,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57117 states. [2024-11-11 22:54:55,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57117 to 37538. [2024-11-11 22:54:55,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37538 states, 34434 states have (on average 1.5205029912295986) internal successors, (52357), 34564 states have internal predecessors, (52357), 2201 states have call successors, (2201), 775 states have call predecessors, (2201), 902 states have return successors, (4514), 2326 states have call predecessors, (4514), 2199 states have call successors, (4514) [2024-11-11 22:54:55,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37538 states to 37538 states and 59072 transitions. [2024-11-11 22:54:55,436 INFO L78 Accepts]: Start accepts. Automaton has 37538 states and 59072 transitions. Word has length 146 [2024-11-11 22:54:55,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:55,436 INFO L471 AbstractCegarLoop]: Abstraction has 37538 states and 59072 transitions. [2024-11-11 22:54:55,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-11 22:54:55,437 INFO L276 IsEmpty]: Start isEmpty. Operand 37538 states and 59072 transitions. [2024-11-11 22:54:55,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-11 22:54:55,455 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:55,456 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:54:55,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 22:54:55,456 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:55,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:55,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1116440144, now seen corresponding path program 1 times [2024-11-11 22:54:55,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:55,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741094739] [2024-11-11 22:54:55,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:55,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:55,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:54:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:55,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 22:54:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:55,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 22:54:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:55,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 22:54:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:55,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 22:54:55,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:55,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:54:55,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:55,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741094739] [2024-11-11 22:54:55,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741094739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:55,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:55,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:54:55,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655747016] [2024-11-11 22:54:55,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:55,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:54:55,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:55,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:54:55,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:54:55,624 INFO L87 Difference]: Start difference. First operand 37538 states and 59072 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-11 22:55:04,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:55:04,773 INFO L93 Difference]: Finished difference Result 147763 states and 234581 transitions. [2024-11-11 22:55:04,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 22:55:04,773 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 146 [2024-11-11 22:55:04,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:55:05,417 INFO L225 Difference]: With dead ends: 147763 [2024-11-11 22:55:05,418 INFO L226 Difference]: Without dead ends: 110243 [2024-11-11 22:55:05,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:55:05,512 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 1529 mSDsluCounter, 1657 mSDsCounter, 0 mSdLazyCounter, 2624 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1555 SdHoareTripleChecker+Valid, 2139 SdHoareTripleChecker+Invalid, 2688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 2624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:55:05,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1555 Valid, 2139 Invalid, 2688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 2624 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-11 22:55:05,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110243 states. [2024-11-11 22:55:11,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110243 to 74667. [2024-11-11 22:55:11,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74667 states, 68619 states have (on average 1.5216630962269926) internal successors, (104415), 68877 states have internal predecessors, (104415), 4249 states have call successors, (4249), 1543 states have call predecessors, (4249), 1798 states have return successors, (11064), 4502 states have call predecessors, (11064), 4247 states have call successors, (11064) [2024-11-11 22:55:11,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74667 states to 74667 states and 119728 transitions. [2024-11-11 22:55:11,533 INFO L78 Accepts]: Start accepts. Automaton has 74667 states and 119728 transitions. Word has length 146 [2024-11-11 22:55:11,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:55:11,534 INFO L471 AbstractCegarLoop]: Abstraction has 74667 states and 119728 transitions. [2024-11-11 22:55:11,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-11 22:55:11,534 INFO L276 IsEmpty]: Start isEmpty. Operand 74667 states and 119728 transitions. [2024-11-11 22:55:11,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-11 22:55:11,569 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:55:11,569 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:55:11,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-11 22:55:11,569 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:55:11,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:55:11,570 INFO L85 PathProgramCache]: Analyzing trace with hash 885446126, now seen corresponding path program 1 times [2024-11-11 22:55:11,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:55:11,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171556908] [2024-11-11 22:55:11,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:55:11,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:55:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:11,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:55:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:11,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 22:55:11,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:11,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 22:55:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:11,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 22:55:11,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:11,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 22:55:11,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:55:11,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:55:11,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:55:11,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171556908] [2024-11-11 22:55:11,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171556908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:55:11,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:55:11,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:55:11,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716911619] [2024-11-11 22:55:11,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:55:11,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:55:11,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:55:11,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:55:11,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:55:11,751 INFO L87 Difference]: Start difference. First operand 74667 states and 119728 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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)