./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.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 cb07c62e0c8f9c002ab72b797de071664dce20871b109c1b4c0b79acbb73493c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 05:10:38,702 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 05:10:38,782 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 05:10:38,789 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 05:10:38,793 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 05:10:38,825 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 05:10:38,826 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 05:10:38,826 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 05:10:38,827 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 05:10:38,828 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 05:10:38,828 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 05:10:38,829 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 05:10:38,829 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 05:10:38,830 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 05:10:38,830 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 05:10:38,832 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 05:10:38,832 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 05:10:38,832 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 05:10:38,832 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 05:10:38,833 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 05:10:38,833 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 05:10:38,837 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 05:10:38,837 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 05:10:38,837 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 05:10:38,837 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 05:10:38,838 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 05:10:38,838 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 05:10:38,838 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 05:10:38,838 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 05:10:38,839 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 05:10:38,839 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 05:10:38,839 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 05:10:38,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:10:38,839 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 05:10:38,840 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 05:10:38,840 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 05:10:38,840 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 05:10:38,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 05:10:38,841 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 05:10:38,841 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 05:10:38,841 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 05:10:38,842 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 05:10:38,842 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 -> cb07c62e0c8f9c002ab72b797de071664dce20871b109c1b4c0b79acbb73493c [2024-10-14 05:10:39,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 05:10:39,098 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 05:10:39,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 05:10:39,102 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 05:10:39,103 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 05:10:39,104 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-2.c [2024-10-14 05:10:40,623 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 05:10:40,857 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 05:10:40,861 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-2.c [2024-10-14 05:10:40,885 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15341c506/20c8e36fe92146a8a43efcea59d3578f/FLAG65bd5a2c2 [2024-10-14 05:10:40,902 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15341c506/20c8e36fe92146a8a43efcea59d3578f [2024-10-14 05:10:40,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 05:10:40,905 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 05:10:40,906 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 05:10:40,906 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 05:10:40,911 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 05:10:40,912 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:10:40" (1/1) ... [2024-10-14 05:10:40,912 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c9e02f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:40, skipping insertion in model container [2024-10-14 05:10:40,913 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:10:40" (1/1) ... [2024-10-14 05:10:40,958 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 05:10:41,115 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-2.c[913,926] [2024-10-14 05:10:41,164 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-2.c[5977,5990] [2024-10-14 05:10:41,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:10:41,315 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 05:10:41,332 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-2.c[913,926] [2024-10-14 05:10:41,355 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-2.c[5977,5990] [2024-10-14 05:10:41,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:10:41,442 INFO L204 MainTranslator]: Completed translation [2024-10-14 05:10:41,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:41 WrapperNode [2024-10-14 05:10:41,443 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 05:10:41,444 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 05:10:41,444 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 05:10:41,444 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 05:10:41,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:41" (1/1) ... [2024-10-14 05:10:41,473 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:41" (1/1) ... [2024-10-14 05:10:41,524 INFO L138 Inliner]: procedures = 72, calls = 84, calls flagged for inlining = 47, calls inlined = 47, statements flattened = 1083 [2024-10-14 05:10:41,525 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 05:10:41,525 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 05:10:41,526 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 05:10:41,526 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 05:10:41,540 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:41" (1/1) ... [2024-10-14 05:10:41,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:41" (1/1) ... [2024-10-14 05:10:41,545 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:41" (1/1) ... [2024-10-14 05:10:41,575 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 05:10:41,580 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:41" (1/1) ... [2024-10-14 05:10:41,583 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:41" (1/1) ... [2024-10-14 05:10:41,604 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:41" (1/1) ... [2024-10-14 05:10:41,626 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:41" (1/1) ... [2024-10-14 05:10:41,629 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:41" (1/1) ... [2024-10-14 05:10:41,633 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:41" (1/1) ... [2024-10-14 05:10:41,666 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 05:10:41,667 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 05:10:41,667 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 05:10:41,667 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 05:10:41,668 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:41" (1/1) ... [2024-10-14 05:10:41,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:10:41,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:10:41,749 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 05:10:41,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 05:10:41,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 05:10:41,801 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-14 05:10:41,801 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-14 05:10:41,801 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-10-14 05:10:41,803 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-10-14 05:10:41,803 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-14 05:10:41,803 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-14 05:10:41,803 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-14 05:10:41,803 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-14 05:10:41,804 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-14 05:10:41,804 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-14 05:10:41,804 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-14 05:10:41,804 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-14 05:10:41,804 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-14 05:10:41,804 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-14 05:10:41,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 05:10:41,805 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-14 05:10:41,805 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-14 05:10:41,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 05:10:41,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 05:10:41,805 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-14 05:10:41,805 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-14 05:10:41,962 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 05:10:41,965 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 05:10:43,048 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2024-10-14 05:10:43,048 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 05:10:43,128 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 05:10:43,128 INFO L314 CfgBuilder]: Removed 19 assume(true) statements. [2024-10-14 05:10:43,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:10:43 BoogieIcfgContainer [2024-10-14 05:10:43,129 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 05:10:43,135 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 05:10:43,135 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 05:10:43,139 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 05:10:43,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:10:40" (1/3) ... [2024-10-14 05:10:43,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d3427f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:10:43, skipping insertion in model container [2024-10-14 05:10:43,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:10:41" (2/3) ... [2024-10-14 05:10:43,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d3427f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:10:43, skipping insertion in model container [2024-10-14 05:10:43,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:10:43" (3/3) ... [2024-10-14 05:10:43,141 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.12.cil-2.c [2024-10-14 05:10:43,158 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 05:10:43,159 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 05:10:43,230 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 05:10:43,236 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;@e0bae90, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 05:10:43,237 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 05:10:43,245 INFO L276 IsEmpty]: Start isEmpty. Operand has 411 states, 367 states have (on average 1.7247956403269755) internal successors, (633), 372 states have internal predecessors, (633), 32 states have call successors, (32), 9 states have call predecessors, (32), 9 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 05:10:43,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-14 05:10:43,256 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:43,256 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:43,257 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:43,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:43,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1061080809, now seen corresponding path program 1 times [2024-10-14 05:10:43,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:43,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381594202] [2024-10-14 05:10:43,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:43,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:43,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:43,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:10:43,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:43,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:10:43,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:43,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:10:43,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:43,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381594202] [2024-10-14 05:10:43,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381594202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:43,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:43,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:10:43,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136657321] [2024-10-14 05:10:43,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:43,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:10:43,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:43,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:10:43,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:10:43,648 INFO L87 Difference]: Start difference. First operand has 411 states, 367 states have (on average 1.7247956403269755) internal successors, (633), 372 states have internal predecessors, (633), 32 states have call successors, (32), 9 states have call predecessors, (32), 9 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 05:10:44,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:44,422 INFO L93 Difference]: Finished difference Result 863 states and 1458 transitions. [2024-10-14 05:10:44,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:10:44,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2024-10-14 05:10:44,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:44,446 INFO L225 Difference]: With dead ends: 863 [2024-10-14 05:10:44,449 INFO L226 Difference]: Without dead ends: 469 [2024-10-14 05:10:44,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:10:44,460 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 886 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:44,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 696 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 05:10:44,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-10-14 05:10:44,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 463. [2024-10-14 05:10:44,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 414 states have (on average 1.5893719806763285) internal successors, (658), 418 states have internal predecessors, (658), 36 states have call successors, (36), 11 states have call predecessors, (36), 11 states have return successors, (40), 34 states have call predecessors, (40), 34 states have call successors, (40) [2024-10-14 05:10:44,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 734 transitions. [2024-10-14 05:10:44,570 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 734 transitions. Word has length 37 [2024-10-14 05:10:44,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:44,571 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 734 transitions. [2024-10-14 05:10:44,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 05:10:44,572 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 734 transitions. [2024-10-14 05:10:44,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 05:10:44,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:44,575 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:44,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 05:10:44,576 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:44,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:44,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1285072114, now seen corresponding path program 1 times [2024-10-14 05:10:44,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:44,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811629817] [2024-10-14 05:10:44,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:44,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:44,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:44,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:10:44,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:44,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 05:10:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:44,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:10:44,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:44,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811629817] [2024-10-14 05:10:44,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811629817] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:44,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:44,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:10:44,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302150363] [2024-10-14 05:10:44,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:44,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:10:44,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:44,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:10:44,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:10:44,729 INFO L87 Difference]: Start difference. First operand 463 states and 734 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 05:10:45,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:45,285 INFO L93 Difference]: Finished difference Result 697 states and 1078 transitions. [2024-10-14 05:10:45,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:10:45,285 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2024-10-14 05:10:45,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:45,291 INFO L225 Difference]: With dead ends: 697 [2024-10-14 05:10:45,292 INFO L226 Difference]: Without dead ends: 586 [2024-10-14 05:10:45,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:10:45,294 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 899 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:45,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 697 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 05:10:45,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2024-10-14 05:10:45,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 563. [2024-10-14 05:10:45,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 501 states have (on average 1.5489021956087825) internal successors, (776), 506 states have internal predecessors, (776), 44 states have call successors, (44), 15 states have call predecessors, (44), 16 states have return successors, (54), 42 states have call predecessors, (54), 42 states have call successors, (54) [2024-10-14 05:10:45,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 874 transitions. [2024-10-14 05:10:45,347 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 874 transitions. Word has length 38 [2024-10-14 05:10:45,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:45,347 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 874 transitions. [2024-10-14 05:10:45,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 05:10:45,348 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 874 transitions. [2024-10-14 05:10:45,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-14 05:10:45,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:45,352 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:45,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 05:10:45,353 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:45,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:45,354 INFO L85 PathProgramCache]: Analyzing trace with hash -652138764, now seen corresponding path program 1 times [2024-10-14 05:10:45,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:45,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491406466] [2024-10-14 05:10:45,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:45,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:45,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:10:45,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:45,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 05:10:45,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:45,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:10:45,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:45,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491406466] [2024-10-14 05:10:45,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491406466] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:45,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:45,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:10:45,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801813734] [2024-10-14 05:10:45,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:45,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:10:45,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:45,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:10:45,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:10:45,424 INFO L87 Difference]: Start difference. First operand 563 states and 874 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 05:10:46,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:46,089 INFO L93 Difference]: Finished difference Result 983 states and 1455 transitions. [2024-10-14 05:10:46,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:10:46,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2024-10-14 05:10:46,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:46,094 INFO L225 Difference]: With dead ends: 983 [2024-10-14 05:10:46,094 INFO L226 Difference]: Without dead ends: 772 [2024-10-14 05:10:46,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:10:46,096 INFO L432 NwaCegarLoop]: 391 mSDtfsCounter, 346 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:46,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 987 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 05:10:46,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2024-10-14 05:10:46,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 668. [2024-10-14 05:10:46,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 594 states have (on average 1.5235690235690236) internal successors, (905), 601 states have internal predecessors, (905), 50 states have call successors, (50), 21 states have call predecessors, (50), 22 states have return successors, (60), 46 states have call predecessors, (60), 48 states have call successors, (60) [2024-10-14 05:10:46,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 1015 transitions. [2024-10-14 05:10:46,143 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 1015 transitions. Word has length 39 [2024-10-14 05:10:46,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:46,143 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 1015 transitions. [2024-10-14 05:10:46,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 05:10:46,144 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 1015 transitions. [2024-10-14 05:10:46,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-14 05:10:46,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:46,146 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:46,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 05:10:46,147 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:46,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:46,151 INFO L85 PathProgramCache]: Analyzing trace with hash 2082821182, now seen corresponding path program 1 times [2024-10-14 05:10:46,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:46,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085663433] [2024-10-14 05:10:46,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:46,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:46,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:46,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:10:46,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:46,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 05:10:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:46,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:10:46,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:46,273 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 05:10:46,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:46,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085663433] [2024-10-14 05:10:46,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085663433] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:46,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:46,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:10:46,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467923057] [2024-10-14 05:10:46,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:46,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:10:46,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:46,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:10:46,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:10:46,279 INFO L87 Difference]: Start difference. First operand 668 states and 1015 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 05:10:46,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:46,908 INFO L93 Difference]: Finished difference Result 1184 states and 1732 transitions. [2024-10-14 05:10:46,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:10:46,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 54 [2024-10-14 05:10:46,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:46,915 INFO L225 Difference]: With dead ends: 1184 [2024-10-14 05:10:46,915 INFO L226 Difference]: Without dead ends: 868 [2024-10-14 05:10:46,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:10:46,920 INFO L432 NwaCegarLoop]: 410 mSDtfsCounter, 331 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:46,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 1031 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 05:10:46,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2024-10-14 05:10:46,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 834. [2024-10-14 05:10:46,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 736 states have (on average 1.46875) internal successors, (1081), 745 states have internal predecessors, (1081), 64 states have call successors, (64), 29 states have call predecessors, (64), 32 states have return successors, (84), 60 states have call predecessors, (84), 62 states have call successors, (84) [2024-10-14 05:10:46,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1229 transitions. [2024-10-14 05:10:46,970 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1229 transitions. Word has length 54 [2024-10-14 05:10:46,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:46,971 INFO L471 AbstractCegarLoop]: Abstraction has 834 states and 1229 transitions. [2024-10-14 05:10:46,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 05:10:46,972 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1229 transitions. [2024-10-14 05:10:46,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 05:10:46,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:46,978 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:46,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 05:10:46,978 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:46,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:46,979 INFO L85 PathProgramCache]: Analyzing trace with hash -775611185, now seen corresponding path program 1 times [2024-10-14 05:10:46,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:46,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207406964] [2024-10-14 05:10:46,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:46,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:46,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:47,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:10:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:47,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:10:47,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:47,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:10:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:47,053 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 05:10:47,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:47,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207406964] [2024-10-14 05:10:47,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207406964] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:47,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:47,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:10:47,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304356558] [2024-10-14 05:10:47,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:47,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:10:47,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:47,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:10:47,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:10:47,056 INFO L87 Difference]: Start difference. First operand 834 states and 1229 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 05:10:47,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:47,590 INFO L93 Difference]: Finished difference Result 1413 states and 2008 transitions. [2024-10-14 05:10:47,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:10:47,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2024-10-14 05:10:47,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:47,599 INFO L225 Difference]: With dead ends: 1413 [2024-10-14 05:10:47,600 INFO L226 Difference]: Without dead ends: 1011 [2024-10-14 05:10:47,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:10:47,603 INFO L432 NwaCegarLoop]: 365 mSDtfsCounter, 885 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:47,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 709 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 05:10:47,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2024-10-14 05:10:47,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 962. [2024-10-14 05:10:47,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 848 states have (on average 1.4339622641509433) internal successors, (1216), 859 states have internal predecessors, (1216), 72 states have call successors, (72), 35 states have call predecessors, (72), 40 states have return successors, (98), 68 states have call predecessors, (98), 70 states have call successors, (98) [2024-10-14 05:10:47,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1386 transitions. [2024-10-14 05:10:47,656 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1386 transitions. Word has length 59 [2024-10-14 05:10:47,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:47,657 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1386 transitions. [2024-10-14 05:10:47,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 05:10:47,658 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1386 transitions. [2024-10-14 05:10:47,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 05:10:47,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:47,660 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:47,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 05:10:47,660 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:47,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:47,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1102984900, now seen corresponding path program 1 times [2024-10-14 05:10:47,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:47,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155822571] [2024-10-14 05:10:47,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:47,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:47,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:47,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:10:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:47,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:10:47,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:47,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:10:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:47,796 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 05:10:47,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:47,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155822571] [2024-10-14 05:10:47,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155822571] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:10:47,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584853589] [2024-10-14 05:10:47,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:47,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:10:47,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:10:47,802 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:10:47,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 05:10:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:47,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 05:10:47,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:10:47,954 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 05:10:47,954 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:10:47,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584853589] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:47,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:10:47,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-14 05:10:47,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799948108] [2024-10-14 05:10:47,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:47,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:10:47,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:47,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:10:47,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:10:47,957 INFO L87 Difference]: Start difference. First operand 962 states and 1386 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 05:10:48,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:48,105 INFO L93 Difference]: Finished difference Result 1450 states and 2060 transitions. [2024-10-14 05:10:48,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 05:10:48,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-10-14 05:10:48,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:48,111 INFO L225 Difference]: With dead ends: 1450 [2024-10-14 05:10:48,112 INFO L226 Difference]: Without dead ends: 967 [2024-10-14 05:10:48,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:10:48,115 INFO L432 NwaCegarLoop]: 598 mSDtfsCounter, 0 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:48,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1789 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:10:48,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2024-10-14 05:10:48,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 967. [2024-10-14 05:10:48,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 853 states have (on average 1.422039859320047) internal successors, (1213), 864 states have internal predecessors, (1213), 72 states have call successors, (72), 35 states have call predecessors, (72), 40 states have return successors, (98), 68 states have call predecessors, (98), 70 states have call successors, (98) [2024-10-14 05:10:48,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1383 transitions. [2024-10-14 05:10:48,165 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1383 transitions. Word has length 60 [2024-10-14 05:10:48,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:48,166 INFO L471 AbstractCegarLoop]: Abstraction has 967 states and 1383 transitions. [2024-10-14 05:10:48,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 05:10:48,166 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1383 transitions. [2024-10-14 05:10:48,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 05:10:48,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:48,168 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:48,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 05:10:48,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-14 05:10:48,369 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:48,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:48,370 INFO L85 PathProgramCache]: Analyzing trace with hash 258979398, now seen corresponding path program 1 times [2024-10-14 05:10:48,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:48,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220425715] [2024-10-14 05:10:48,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:48,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:48,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:10:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:48,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:10:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:48,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:10:48,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:48,446 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 05:10:48,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:48,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220425715] [2024-10-14 05:10:48,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220425715] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:10:48,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535797743] [2024-10-14 05:10:48,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:48,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:10:48,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:10:48,449 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:10:48,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 05:10:48,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:48,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 05:10:48,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:10:48,579 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 05:10:48,580 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:10:48,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535797743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:48,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:10:48,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-14 05:10:48,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209639131] [2024-10-14 05:10:48,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:48,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:10:48,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:48,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:10:48,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:10:48,582 INFO L87 Difference]: Start difference. First operand 967 states and 1383 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 05:10:48,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:48,750 INFO L93 Difference]: Finished difference Result 1393 states and 1962 transitions. [2024-10-14 05:10:48,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 05:10:48,751 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-10-14 05:10:48,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:48,756 INFO L225 Difference]: With dead ends: 1393 [2024-10-14 05:10:48,756 INFO L226 Difference]: Without dead ends: 864 [2024-10-14 05:10:48,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:10:48,759 INFO L432 NwaCegarLoop]: 598 mSDtfsCounter, 0 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:48,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1789 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:10:48,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2024-10-14 05:10:48,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 857. [2024-10-14 05:10:48,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 761 states have (on average 1.4323258869908015) internal successors, (1090), 770 states have internal predecessors, (1090), 62 states have call successors, (62), 29 states have call predecessors, (62), 32 states have return successors, (79), 58 states have call predecessors, (79), 60 states have call successors, (79) [2024-10-14 05:10:48,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1231 transitions. [2024-10-14 05:10:48,805 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1231 transitions. Word has length 60 [2024-10-14 05:10:48,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:48,807 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1231 transitions. [2024-10-14 05:10:48,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 05:10:48,808 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1231 transitions. [2024-10-14 05:10:48,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 05:10:48,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:48,810 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:48,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 05:10:49,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-14 05:10:49,011 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:49,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:49,012 INFO L85 PathProgramCache]: Analyzing trace with hash 2056619014, now seen corresponding path program 1 times [2024-10-14 05:10:49,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:49,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896960674] [2024-10-14 05:10:49,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:49,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:49,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:10:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:49,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:10:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:49,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:10:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:49,095 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 05:10:49,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:49,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896960674] [2024-10-14 05:10:49,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896960674] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:49,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:49,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 05:10:49,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596683616] [2024-10-14 05:10:49,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:49,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 05:10:49,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:49,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 05:10:49,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:10:49,097 INFO L87 Difference]: Start difference. First operand 857 states and 1231 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 05:10:49,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:49,660 INFO L93 Difference]: Finished difference Result 942 states and 1334 transitions. [2024-10-14 05:10:49,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 05:10:49,663 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 60 [2024-10-14 05:10:49,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:49,667 INFO L225 Difference]: With dead ends: 942 [2024-10-14 05:10:49,668 INFO L226 Difference]: Without dead ends: 939 [2024-10-14 05:10:49,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:10:49,669 INFO L432 NwaCegarLoop]: 377 mSDtfsCounter, 1481 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1483 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:49,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1483 Valid, 706 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 05:10:49,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2024-10-14 05:10:49,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 856. [2024-10-14 05:10:49,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 761 states have (on average 1.4296977660972405) internal successors, (1088), 769 states have internal predecessors, (1088), 61 states have call successors, (61), 29 states have call predecessors, (61), 32 states have return successors, (79), 58 states have call predecessors, (79), 60 states have call successors, (79) [2024-10-14 05:10:49,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1228 transitions. [2024-10-14 05:10:49,722 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1228 transitions. Word has length 60 [2024-10-14 05:10:49,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:49,724 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1228 transitions. [2024-10-14 05:10:49,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 05:10:49,724 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1228 transitions. [2024-10-14 05:10:49,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 05:10:49,725 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:49,725 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:49,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 05:10:49,726 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:49,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:49,726 INFO L85 PathProgramCache]: Analyzing trace with hash -670725648, now seen corresponding path program 1 times [2024-10-14 05:10:49,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:49,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667855538] [2024-10-14 05:10:49,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:49,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:49,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:49,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:10:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:49,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:10:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:49,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:10:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:49,933 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 05:10:49,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:49,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667855538] [2024-10-14 05:10:49,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667855538] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:10:49,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370145751] [2024-10-14 05:10:49,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:49,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:10:49,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:10:49,939 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:10:49,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 05:10:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:50,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 05:10:50,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:10:50,261 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:10:50,261 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 05:10:50,323 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 05:10:50,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370145751] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 05:10:50,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 05:10:50,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 8 [2024-10-14 05:10:50,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202583641] [2024-10-14 05:10:50,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 05:10:50,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:10:50,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:50,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:10:50,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:10:50,326 INFO L87 Difference]: Start difference. First operand 856 states and 1228 transitions. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-14 05:10:51,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:51,299 INFO L93 Difference]: Finished difference Result 1659 states and 2263 transitions. [2024-10-14 05:10:51,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 05:10:51,300 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 61 [2024-10-14 05:10:51,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:51,307 INFO L225 Difference]: With dead ends: 1659 [2024-10-14 05:10:51,307 INFO L226 Difference]: Without dead ends: 1656 [2024-10-14 05:10:51,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-14 05:10:51,308 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 1081 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1114 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:51,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1114 Valid, 1646 Invalid, 1313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 05:10:51,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2024-10-14 05:10:51,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1159. [2024-10-14 05:10:51,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 1028 states have (on average 1.394941634241245) internal successors, (1434), 1042 states have internal predecessors, (1434), 80 states have call successors, (80), 42 states have call predecessors, (80), 49 states have return successors, (109), 75 states have call predecessors, (109), 79 states have call successors, (109) [2024-10-14 05:10:51,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1623 transitions. [2024-10-14 05:10:51,365 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1623 transitions. Word has length 61 [2024-10-14 05:10:51,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:51,366 INFO L471 AbstractCegarLoop]: Abstraction has 1159 states and 1623 transitions. [2024-10-14 05:10:51,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-14 05:10:51,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1623 transitions. [2024-10-14 05:10:51,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 05:10:51,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:51,368 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:51,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 05:10:51,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:10:51,570 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:51,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:51,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1722584425, now seen corresponding path program 2 times [2024-10-14 05:10:51,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:51,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708635947] [2024-10-14 05:10:51,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:51,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:51,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:51,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:10:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:51,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:10:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:51,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:10:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:51,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 05:10:51,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:51,624 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-14 05:10:51,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:51,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708635947] [2024-10-14 05:10:51,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708635947] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:51,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:51,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:10:51,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523527862] [2024-10-14 05:10:51,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:51,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:10:51,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:51,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:10:51,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:10:51,627 INFO L87 Difference]: Start difference. First operand 1159 states and 1623 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 05:10:52,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:52,160 INFO L93 Difference]: Finished difference Result 1787 states and 2440 transitions. [2024-10-14 05:10:52,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:10:52,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 78 [2024-10-14 05:10:52,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:52,166 INFO L225 Difference]: With dead ends: 1787 [2024-10-14 05:10:52,166 INFO L226 Difference]: Without dead ends: 1128 [2024-10-14 05:10:52,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:10:52,169 INFO L432 NwaCegarLoop]: 372 mSDtfsCounter, 898 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:52,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 725 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 05:10:52,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2024-10-14 05:10:52,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1051. [2024-10-14 05:10:52,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 933 states have (on average 1.39978563772776) internal successors, (1306), 947 states have internal predecessors, (1306), 73 states have call successors, (73), 37 states have call predecessors, (73), 43 states have return successors, (98), 67 states have call predecessors, (98), 72 states have call successors, (98) [2024-10-14 05:10:52,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1477 transitions. [2024-10-14 05:10:52,221 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1477 transitions. Word has length 78 [2024-10-14 05:10:52,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:52,222 INFO L471 AbstractCegarLoop]: Abstraction has 1051 states and 1477 transitions. [2024-10-14 05:10:52,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 05:10:52,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1477 transitions. [2024-10-14 05:10:52,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 05:10:52,227 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:52,228 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:52,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 05:10:52,228 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:52,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:52,229 INFO L85 PathProgramCache]: Analyzing trace with hash 234886168, now seen corresponding path program 1 times [2024-10-14 05:10:52,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:52,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788196192] [2024-10-14 05:10:52,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:52,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:52,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:10:52,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:52,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:10:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:52,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 05:10:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:52,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 05:10:52,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:52,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 05:10:52,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:52,331 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-14 05:10:52,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:52,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788196192] [2024-10-14 05:10:52,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788196192] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:10:52,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876087676] [2024-10-14 05:10:52,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:52,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:10:52,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:10:52,334 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:10:52,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 05:10:52,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:52,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 05:10:52,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:10:52,491 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 05:10:52,491 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:10:52,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876087676] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:52,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:10:52,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-14 05:10:52,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384312421] [2024-10-14 05:10:52,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:52,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:10:52,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:52,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:10:52,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:10:52,493 INFO L87 Difference]: Start difference. First operand 1051 states and 1477 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 05:10:52,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:52,620 INFO L93 Difference]: Finished difference Result 1334 states and 1833 transitions. [2024-10-14 05:10:52,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:10:52,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 92 [2024-10-14 05:10:52,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:52,624 INFO L225 Difference]: With dead ends: 1334 [2024-10-14 05:10:52,624 INFO L226 Difference]: Without dead ends: 347 [2024-10-14 05:10:52,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:10:52,626 INFO L432 NwaCegarLoop]: 632 mSDtfsCounter, 55 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:52,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 1208 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:10:52,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-10-14 05:10:52,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2024-10-14 05:10:52,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 314 states have (on average 1.6337579617834395) internal successors, (513), 315 states have internal predecessors, (513), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 05:10:52,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 565 transitions. [2024-10-14 05:10:52,647 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 565 transitions. Word has length 92 [2024-10-14 05:10:52,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:52,647 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 565 transitions. [2024-10-14 05:10:52,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 05:10:52,647 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 565 transitions. [2024-10-14 05:10:52,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 05:10:52,649 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:52,649 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:52,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 05:10:52,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:10:52,851 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:52,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:52,851 INFO L85 PathProgramCache]: Analyzing trace with hash 21736103, now seen corresponding path program 1 times [2024-10-14 05:10:52,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:52,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046741623] [2024-10-14 05:10:52,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:52,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:52,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:52,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:10:52,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:53,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:10:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:53,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 05:10:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:53,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 05:10:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:53,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-14 05:10:53,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:53,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:10:53,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:53,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046741623] [2024-10-14 05:10:53,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046741623] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:53,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:53,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 05:10:53,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362528594] [2024-10-14 05:10:53,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:53,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 05:10:53,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:53,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 05:10:53,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:10:53,077 INFO L87 Difference]: Start difference. First operand 347 states and 565 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:54,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:54,718 INFO L93 Difference]: Finished difference Result 819 states and 1356 transitions. [2024-10-14 05:10:54,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 05:10:54,719 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-14 05:10:54,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:54,722 INFO L225 Difference]: With dead ends: 819 [2024-10-14 05:10:54,722 INFO L226 Difference]: Without dead ends: 477 [2024-10-14 05:10:54,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:10:54,724 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 977 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:54,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 622 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 05:10:54,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-10-14 05:10:54,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 347. [2024-10-14 05:10:54,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 314 states have (on average 1.6305732484076434) internal successors, (512), 315 states have internal predecessors, (512), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 05:10:54,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 564 transitions. [2024-10-14 05:10:54,760 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 564 transitions. Word has length 161 [2024-10-14 05:10:54,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:54,760 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 564 transitions. [2024-10-14 05:10:54,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:54,761 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 564 transitions. [2024-10-14 05:10:54,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 05:10:54,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:54,762 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:54,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 05:10:54,763 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:54,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:54,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1791207717, now seen corresponding path program 1 times [2024-10-14 05:10:54,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:54,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727316297] [2024-10-14 05:10:54,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:54,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:54,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:54,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:10:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:54,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:10:54,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:54,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 05:10:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:54,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 05:10:54,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:54,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-14 05:10:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:54,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:10:54,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:54,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727316297] [2024-10-14 05:10:54,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727316297] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:54,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:54,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 05:10:54,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530074482] [2024-10-14 05:10:54,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:54,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 05:10:54,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:54,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 05:10:54,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:10:54,967 INFO L87 Difference]: Start difference. First operand 347 states and 564 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:56,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:56,419 INFO L93 Difference]: Finished difference Result 811 states and 1339 transitions. [2024-10-14 05:10:56,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 05:10:56,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-14 05:10:56,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:56,422 INFO L225 Difference]: With dead ends: 811 [2024-10-14 05:10:56,422 INFO L226 Difference]: Without dead ends: 477 [2024-10-14 05:10:56,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:10:56,424 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 968 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 992 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:56,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [992 Valid, 620 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 05:10:56,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-10-14 05:10:56,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 347. [2024-10-14 05:10:56,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 314 states have (on average 1.627388535031847) internal successors, (511), 315 states have internal predecessors, (511), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 05:10:56,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 563 transitions. [2024-10-14 05:10:56,446 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 563 transitions. Word has length 161 [2024-10-14 05:10:56,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:56,446 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 563 transitions. [2024-10-14 05:10:56,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:56,446 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 563 transitions. [2024-10-14 05:10:56,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 05:10:56,448 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:56,448 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:56,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 05:10:56,448 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:56,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:56,460 INFO L85 PathProgramCache]: Analyzing trace with hash -139917917, now seen corresponding path program 1 times [2024-10-14 05:10:56,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:56,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517402924] [2024-10-14 05:10:56,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:56,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:56,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:56,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:10:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:56,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:10:56,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:56,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 05:10:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:56,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 05:10:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:56,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-14 05:10:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:56,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:10:56,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:56,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517402924] [2024-10-14 05:10:56,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517402924] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:56,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:56,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:10:56,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383737811] [2024-10-14 05:10:56,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:56,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:10:56,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:56,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:10:56,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:10:56,744 INFO L87 Difference]: Start difference. First operand 347 states and 563 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:59,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:59,581 INFO L93 Difference]: Finished difference Result 1282 states and 2129 transitions. [2024-10-14 05:10:59,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:10:59,582 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-14 05:10:59,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:59,585 INFO L225 Difference]: With dead ends: 1282 [2024-10-14 05:10:59,585 INFO L226 Difference]: Without dead ends: 954 [2024-10-14 05:10:59,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:10:59,586 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 1476 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 2297 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1495 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 2405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 2297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:59,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1495 Valid, 1048 Invalid, 2405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 2297 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-14 05:10:59,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2024-10-14 05:10:59,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 695. [2024-10-14 05:10:59,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 634 states have (on average 1.638801261829653) internal successors, (1039), 636 states have internal predecessors, (1039), 47 states have call successors, (47), 12 states have call predecessors, (47), 13 states have return successors, (50), 47 states have call predecessors, (50), 47 states have call successors, (50) [2024-10-14 05:10:59,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1136 transitions. [2024-10-14 05:10:59,631 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1136 transitions. Word has length 161 [2024-10-14 05:10:59,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:10:59,631 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 1136 transitions. [2024-10-14 05:10:59,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:10:59,632 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1136 transitions. [2024-10-14 05:10:59,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 05:10:59,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:10:59,633 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:10:59,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 05:10:59,634 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:10:59,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:10:59,634 INFO L85 PathProgramCache]: Analyzing trace with hash -626700829, now seen corresponding path program 1 times [2024-10-14 05:10:59,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:10:59,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818823656] [2024-10-14 05:10:59,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:10:59,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:10:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:59,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:10:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:59,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:10:59,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:59,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 05:10:59,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:59,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 05:10:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:59,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-14 05:10:59,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:10:59,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:10:59,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:10:59,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818823656] [2024-10-14 05:10:59,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818823656] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:10:59,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:10:59,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:10:59,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755119020] [2024-10-14 05:10:59,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:10:59,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:10:59,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:10:59,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:10:59,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:10:59,946 INFO L87 Difference]: Start difference. First operand 695 states and 1136 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:03,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:03,439 INFO L93 Difference]: Finished difference Result 2127 states and 3535 transitions. [2024-10-14 05:11:03,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:11:03,440 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-14 05:11:03,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:03,446 INFO L225 Difference]: With dead ends: 2127 [2024-10-14 05:11:03,446 INFO L226 Difference]: Without dead ends: 1451 [2024-10-14 05:11:03,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:11:03,450 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 1521 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 3725 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1540 SdHoareTripleChecker+Valid, 1992 SdHoareTripleChecker+Invalid, 3786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:03,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1540 Valid, 1992 Invalid, 3786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3725 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-14 05:11:03,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2024-10-14 05:11:03,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1016. [2024-10-14 05:11:03,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 927 states have (on average 1.6321467098166127) internal successors, (1513), 930 states have internal predecessors, (1513), 68 states have call successors, (68), 18 states have call predecessors, (68), 20 states have return successors, (73), 69 states have call predecessors, (73), 68 states have call successors, (73) [2024-10-14 05:11:03,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1654 transitions. [2024-10-14 05:11:03,524 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1654 transitions. Word has length 161 [2024-10-14 05:11:03,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:03,524 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1654 transitions. [2024-10-14 05:11:03,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:03,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1654 transitions. [2024-10-14 05:11:03,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 05:11:03,526 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:03,527 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:03,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 05:11:03,527 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:03,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:03,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1880396645, now seen corresponding path program 1 times [2024-10-14 05:11:03,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:03,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806745120] [2024-10-14 05:11:03,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:03,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:03,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:03,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:11:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:03,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 05:11:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:03,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 05:11:03,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:03,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-14 05:11:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:03,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:11:03,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:03,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806745120] [2024-10-14 05:11:03,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806745120] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:03,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:03,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:11:03,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067893994] [2024-10-14 05:11:03,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:03,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:11:03,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:03,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:11:03,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:11:03,824 INFO L87 Difference]: Start difference. First operand 1016 states and 1654 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:05,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:05,440 INFO L93 Difference]: Finished difference Result 2466 states and 4095 transitions. [2024-10-14 05:11:05,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:11:05,441 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-14 05:11:05,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:05,447 INFO L225 Difference]: With dead ends: 2466 [2024-10-14 05:11:05,448 INFO L226 Difference]: Without dead ends: 1469 [2024-10-14 05:11:05,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:11:05,451 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 1322 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 1626 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1342 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 1718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:05,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1342 Valid, 861 Invalid, 1718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1626 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 05:11:05,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2024-10-14 05:11:05,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1016. [2024-10-14 05:11:05,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 927 states have (on average 1.62891046386192) internal successors, (1510), 930 states have internal predecessors, (1510), 68 states have call successors, (68), 18 states have call predecessors, (68), 20 states have return successors, (73), 69 states have call predecessors, (73), 68 states have call successors, (73) [2024-10-14 05:11:05,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1651 transitions. [2024-10-14 05:11:05,523 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1651 transitions. Word has length 161 [2024-10-14 05:11:05,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:05,523 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1651 transitions. [2024-10-14 05:11:05,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:05,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1651 transitions. [2024-10-14 05:11:05,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 05:11:05,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:05,525 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:05,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 05:11:05,525 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:05,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:05,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1950044519, now seen corresponding path program 1 times [2024-10-14 05:11:05,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:05,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858324546] [2024-10-14 05:11:05,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:05,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:05,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:05,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:05,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:11:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:05,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 05:11:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:05,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 05:11:05,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:05,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-14 05:11:05,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:05,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:11:05,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:05,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858324546] [2024-10-14 05:11:05,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858324546] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:05,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:05,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:11:05,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108766384] [2024-10-14 05:11:05,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:05,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:11:05,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:05,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:11:05,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:11:05,783 INFO L87 Difference]: Start difference. First operand 1016 states and 1651 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:07,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:07,556 INFO L93 Difference]: Finished difference Result 2462 states and 4078 transitions. [2024-10-14 05:11:07,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:11:07,556 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-14 05:11:07,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:07,563 INFO L225 Difference]: With dead ends: 2462 [2024-10-14 05:11:07,563 INFO L226 Difference]: Without dead ends: 1465 [2024-10-14 05:11:07,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:11:07,566 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 1078 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 1890 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 1955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:07,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1098 Valid, 1024 Invalid, 1955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1890 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 05:11:07,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2024-10-14 05:11:07,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 1016. [2024-10-14 05:11:07,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 927 states have (on average 1.6256742179072277) internal successors, (1507), 930 states have internal predecessors, (1507), 68 states have call successors, (68), 18 states have call predecessors, (68), 20 states have return successors, (73), 69 states have call predecessors, (73), 68 states have call successors, (73) [2024-10-14 05:11:07,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1648 transitions. [2024-10-14 05:11:07,642 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1648 transitions. Word has length 161 [2024-10-14 05:11:07,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:07,643 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1648 transitions. [2024-10-14 05:11:07,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:07,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1648 transitions. [2024-10-14 05:11:07,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 05:11:07,645 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:07,645 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:07,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 05:11:07,645 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:07,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:07,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1927034075, now seen corresponding path program 1 times [2024-10-14 05:11:07,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:07,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309835322] [2024-10-14 05:11:07,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:07,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:07,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:07,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:11:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:07,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 05:11:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:07,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 05:11:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:07,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-14 05:11:07,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:07,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:11:07,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:07,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309835322] [2024-10-14 05:11:07,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309835322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:07,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:07,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:11:07,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054243656] [2024-10-14 05:11:07,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:07,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:11:07,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:07,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:11:07,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:11:07,917 INFO L87 Difference]: Start difference. First operand 1016 states and 1648 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:09,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:09,507 INFO L93 Difference]: Finished difference Result 2458 states and 4061 transitions. [2024-10-14 05:11:09,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:11:09,508 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-14 05:11:09,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:09,515 INFO L225 Difference]: With dead ends: 2458 [2024-10-14 05:11:09,515 INFO L226 Difference]: Without dead ends: 1461 [2024-10-14 05:11:09,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:11:09,518 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 1228 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 1691 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1248 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 1782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:09,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1248 Valid, 862 Invalid, 1782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1691 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 05:11:09,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2024-10-14 05:11:09,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 1016. [2024-10-14 05:11:09,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 927 states have (on average 1.622437971952535) internal successors, (1504), 930 states have internal predecessors, (1504), 68 states have call successors, (68), 18 states have call predecessors, (68), 20 states have return successors, (73), 69 states have call predecessors, (73), 68 states have call successors, (73) [2024-10-14 05:11:09,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1645 transitions. [2024-10-14 05:11:09,597 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1645 transitions. Word has length 161 [2024-10-14 05:11:09,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:09,597 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1645 transitions. [2024-10-14 05:11:09,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:09,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1645 transitions. [2024-10-14 05:11:09,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 05:11:09,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:09,599 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:09,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 05:11:09,600 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:09,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:09,600 INFO L85 PathProgramCache]: Analyzing trace with hash -528080473, now seen corresponding path program 1 times [2024-10-14 05:11:09,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:09,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222005465] [2024-10-14 05:11:09,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:09,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:09,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:09,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:09,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:09,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:11:09,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:09,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 05:11:09,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:09,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 05:11:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:09,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-14 05:11:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:09,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:11:09,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:09,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222005465] [2024-10-14 05:11:09,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222005465] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:09,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:09,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:11:09,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882683331] [2024-10-14 05:11:09,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:09,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:11:09,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:09,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:11:09,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:11:09,878 INFO L87 Difference]: Start difference. First operand 1016 states and 1645 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:13,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:13,318 INFO L93 Difference]: Finished difference Result 3352 states and 5515 transitions. [2024-10-14 05:11:13,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:11:13,319 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-14 05:11:13,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:13,330 INFO L225 Difference]: With dead ends: 3352 [2024-10-14 05:11:13,330 INFO L226 Difference]: Without dead ends: 2355 [2024-10-14 05:11:13,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:11:13,335 INFO L432 NwaCegarLoop]: 460 mSDtfsCounter, 1494 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 3629 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1513 SdHoareTripleChecker+Valid, 1990 SdHoareTripleChecker+Invalid, 3692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:13,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1513 Valid, 1990 Invalid, 3692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3629 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-14 05:11:13,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2355 states. [2024-10-14 05:11:13,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2355 to 1671. [2024-10-14 05:11:13,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1526 states have (on average 1.6153342070773264) internal successors, (2465), 1531 states have internal predecessors, (2465), 110 states have call successors, (110), 30 states have call predecessors, (110), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-10-14 05:11:13,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2698 transitions. [2024-10-14 05:11:13,496 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2698 transitions. Word has length 161 [2024-10-14 05:11:13,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:13,496 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2698 transitions. [2024-10-14 05:11:13,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:13,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2698 transitions. [2024-10-14 05:11:13,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 05:11:13,498 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:13,498 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:13,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 05:11:13,499 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:13,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:13,499 INFO L85 PathProgramCache]: Analyzing trace with hash -2145520923, now seen corresponding path program 1 times [2024-10-14 05:11:13,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:13,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938677148] [2024-10-14 05:11:13,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:13,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:13,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:13,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:13,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:11:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:13,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 05:11:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:13,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 05:11:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:13,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-14 05:11:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:13,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:11:13,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:13,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938677148] [2024-10-14 05:11:13,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938677148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:13,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:13,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:11:13,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739957960] [2024-10-14 05:11:13,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:13,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:11:13,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:13,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:11:13,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:11:13,737 INFO L87 Difference]: Start difference. First operand 1671 states and 2698 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:15,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:15,266 INFO L93 Difference]: Finished difference Result 3994 states and 6556 transitions. [2024-10-14 05:11:15,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:11:15,266 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-14 05:11:15,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:15,276 INFO L225 Difference]: With dead ends: 3994 [2024-10-14 05:11:15,277 INFO L226 Difference]: Without dead ends: 2342 [2024-10-14 05:11:15,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:11:15,283 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 1227 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 1669 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1247 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 1760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:15,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1247 Valid, 862 Invalid, 1760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1669 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 05:11:15,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2342 states. [2024-10-14 05:11:15,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2342 to 1671. [2024-10-14 05:11:15,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1526 states have (on average 1.6120576671035387) internal successors, (2460), 1531 states have internal predecessors, (2460), 110 states have call successors, (110), 30 states have call predecessors, (110), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-10-14 05:11:15,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2693 transitions. [2024-10-14 05:11:15,446 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2693 transitions. Word has length 161 [2024-10-14 05:11:15,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:15,447 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2693 transitions. [2024-10-14 05:11:15,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:15,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2693 transitions. [2024-10-14 05:11:15,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 05:11:15,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:15,450 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:15,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 05:11:15,450 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:15,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:15,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1782054425, now seen corresponding path program 1 times [2024-10-14 05:11:15,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:15,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131253964] [2024-10-14 05:11:15,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:15,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:15,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:15,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:11:15,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:15,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 05:11:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:15,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 05:11:15,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:15,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-14 05:11:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:15,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:11:15,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:15,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131253964] [2024-10-14 05:11:15,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131253964] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:15,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:15,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:11:15,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917344466] [2024-10-14 05:11:15,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:15,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:11:15,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:15,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:11:15,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:11:15,726 INFO L87 Difference]: Start difference. First operand 1671 states and 2693 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:19,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:19,284 INFO L93 Difference]: Finished difference Result 5725 states and 9356 transitions. [2024-10-14 05:11:19,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:11:19,285 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-14 05:11:19,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:19,303 INFO L225 Difference]: With dead ends: 5725 [2024-10-14 05:11:19,303 INFO L226 Difference]: Without dead ends: 4073 [2024-10-14 05:11:19,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:11:19,309 INFO L432 NwaCegarLoop]: 460 mSDtfsCounter, 1486 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 3591 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1505 SdHoareTripleChecker+Valid, 1990 SdHoareTripleChecker+Invalid, 3654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:19,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1505 Valid, 1990 Invalid, 3654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3591 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-14 05:11:19,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4073 states. [2024-10-14 05:11:19,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4073 to 2981. [2024-10-14 05:11:19,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2981 states, 2724 states have (on average 1.604992657856094) internal successors, (4372), 2733 states have internal predecessors, (4372), 194 states have call successors, (194), 54 states have call predecessors, (194), 62 states have return successors, (229), 201 states have call predecessors, (229), 194 states have call successors, (229) [2024-10-14 05:11:19,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2981 states to 2981 states and 4795 transitions. [2024-10-14 05:11:19,605 INFO L78 Accepts]: Start accepts. Automaton has 2981 states and 4795 transitions. Word has length 161 [2024-10-14 05:11:19,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:19,606 INFO L471 AbstractCegarLoop]: Abstraction has 2981 states and 4795 transitions. [2024-10-14 05:11:19,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:19,606 INFO L276 IsEmpty]: Start isEmpty. Operand 2981 states and 4795 transitions. [2024-10-14 05:11:19,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 05:11:19,609 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:19,609 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:19,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 05:11:19,610 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:19,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:19,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1493235035, now seen corresponding path program 1 times [2024-10-14 05:11:19,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:19,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581727307] [2024-10-14 05:11:19,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:19,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:19,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:19,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:19,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:11:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:19,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 05:11:19,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:19,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 05:11:19,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:19,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-14 05:11:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:19,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:11:19,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:19,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581727307] [2024-10-14 05:11:19,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581727307] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:19,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:19,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:11:19,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994472390] [2024-10-14 05:11:19,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:19,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:11:19,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:19,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:11:19,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:11:19,870 INFO L87 Difference]: Start difference. First operand 2981 states and 4795 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:23,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:23,364 INFO L93 Difference]: Finished difference Result 10477 states and 17092 transitions. [2024-10-14 05:11:23,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:11:23,365 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-14 05:11:23,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:23,395 INFO L225 Difference]: With dead ends: 10477 [2024-10-14 05:11:23,396 INFO L226 Difference]: Without dead ends: 7515 [2024-10-14 05:11:23,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:11:23,407 INFO L432 NwaCegarLoop]: 460 mSDtfsCounter, 1491 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 3573 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1510 SdHoareTripleChecker+Valid, 1990 SdHoareTripleChecker+Invalid, 3636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:23,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1510 Valid, 1990 Invalid, 3636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3573 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-14 05:11:23,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7515 states. [2024-10-14 05:11:23,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7515 to 5606. [2024-10-14 05:11:23,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5606 states, 5125 states have (on average 1.6003902439024391) internal successors, (8202), 5142 states have internal predecessors, (8202), 362 states have call successors, (362), 102 states have call predecessors, (362), 118 states have return successors, (459), 377 states have call predecessors, (459), 362 states have call successors, (459) [2024-10-14 05:11:23,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5606 states to 5606 states and 9023 transitions. [2024-10-14 05:11:23,927 INFO L78 Accepts]: Start accepts. Automaton has 5606 states and 9023 transitions. Word has length 161 [2024-10-14 05:11:23,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:23,928 INFO L471 AbstractCegarLoop]: Abstraction has 5606 states and 9023 transitions. [2024-10-14 05:11:23,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:23,929 INFO L276 IsEmpty]: Start isEmpty. Operand 5606 states and 9023 transitions. [2024-10-14 05:11:23,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 05:11:23,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:23,933 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:23,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 05:11:23,934 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:23,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:23,934 INFO L85 PathProgramCache]: Analyzing trace with hash -2038107609, now seen corresponding path program 1 times [2024-10-14 05:11:23,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:23,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390747433] [2024-10-14 05:11:23,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:23,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:24,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:24,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:24,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:11:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:24,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 05:11:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:24,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 05:11:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:24,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-14 05:11:24,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:24,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:11:24,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:24,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390747433] [2024-10-14 05:11:24,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390747433] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:24,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:24,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:11:24,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959476172] [2024-10-14 05:11:24,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:24,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:11:24,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:24,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:11:24,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:11:24,167 INFO L87 Difference]: Start difference. First operand 5606 states and 9023 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:26,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:26,056 INFO L93 Difference]: Finished difference Result 13164 states and 21513 transitions. [2024-10-14 05:11:26,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:11:26,056 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-14 05:11:26,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:26,081 INFO L225 Difference]: With dead ends: 13164 [2024-10-14 05:11:26,081 INFO L226 Difference]: Without dead ends: 7577 [2024-10-14 05:11:26,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:11:26,097 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 1137 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 1708 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 1774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:26,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1157 Valid, 1023 Invalid, 1774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1708 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 05:11:26,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7577 states. [2024-10-14 05:11:26,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7577 to 5606. [2024-10-14 05:11:26,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5606 states, 5125 states have (on average 1.5970731707317074) internal successors, (8185), 5142 states have internal predecessors, (8185), 362 states have call successors, (362), 102 states have call predecessors, (362), 118 states have return successors, (459), 377 states have call predecessors, (459), 362 states have call successors, (459) [2024-10-14 05:11:26,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5606 states to 5606 states and 9006 transitions. [2024-10-14 05:11:26,649 INFO L78 Accepts]: Start accepts. Automaton has 5606 states and 9006 transitions. Word has length 161 [2024-10-14 05:11:26,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:26,650 INFO L471 AbstractCegarLoop]: Abstraction has 5606 states and 9006 transitions. [2024-10-14 05:11:26,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:26,650 INFO L276 IsEmpty]: Start isEmpty. Operand 5606 states and 9006 transitions. [2024-10-14 05:11:26,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 05:11:26,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:26,655 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:26,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 05:11:26,656 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:26,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:26,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1308807721, now seen corresponding path program 1 times [2024-10-14 05:11:26,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:26,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605248372] [2024-10-14 05:11:26,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:26,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:26,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:26,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:11:26,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:26,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 05:11:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:26,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 05:11:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:26,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-14 05:11:26,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:26,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:11:26,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:26,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605248372] [2024-10-14 05:11:26,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605248372] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:26,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:26,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:11:26,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009225039] [2024-10-14 05:11:26,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:26,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:11:26,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:26,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:11:26,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:11:26,890 INFO L87 Difference]: Start difference. First operand 5606 states and 9006 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:29,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:29,052 INFO L93 Difference]: Finished difference Result 13146 states and 21426 transitions. [2024-10-14 05:11:29,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:11:29,052 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-14 05:11:29,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:29,074 INFO L225 Difference]: With dead ends: 13146 [2024-10-14 05:11:29,074 INFO L226 Difference]: Without dead ends: 7559 [2024-10-14 05:11:29,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:11:29,088 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 1077 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 1783 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1097 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 1848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:29,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1097 Valid, 1024 Invalid, 1848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1783 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 05:11:29,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7559 states. [2024-10-14 05:11:29,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7559 to 5606. [2024-10-14 05:11:29,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5606 states, 5125 states have (on average 1.5937560975609757) internal successors, (8168), 5142 states have internal predecessors, (8168), 362 states have call successors, (362), 102 states have call predecessors, (362), 118 states have return successors, (459), 377 states have call predecessors, (459), 362 states have call successors, (459) [2024-10-14 05:11:29,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5606 states to 5606 states and 8989 transitions. [2024-10-14 05:11:29,471 INFO L78 Accepts]: Start accepts. Automaton has 5606 states and 8989 transitions. Word has length 161 [2024-10-14 05:11:29,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:29,472 INFO L471 AbstractCegarLoop]: Abstraction has 5606 states and 8989 transitions. [2024-10-14 05:11:29,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:29,472 INFO L276 IsEmpty]: Start isEmpty. Operand 5606 states and 8989 transitions. [2024-10-14 05:11:29,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 05:11:29,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:29,476 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:29,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 05:11:29,476 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:29,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:29,477 INFO L85 PathProgramCache]: Analyzing trace with hash 724036071, now seen corresponding path program 1 times [2024-10-14 05:11:29,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:29,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275551454] [2024-10-14 05:11:29,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:29,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:29,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:29,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:29,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:29,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:11:29,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:29,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 05:11:29,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:29,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 05:11:29,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:29,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-14 05:11:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:29,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:11:29,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:29,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275551454] [2024-10-14 05:11:29,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275551454] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:29,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:29,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:11:29,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813875469] [2024-10-14 05:11:29,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:29,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:11:29,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:29,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:11:29,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:11:29,699 INFO L87 Difference]: Start difference. First operand 5606 states and 8989 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:34,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:34,261 INFO L93 Difference]: Finished difference Result 22358 states and 36300 transitions. [2024-10-14 05:11:34,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 05:11:34,261 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-14 05:11:34,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:34,316 INFO L225 Difference]: With dead ends: 22358 [2024-10-14 05:11:34,316 INFO L226 Difference]: Without dead ends: 16771 [2024-10-14 05:11:34,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:11:34,338 INFO L432 NwaCegarLoop]: 458 mSDtfsCounter, 1906 mSDsluCounter, 1525 mSDsCounter, 0 mSdLazyCounter, 3486 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1938 SdHoareTripleChecker+Valid, 1983 SdHoareTripleChecker+Invalid, 3552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 3486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:34,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1938 Valid, 1983 Invalid, 3552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 3486 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-14 05:11:34,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16771 states. [2024-10-14 05:11:35,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16771 to 10890. [2024-10-14 05:11:35,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10890 states, 9977 states have (on average 1.5908589756439813) internal successors, (15872), 10010 states have internal predecessors, (15872), 682 states have call successors, (682), 198 states have call predecessors, (682), 230 states have return successors, (957), 713 states have call predecessors, (957), 682 states have call successors, (957) [2024-10-14 05:11:35,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10890 states to 10890 states and 17511 transitions. [2024-10-14 05:11:35,336 INFO L78 Accepts]: Start accepts. Automaton has 10890 states and 17511 transitions. Word has length 161 [2024-10-14 05:11:35,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:35,336 INFO L471 AbstractCegarLoop]: Abstraction has 10890 states and 17511 transitions. [2024-10-14 05:11:35,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:35,337 INFO L276 IsEmpty]: Start isEmpty. Operand 10890 states and 17511 transitions. [2024-10-14 05:11:35,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 05:11:35,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:35,342 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:35,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-14 05:11:35,343 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:35,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:35,343 INFO L85 PathProgramCache]: Analyzing trace with hash 289530473, now seen corresponding path program 1 times [2024-10-14 05:11:35,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:35,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048432498] [2024-10-14 05:11:35,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:35,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:35,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:35,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:35,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:11:35,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:35,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 05:11:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:35,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 05:11:35,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:35,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-14 05:11:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:35,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:11:35,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:35,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048432498] [2024-10-14 05:11:35,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048432498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:35,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:35,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:11:35,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260105572] [2024-10-14 05:11:35,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:35,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:11:35,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:35,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:11:35,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:11:35,580 INFO L87 Difference]: Start difference. First operand 10890 states and 17511 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:40,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:40,983 INFO L93 Difference]: Finished difference Result 43352 states and 70600 transitions. [2024-10-14 05:11:40,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 05:11:40,983 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-14 05:11:40,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:41,097 INFO L225 Difference]: With dead ends: 43352 [2024-10-14 05:11:41,097 INFO L226 Difference]: Without dead ends: 32481 [2024-10-14 05:11:41,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:11:41,145 INFO L432 NwaCegarLoop]: 457 mSDtfsCounter, 1869 mSDsluCounter, 1522 mSDsCounter, 0 mSdLazyCounter, 3472 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1901 SdHoareTripleChecker+Valid, 1979 SdHoareTripleChecker+Invalid, 3538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 3472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:41,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1901 Valid, 1979 Invalid, 3538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 3472 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-14 05:11:41,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32481 states. [2024-10-14 05:11:42,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32481 to 21291. [2024-10-14 05:11:42,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21291 states, 19530 states have (on average 1.5894521249359959) internal successors, (31042), 19595 states have internal predecessors, (31042), 1306 states have call successors, (1306), 390 states have call predecessors, (1306), 454 states have return successors, (2099), 1369 states have call predecessors, (2099), 1306 states have call successors, (2099) [2024-10-14 05:11:42,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21291 states to 21291 states and 34447 transitions. [2024-10-14 05:11:42,798 INFO L78 Accepts]: Start accepts. Automaton has 21291 states and 34447 transitions. Word has length 161 [2024-10-14 05:11:42,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:42,798 INFO L471 AbstractCegarLoop]: Abstraction has 21291 states and 34447 transitions. [2024-10-14 05:11:42,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:42,798 INFO L276 IsEmpty]: Start isEmpty. Operand 21291 states and 34447 transitions. [2024-10-14 05:11:42,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 05:11:42,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:42,811 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:42,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-14 05:11:42,811 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:42,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:42,812 INFO L85 PathProgramCache]: Analyzing trace with hash -140127833, now seen corresponding path program 1 times [2024-10-14 05:11:42,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:42,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613746388] [2024-10-14 05:11:42,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:42,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:42,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:42,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:42,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:11:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:43,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 05:11:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:43,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 05:11:43,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:43,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-14 05:11:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:43,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:11:43,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:43,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613746388] [2024-10-14 05:11:43,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613746388] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:43,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:43,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:11:43,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060248941] [2024-10-14 05:11:43,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:43,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:11:43,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:43,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:11:43,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:11:43,042 INFO L87 Difference]: Start difference. First operand 21291 states and 34447 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:50,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:11:50,690 INFO L93 Difference]: Finished difference Result 84407 states and 138238 transitions. [2024-10-14 05:11:50,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 05:11:50,691 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-14 05:11:50,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:11:51,193 INFO L225 Difference]: With dead ends: 84407 [2024-10-14 05:11:51,193 INFO L226 Difference]: Without dead ends: 63135 [2024-10-14 05:11:51,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:11:51,260 INFO L432 NwaCegarLoop]: 458 mSDtfsCounter, 1562 mSDsluCounter, 1525 mSDsCounter, 0 mSdLazyCounter, 4091 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1580 SdHoareTripleChecker+Valid, 1983 SdHoareTripleChecker+Invalid, 4156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 4091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:11:51,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1580 Valid, 1983 Invalid, 4156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 4091 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-14 05:11:51,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63135 states. [2024-10-14 05:11:54,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63135 to 42252. [2024-10-14 05:11:55,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42252 states, 38827 states have (on average 1.5891003683004095) internal successors, (61700), 38956 states have internal predecessors, (61700), 2522 states have call successors, (2522), 774 states have call predecessors, (2522), 902 states have return successors, (4837), 2649 states have call predecessors, (4837), 2522 states have call successors, (4837) [2024-10-14 05:11:55,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42252 states to 42252 states and 69059 transitions. [2024-10-14 05:11:55,143 INFO L78 Accepts]: Start accepts. Automaton has 42252 states and 69059 transitions. Word has length 161 [2024-10-14 05:11:55,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:11:55,143 INFO L471 AbstractCegarLoop]: Abstraction has 42252 states and 69059 transitions. [2024-10-14 05:11:55,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:11:55,144 INFO L276 IsEmpty]: Start isEmpty. Operand 42252 states and 69059 transitions. [2024-10-14 05:11:55,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 05:11:55,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:11:55,165 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:11:55,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-14 05:11:55,166 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:11:55,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:11:55,166 INFO L85 PathProgramCache]: Analyzing trace with hash -846724439, now seen corresponding path program 1 times [2024-10-14 05:11:55,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:11:55,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305216465] [2024-10-14 05:11:55,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:11:55,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:11:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:55,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:11:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:55,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:11:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:55,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 05:11:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:55,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 05:11:55,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:55,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-14 05:11:55,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:11:55,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:11:55,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:11:55,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305216465] [2024-10-14 05:11:55,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305216465] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:11:55,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:11:55,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:11:55,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689042982] [2024-10-14 05:11:55,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:11:55,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:11:55,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:11:55,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:11:55,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:11:55,416 INFO L87 Difference]: Start difference. First operand 42252 states and 69059 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)