./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/merge_sort-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-manipulation/merge_sort-2.i -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 e47f94c757882803b8e19e21a897c3f5ab1653c3391e3b246153a1c416bdab7c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 19:30:22,845 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 19:30:22,902 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 19:30:22,907 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 19:30:22,907 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 19:30:22,930 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 19:30:22,931 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 19:30:22,931 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 19:30:22,932 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 19:30:22,933 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 19:30:22,933 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 19:30:22,933 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 19:30:22,934 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 19:30:22,934 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 19:30:22,936 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 19:30:22,936 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 19:30:22,936 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 19:30:22,936 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 19:30:22,936 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 19:30:22,937 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 19:30:22,937 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 19:30:22,937 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 19:30:22,938 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 19:30:22,938 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 19:30:22,940 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 19:30:22,941 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 19:30:22,941 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 19:30:22,941 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 19:30:22,941 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 19:30:22,942 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 19:30:22,942 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 19:30:22,942 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 19:30:22,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 19:30:22,942 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 19:30:22,942 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 19:30:22,943 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 19:30:22,943 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 19:30:22,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 19:30:22,943 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 19:30:22,943 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 19:30:22,944 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 19:30:22,944 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 19:30:22,945 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 -> e47f94c757882803b8e19e21a897c3f5ab1653c3391e3b246153a1c416bdab7c [2024-11-11 19:30:23,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 19:30:23,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 19:30:23,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 19:30:23,217 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 19:30:23,220 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 19:30:23,222 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2024-11-11 19:30:24,655 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 19:30:25,009 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 19:30:25,012 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2024-11-11 19:30:25,042 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/424ea248a/622aecf06e6d40bfae1165d66efbf6b7/FLAGa66f9579c [2024-11-11 19:30:25,261 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/424ea248a/622aecf06e6d40bfae1165d66efbf6b7 [2024-11-11 19:30:25,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 19:30:25,265 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 19:30:25,267 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 19:30:25,267 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 19:30:25,274 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 19:30:25,274 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 07:30:25" (1/1) ... [2024-11-11 19:30:25,277 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e0e8e6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:30:25, skipping insertion in model container [2024-11-11 19:30:25,277 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 07:30:25" (1/1) ... [2024-11-11 19:30:25,314 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 19:30:25,528 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-2.i[22632,22645] [2024-11-11 19:30:25,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 19:30:25,595 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 19:30:25,641 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-2.i[22632,22645] [2024-11-11 19:30:25,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 19:30:25,681 INFO L204 MainTranslator]: Completed translation [2024-11-11 19:30:25,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:30:25 WrapperNode [2024-11-11 19:30:25,682 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 19:30:25,682 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 19:30:25,683 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 19:30:25,683 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 19:30:25,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:30:25" (1/1) ... [2024-11-11 19:30:25,701 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:30:25" (1/1) ... [2024-11-11 19:30:25,726 INFO L138 Inliner]: procedures = 125, calls = 83, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 288 [2024-11-11 19:30:25,727 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 19:30:25,727 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 19:30:25,727 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 19:30:25,727 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 19:30:25,737 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:30:25" (1/1) ... [2024-11-11 19:30:25,738 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:30:25" (1/1) ... [2024-11-11 19:30:25,740 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:30:25" (1/1) ... [2024-11-11 19:30:25,768 INFO L175 MemorySlicer]: Split 49 memory accesses to 4 slices as follows [2, 34, 10, 3]. 69 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 13 writes are split as follows [0, 8, 3, 2]. [2024-11-11 19:30:25,768 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:30:25" (1/1) ... [2024-11-11 19:30:25,769 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:30:25" (1/1) ... [2024-11-11 19:30:25,780 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:30:25" (1/1) ... [2024-11-11 19:30:25,789 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:30:25" (1/1) ... [2024-11-11 19:30:25,791 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:30:25" (1/1) ... [2024-11-11 19:30:25,799 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:30:25" (1/1) ... [2024-11-11 19:30:25,801 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 19:30:25,805 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 19:30:25,806 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 19:30:25,806 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 19:30:25,806 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:30:25" (1/1) ... [2024-11-11 19:30:25,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 19:30:25,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:30:25,845 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 19:30:25,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 19:30:25,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-11 19:30:25,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-11 19:30:25,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-11 19:30:25,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-11 19:30:25,887 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2024-11-11 19:30:25,887 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2024-11-11 19:30:25,887 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-11-11 19:30:25,888 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-11-11 19:30:25,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-11 19:30:25,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-11 19:30:25,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-11 19:30:25,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-11 19:30:25,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-11 19:30:25,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 19:30:25,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-11 19:30:25,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-11 19:30:25,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-11 19:30:25,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-11 19:30:25,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-11 19:30:25,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-11 19:30:25,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-11 19:30:25,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-11 19:30:25,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-11 19:30:25,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-11 19:30:25,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 19:30:25,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 19:30:25,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-11 19:30:25,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-11 19:30:25,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 19:30:25,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 19:30:25,998 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 19:30:26,000 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 19:30:26,256 INFO L? ?]: Removed 66 outVars from TransFormulas that were not future-live. [2024-11-11 19:30:26,257 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 19:30:26,269 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 19:30:26,269 INFO L316 CfgBuilder]: Removed 33 assume(true) statements. [2024-11-11 19:30:26,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:30:26 BoogieIcfgContainer [2024-11-11 19:30:26,269 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 19:30:26,271 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 19:30:26,271 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 19:30:26,273 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 19:30:26,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 07:30:25" (1/3) ... [2024-11-11 19:30:26,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e1b1e2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 07:30:26, skipping insertion in model container [2024-11-11 19:30:26,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:30:25" (2/3) ... [2024-11-11 19:30:26,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e1b1e2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 07:30:26, skipping insertion in model container [2024-11-11 19:30:26,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:30:26" (3/3) ... [2024-11-11 19:30:26,275 INFO L112 eAbstractionObserver]: Analyzing ICFG merge_sort-2.i [2024-11-11 19:30:26,286 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 19:30:26,287 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 19:30:26,328 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 19:30:26,332 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;@5c2fa4b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 19:30:26,332 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 19:30:26,338 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 77 states have (on average 1.8051948051948052) internal successors, (139), 93 states have internal predecessors, (139), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-11 19:30:26,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-11 19:30:26,342 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:30:26,342 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:30:26,343 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:30:26,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:30:26,347 INFO L85 PathProgramCache]: Analyzing trace with hash 2117458632, now seen corresponding path program 1 times [2024-11-11 19:30:26,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:30:26,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874971716] [2024-11-11 19:30:26,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:26,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:30:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:26,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:30:26,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:30:26,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874971716] [2024-11-11 19:30:26,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874971716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:30:26,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:30:26,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 19:30:26,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596879232] [2024-11-11 19:30:26,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:30:26,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 19:30:26,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:30:26,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 19:30:26,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 19:30:26,537 INFO L87 Difference]: Start difference. First operand has 96 states, 77 states have (on average 1.8051948051948052) internal successors, (139), 93 states have internal predecessors, (139), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:26,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:30:26,572 INFO L93 Difference]: Finished difference Result 188 states and 335 transitions. [2024-11-11 19:30:26,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 19:30:26,573 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-11 19:30:26,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:30:26,580 INFO L225 Difference]: With dead ends: 188 [2024-11-11 19:30:26,580 INFO L226 Difference]: Without dead ends: 87 [2024-11-11 19:30:26,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 19:30:26,587 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:30:26,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:30:26,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-11 19:30:26,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-11 19:30:26,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 84 states have internal predecessors, (93), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 19:30:26,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2024-11-11 19:30:26,628 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 7 [2024-11-11 19:30:26,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:30:26,629 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2024-11-11 19:30:26,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:26,630 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2024-11-11 19:30:26,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-11 19:30:26,630 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:30:26,630 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:30:26,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 19:30:26,631 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:30:26,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:30:26,632 INFO L85 PathProgramCache]: Analyzing trace with hash 592840656, now seen corresponding path program 1 times [2024-11-11 19:30:26,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:30:26,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150371473] [2024-11-11 19:30:26,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:26,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:30:26,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:26,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:30:26,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:30:26,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150371473] [2024-11-11 19:30:26,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150371473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:30:26,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:30:26,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 19:30:26,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132839381] [2024-11-11 19:30:26,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:30:26,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 19:30:26,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:30:26,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 19:30:26,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 19:30:26,725 INFO L87 Difference]: Start difference. First operand 87 states and 110 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:26,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:30:26,753 INFO L93 Difference]: Finished difference Result 172 states and 218 transitions. [2024-11-11 19:30:26,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 19:30:26,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-11 19:30:26,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:30:26,754 INFO L225 Difference]: With dead ends: 172 [2024-11-11 19:30:26,755 INFO L226 Difference]: Without dead ends: 93 [2024-11-11 19:30:26,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 19:30:26,756 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 4 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:30:26,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 212 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:30:26,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-11 19:30:26,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2024-11-11 19:30:26,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 86 states have internal predecessors, (95), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 19:30:26,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 112 transitions. [2024-11-11 19:30:26,765 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 112 transitions. Word has length 8 [2024-11-11 19:30:26,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:30:26,765 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 112 transitions. [2024-11-11 19:30:26,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:26,765 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 112 transitions. [2024-11-11 19:30:26,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-11 19:30:26,766 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:30:26,766 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:30:26,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 19:30:26,766 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:30:26,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:30:26,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1362713671, now seen corresponding path program 1 times [2024-11-11 19:30:26,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:30:26,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191918954] [2024-11-11 19:30:26,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:26,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:30:26,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:27,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:30:27,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:30:27,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191918954] [2024-11-11 19:30:27,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191918954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:30:27,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:30:27,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 19:30:27,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801480877] [2024-11-11 19:30:27,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:30:27,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 19:30:27,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:30:27,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 19:30:27,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:30:27,064 INFO L87 Difference]: Start difference. First operand 89 states and 112 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:27,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:30:27,131 INFO L93 Difference]: Finished difference Result 146 states and 182 transitions. [2024-11-11 19:30:27,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:30:27,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-11 19:30:27,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:30:27,133 INFO L225 Difference]: With dead ends: 146 [2024-11-11 19:30:27,133 INFO L226 Difference]: Without dead ends: 141 [2024-11-11 19:30:27,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 19:30:27,134 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 129 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:30:27,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 325 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:30:27,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-11 19:30:27,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 92. [2024-11-11 19:30:27,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 89 states have internal predecessors, (99), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 19:30:27,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 115 transitions. [2024-11-11 19:30:27,142 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 115 transitions. Word has length 14 [2024-11-11 19:30:27,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:30:27,142 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 115 transitions. [2024-11-11 19:30:27,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:27,143 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 115 transitions. [2024-11-11 19:30:27,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-11 19:30:27,143 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:30:27,143 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:30:27,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 19:30:27,143 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:30:27,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:30:27,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1343418312, now seen corresponding path program 1 times [2024-11-11 19:30:27,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:30:27,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28577002] [2024-11-11 19:30:27,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:27,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:30:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:27,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 19:30:27,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:30:27,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28577002] [2024-11-11 19:30:27,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28577002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:30:27,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:30:27,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 19:30:27,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226270536] [2024-11-11 19:30:27,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:30:27,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 19:30:27,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:30:27,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 19:30:27,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:30:27,256 INFO L87 Difference]: Start difference. First operand 92 states and 115 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:27,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:30:27,379 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2024-11-11 19:30:27,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:30:27,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-11 19:30:27,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:30:27,381 INFO L225 Difference]: With dead ends: 94 [2024-11-11 19:30:27,381 INFO L226 Difference]: Without dead ends: 91 [2024-11-11 19:30:27,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 19:30:27,382 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 12 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:30:27,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 326 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:30:27,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-11 19:30:27,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-11 19:30:27,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 76 states have (on average 1.2894736842105263) internal successors, (98), 88 states have internal predecessors, (98), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 19:30:27,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 113 transitions. [2024-11-11 19:30:27,398 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 113 transitions. Word has length 21 [2024-11-11 19:30:27,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:30:27,398 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 113 transitions. [2024-11-11 19:30:27,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:27,399 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 113 transitions. [2024-11-11 19:30:27,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-11 19:30:27,399 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:30:27,399 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:30:27,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 19:30:27,400 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:30:27,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:30:27,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1668834302, now seen corresponding path program 1 times [2024-11-11 19:30:27,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:30:27,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677977950] [2024-11-11 19:30:27,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:27,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:30:27,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:27,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 19:30:27,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:30:27,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677977950] [2024-11-11 19:30:27,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677977950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:30:27,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:30:27,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 19:30:27,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320634783] [2024-11-11 19:30:27,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:30:27,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 19:30:27,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:30:27,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 19:30:27,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:30:27,530 INFO L87 Difference]: Start difference. First operand 91 states and 113 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:27,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:30:27,646 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2024-11-11 19:30:27,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:30:27,647 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-11 19:30:27,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:30:27,648 INFO L225 Difference]: With dead ends: 93 [2024-11-11 19:30:27,648 INFO L226 Difference]: Without dead ends: 90 [2024-11-11 19:30:27,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 19:30:27,649 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 12 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:30:27,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 320 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:30:27,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-11 19:30:27,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-11 19:30:27,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 76 states have (on average 1.2763157894736843) internal successors, (97), 87 states have internal predecessors, (97), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 19:30:27,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 111 transitions. [2024-11-11 19:30:27,664 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 111 transitions. Word has length 21 [2024-11-11 19:30:27,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:30:27,664 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 111 transitions. [2024-11-11 19:30:27,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:27,665 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 111 transitions. [2024-11-11 19:30:27,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-11 19:30:27,665 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:30:27,665 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:30:27,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 19:30:27,666 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:30:27,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:30:27,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1088949268, now seen corresponding path program 1 times [2024-11-11 19:30:27,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:30:27,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500114213] [2024-11-11 19:30:27,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:27,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:30:27,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:27,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:30:27,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:30:27,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500114213] [2024-11-11 19:30:27,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500114213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:30:27,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:30:27,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 19:30:27,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316946667] [2024-11-11 19:30:27,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:30:27,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 19:30:27,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:30:27,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 19:30:27,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 19:30:27,907 INFO L87 Difference]: Start difference. First operand 90 states and 111 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:28,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:30:28,196 INFO L93 Difference]: Finished difference Result 141 states and 170 transitions. [2024-11-11 19:30:28,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 19:30:28,197 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-11 19:30:28,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:30:28,198 INFO L225 Difference]: With dead ends: 141 [2024-11-11 19:30:28,198 INFO L226 Difference]: Without dead ends: 138 [2024-11-11 19:30:28,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-11 19:30:28,199 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 110 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 19:30:28,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 338 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 19:30:28,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-11 19:30:28,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 96. [2024-11-11 19:30:28,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 93 states have internal predecessors, (103), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 19:30:28,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 117 transitions. [2024-11-11 19:30:28,216 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 117 transitions. Word has length 24 [2024-11-11 19:30:28,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:30:28,216 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 117 transitions. [2024-11-11 19:30:28,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:28,217 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 117 transitions. [2024-11-11 19:30:28,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-11 19:30:28,217 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:30:28,217 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:30:28,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 19:30:28,218 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:30:28,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:30:28,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1875885749, now seen corresponding path program 1 times [2024-11-11 19:30:28,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:30:28,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557828744] [2024-11-11 19:30:28,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:28,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:30:28,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:28,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:30:28,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:30:28,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557828744] [2024-11-11 19:30:28,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557828744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:30:28,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:30:28,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 19:30:28,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037461448] [2024-11-11 19:30:28,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:30:28,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 19:30:28,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:30:28,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 19:30:28,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 19:30:28,343 INFO L87 Difference]: Start difference. First operand 96 states and 117 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:28,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:30:28,736 INFO L93 Difference]: Finished difference Result 140 states and 168 transitions. [2024-11-11 19:30:28,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 19:30:28,736 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-11 19:30:28,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:30:28,737 INFO L225 Difference]: With dead ends: 140 [2024-11-11 19:30:28,737 INFO L226 Difference]: Without dead ends: 137 [2024-11-11 19:30:28,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-11 19:30:28,738 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 108 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 19:30:28,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 338 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 19:30:28,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-11 19:30:28,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 102. [2024-11-11 19:30:28,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 88 states have (on average 1.2386363636363635) internal successors, (109), 99 states have internal predecessors, (109), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 19:30:28,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 123 transitions. [2024-11-11 19:30:28,750 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 123 transitions. Word has length 24 [2024-11-11 19:30:28,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:30:28,750 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 123 transitions. [2024-11-11 19:30:28,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:28,750 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 123 transitions. [2024-11-11 19:30:28,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-11 19:30:28,751 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:30:28,751 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:30:28,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 19:30:28,751 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:30:28,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:30:28,752 INFO L85 PathProgramCache]: Analyzing trace with hash 833312565, now seen corresponding path program 1 times [2024-11-11 19:30:28,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:30:28,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616072921] [2024-11-11 19:30:28,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:28,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:30:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:29,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:30:29,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:30:29,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616072921] [2024-11-11 19:30:29,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616072921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:30:29,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:30:29,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 19:30:29,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149573906] [2024-11-11 19:30:29,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:30:29,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 19:30:29,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:30:29,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 19:30:29,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 19:30:29,190 INFO L87 Difference]: Start difference. First operand 102 states and 123 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:29,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:30:29,438 INFO L93 Difference]: Finished difference Result 139 states and 166 transitions. [2024-11-11 19:30:29,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 19:30:29,439 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-11 19:30:29,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:30:29,440 INFO L225 Difference]: With dead ends: 139 [2024-11-11 19:30:29,440 INFO L226 Difference]: Without dead ends: 136 [2024-11-11 19:30:29,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-11 19:30:29,441 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 104 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 19:30:29,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 392 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 19:30:29,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-11 19:30:29,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 105. [2024-11-11 19:30:29,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.2307692307692308) internal successors, (112), 102 states have internal predecessors, (112), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 19:30:29,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 126 transitions. [2024-11-11 19:30:29,454 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 126 transitions. Word has length 27 [2024-11-11 19:30:29,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:30:29,454 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 126 transitions. [2024-11-11 19:30:29,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:29,455 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2024-11-11 19:30:29,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-11 19:30:29,455 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:30:29,455 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:30:29,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 19:30:29,456 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:30:29,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:30:29,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1708085365, now seen corresponding path program 1 times [2024-11-11 19:30:29,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:30:29,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694334536] [2024-11-11 19:30:29,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:29,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:30:29,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:29,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:30:29,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:30:29,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694334536] [2024-11-11 19:30:29,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694334536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:30:29,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:30:29,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 19:30:29,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084014038] [2024-11-11 19:30:29,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:30:29,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 19:30:29,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:30:29,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 19:30:29,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 19:30:29,729 INFO L87 Difference]: Start difference. First operand 105 states and 126 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:29,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:30:29,956 INFO L93 Difference]: Finished difference Result 138 states and 164 transitions. [2024-11-11 19:30:29,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 19:30:29,957 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-11 19:30:29,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:30:29,957 INFO L225 Difference]: With dead ends: 138 [2024-11-11 19:30:29,957 INFO L226 Difference]: Without dead ends: 135 [2024-11-11 19:30:29,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-11 19:30:29,958 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 102 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 19:30:29,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 392 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 19:30:29,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-11 19:30:29,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 108. [2024-11-11 19:30:29,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.2234042553191489) internal successors, (115), 105 states have internal predecessors, (115), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 19:30:29,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 129 transitions. [2024-11-11 19:30:29,971 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 129 transitions. Word has length 27 [2024-11-11 19:30:29,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:30:29,972 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 129 transitions. [2024-11-11 19:30:29,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:29,972 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 129 transitions. [2024-11-11 19:30:29,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-11 19:30:29,973 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:30:29,973 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 19:30:29,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 19:30:29,973 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:30:29,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:30:29,974 INFO L85 PathProgramCache]: Analyzing trace with hash -399551198, now seen corresponding path program 1 times [2024-11-11 19:30:29,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:30:29,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13792248] [2024-11-11 19:30:29,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:29,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:30:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:30,056 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 19:30:30,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:30:30,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13792248] [2024-11-11 19:30:30,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13792248] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:30:30,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195631505] [2024-11-11 19:30:30,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:30,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:30:30,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:30:30,061 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:30:30,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 19:30:30,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:30,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-11 19:30:30,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:30:30,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-11-11 19:30:30,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-11 19:30:30,291 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 19:30:30,292 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 19:30:30,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195631505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:30:30,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 19:30:30,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-11-11 19:30:30,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792536469] [2024-11-11 19:30:30,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:30:30,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 19:30:30,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:30:30,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 19:30:30,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 19:30:30,293 INFO L87 Difference]: Start difference. First operand 108 states and 129 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:30,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:30:30,393 INFO L93 Difference]: Finished difference Result 110 states and 130 transitions. [2024-11-11 19:30:30,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:30:30,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-11 19:30:30,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:30:30,394 INFO L225 Difference]: With dead ends: 110 [2024-11-11 19:30:30,394 INFO L226 Difference]: Without dead ends: 106 [2024-11-11 19:30:30,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-11 19:30:30,395 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 31 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:30:30,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 287 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:30:30,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-11 19:30:30,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-11 19:30:30,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 94 states have (on average 1.202127659574468) internal successors, (113), 103 states have internal predecessors, (113), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 19:30:30,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 125 transitions. [2024-11-11 19:30:30,404 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 125 transitions. Word has length 32 [2024-11-11 19:30:30,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:30:30,404 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 125 transitions. [2024-11-11 19:30:30,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:30,405 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 125 transitions. [2024-11-11 19:30:30,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-11 19:30:30,405 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:30:30,405 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:30:30,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 19:30:30,606 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,SelfDestructingSolverStorable9 [2024-11-11 19:30:30,607 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:30:30,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:30:30,608 INFO L85 PathProgramCache]: Analyzing trace with hash 2096511862, now seen corresponding path program 1 times [2024-11-11 19:30:30,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:30:30,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601938541] [2024-11-11 19:30:30,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:30,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:30:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:30,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:30:30,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:30:30,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601938541] [2024-11-11 19:30:30,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601938541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:30:30,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:30:30,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 19:30:30,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673907597] [2024-11-11 19:30:30,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:30:30,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 19:30:30,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:30:30,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 19:30:30,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 19:30:30,710 INFO L87 Difference]: Start difference. First operand 106 states and 125 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:30,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:30:30,791 INFO L93 Difference]: Finished difference Result 129 states and 152 transitions. [2024-11-11 19:30:30,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 19:30:30,794 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-11 19:30:30,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:30:30,797 INFO L225 Difference]: With dead ends: 129 [2024-11-11 19:30:30,797 INFO L226 Difference]: Without dead ends: 126 [2024-11-11 19:30:30,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-11 19:30:30,798 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 103 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:30:30,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 380 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:30:30,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-11 19:30:30,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 110. [2024-11-11 19:30:30,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 107 states have internal predecessors, (118), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 19:30:30,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 130 transitions. [2024-11-11 19:30:30,808 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 130 transitions. Word has length 33 [2024-11-11 19:30:30,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:30:30,808 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 130 transitions. [2024-11-11 19:30:30,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:30,809 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 130 transitions. [2024-11-11 19:30:30,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-11 19:30:30,810 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:30:30,810 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:30:30,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 19:30:30,813 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:30:30,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:30:30,813 INFO L85 PathProgramCache]: Analyzing trace with hash -236025206, now seen corresponding path program 1 times [2024-11-11 19:30:30,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:30:30,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866330800] [2024-11-11 19:30:30,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:30,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:30:30,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:31,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:30:31,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:30:31,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866330800] [2024-11-11 19:30:31,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866330800] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:30:31,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181754499] [2024-11-11 19:30:31,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:31,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:30:31,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:30:31,148 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:30:31,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 19:30:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:31,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-11 19:30:31,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:30:31,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-11 19:30:31,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-11 19:30:31,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:30:31,419 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:30:31,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:30:31,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181754499] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:30:31,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:30:31,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 11 [2024-11-11 19:30:31,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949640468] [2024-11-11 19:30:31,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:30:31,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 19:30:31,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:30:31,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 19:30:31,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-11 19:30:31,537 INFO L87 Difference]: Start difference. First operand 110 states and 130 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:31,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:30:31,766 INFO L93 Difference]: Finished difference Result 195 states and 225 transitions. [2024-11-11 19:30:31,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 19:30:31,766 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-11 19:30:31,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:30:31,767 INFO L225 Difference]: With dead ends: 195 [2024-11-11 19:30:31,767 INFO L226 Difference]: Without dead ends: 192 [2024-11-11 19:30:31,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-11 19:30:31,768 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 50 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 19:30:31,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 508 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 19:30:31,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-11 19:30:31,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 174. [2024-11-11 19:30:31,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 162 states have (on average 1.1728395061728396) internal successors, (190), 171 states have internal predecessors, (190), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 19:30:31,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 202 transitions. [2024-11-11 19:30:31,781 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 202 transitions. Word has length 36 [2024-11-11 19:30:31,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:30:31,781 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 202 transitions. [2024-11-11 19:30:31,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:31,781 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 202 transitions. [2024-11-11 19:30:31,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-11 19:30:31,782 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:30:31,782 INFO L218 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] [2024-11-11 19:30:31,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 19:30:31,983 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,SelfDestructingSolverStorable11 [2024-11-11 19:30:31,983 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:30:31,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:30:31,984 INFO L85 PathProgramCache]: Analyzing trace with hash -73182161, now seen corresponding path program 1 times [2024-11-11 19:30:31,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:30:31,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873345647] [2024-11-11 19:30:31,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:31,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:30:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:32,237 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-11 19:30:32,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:30:32,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873345647] [2024-11-11 19:30:32,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873345647] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:30:32,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745780126] [2024-11-11 19:30:32,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:32,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:30:32,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:30:32,239 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:30:32,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 19:30:32,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:32,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-11 19:30:32,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:30:32,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-11 19:30:32,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-11 19:30:32,481 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 19:30:32,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:30:32,611 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 19:30:32,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745780126] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:30:32,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:30:32,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 13 [2024-11-11 19:30:32,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182405740] [2024-11-11 19:30:32,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:30:32,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-11 19:30:32,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:30:32,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-11 19:30:32,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-11 19:30:32,612 INFO L87 Difference]: Start difference. First operand 174 states and 202 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:32,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:30:32,880 INFO L93 Difference]: Finished difference Result 242 states and 285 transitions. [2024-11-11 19:30:32,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 19:30:32,881 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-11 19:30:32,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:30:32,882 INFO L225 Difference]: With dead ends: 242 [2024-11-11 19:30:32,882 INFO L226 Difference]: Without dead ends: 154 [2024-11-11 19:30:32,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2024-11-11 19:30:32,883 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 62 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 19:30:32,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 604 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 19:30:32,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-11 19:30:32,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 140. [2024-11-11 19:30:32,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 128 states have (on average 1.171875) internal successors, (150), 137 states have internal predecessors, (150), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 19:30:32,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 162 transitions. [2024-11-11 19:30:32,893 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 162 transitions. Word has length 38 [2024-11-11 19:30:32,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:30:32,893 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 162 transitions. [2024-11-11 19:30:32,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:32,894 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 162 transitions. [2024-11-11 19:30:32,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-11 19:30:32,895 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:30:32,895 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 19:30:32,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 19:30:33,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:30:33,100 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:30:33,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:30:33,101 INFO L85 PathProgramCache]: Analyzing trace with hash 490774162, now seen corresponding path program 1 times [2024-11-11 19:30:33,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:30:33,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803259511] [2024-11-11 19:30:33,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:33,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:30:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:33,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:30:33,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:30:33,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803259511] [2024-11-11 19:30:33,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803259511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:30:33,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:30:33,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 19:30:33,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378677954] [2024-11-11 19:30:33,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:30:33,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 19:30:33,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:30:33,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 19:30:33,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 19:30:33,192 INFO L87 Difference]: Start difference. First operand 140 states and 162 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:33,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:30:33,264 INFO L93 Difference]: Finished difference Result 210 states and 256 transitions. [2024-11-11 19:30:33,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 19:30:33,266 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-11 19:30:33,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:30:33,267 INFO L225 Difference]: With dead ends: 210 [2024-11-11 19:30:33,267 INFO L226 Difference]: Without dead ends: 169 [2024-11-11 19:30:33,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-11 19:30:33,268 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 109 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:30:33,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 371 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:30:33,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-11 19:30:33,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 141. [2024-11-11 19:30:33,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 129 states have (on average 1.1705426356589148) internal successors, (151), 138 states have internal predecessors, (151), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 19:30:33,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 163 transitions. [2024-11-11 19:30:33,280 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 163 transitions. Word has length 38 [2024-11-11 19:30:33,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:30:33,281 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 163 transitions. [2024-11-11 19:30:33,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:33,281 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 163 transitions. [2024-11-11 19:30:33,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-11 19:30:33,282 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:30:33,282 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:30:33,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 19:30:33,282 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:30:33,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:30:33,283 INFO L85 PathProgramCache]: Analyzing trace with hash -557560349, now seen corresponding path program 1 times [2024-11-11 19:30:33,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:30:33,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059427395] [2024-11-11 19:30:33,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:33,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:30:33,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:33,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:30:33,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:30:33,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059427395] [2024-11-11 19:30:33,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059427395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:30:33,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:30:33,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 19:30:33,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080120481] [2024-11-11 19:30:33,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:30:33,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 19:30:33,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:30:33,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 19:30:33,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 19:30:33,421 INFO L87 Difference]: Start difference. First operand 141 states and 163 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:33,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:30:33,579 INFO L93 Difference]: Finished difference Result 163 states and 187 transitions. [2024-11-11 19:30:33,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 19:30:33,579 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-11 19:30:33,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:30:33,580 INFO L225 Difference]: With dead ends: 163 [2024-11-11 19:30:33,580 INFO L226 Difference]: Without dead ends: 160 [2024-11-11 19:30:33,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-11 19:30:33,582 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 67 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:30:33,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 389 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:30:33,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-11 19:30:33,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 147. [2024-11-11 19:30:33,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 135 states have (on average 1.1703703703703703) internal successors, (158), 144 states have internal predecessors, (158), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 19:30:33,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 170 transitions. [2024-11-11 19:30:33,592 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 170 transitions. Word has length 39 [2024-11-11 19:30:33,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:30:33,592 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 170 transitions. [2024-11-11 19:30:33,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:33,592 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 170 transitions. [2024-11-11 19:30:33,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-11 19:30:33,593 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:30:33,593 INFO L218 NwaCegarLoop]: trace histogram [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-11-11 19:30:33,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 19:30:33,594 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:30:33,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:30:33,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1187191264, now seen corresponding path program 1 times [2024-11-11 19:30:33,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:30:33,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043370269] [2024-11-11 19:30:33,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:33,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:30:33,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:33,688 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 19:30:33,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:30:33,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043370269] [2024-11-11 19:30:33,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043370269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:30:33,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:30:33,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 19:30:33,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650753146] [2024-11-11 19:30:33,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:30:33,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 19:30:33,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:30:33,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 19:30:33,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 19:30:33,690 INFO L87 Difference]: Start difference. First operand 147 states and 170 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:33,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:30:33,818 INFO L93 Difference]: Finished difference Result 245 states and 304 transitions. [2024-11-11 19:30:33,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 19:30:33,818 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-11 19:30:33,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:30:33,819 INFO L225 Difference]: With dead ends: 245 [2024-11-11 19:30:33,819 INFO L226 Difference]: Without dead ends: 204 [2024-11-11 19:30:33,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-11 19:30:33,820 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 158 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:30:33,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 719 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:30:33,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-11 19:30:33,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 166. [2024-11-11 19:30:33,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 152 states have (on average 1.2039473684210527) internal successors, (183), 163 states have internal predecessors, (183), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-11 19:30:33,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 199 transitions. [2024-11-11 19:30:33,832 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 199 transitions. Word has length 39 [2024-11-11 19:30:33,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:30:33,833 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 199 transitions. [2024-11-11 19:30:33,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:33,833 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 199 transitions. [2024-11-11 19:30:33,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-11 19:30:33,833 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:30:33,833 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2024-11-11 19:30:33,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 19:30:33,834 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:30:33,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:30:33,834 INFO L85 PathProgramCache]: Analyzing trace with hash -294674701, now seen corresponding path program 2 times [2024-11-11 19:30:33,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:30:33,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762607133] [2024-11-11 19:30:33,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:33,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:30:33,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:34,290 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:30:34,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:30:34,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762607133] [2024-11-11 19:30:34,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762607133] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:30:34,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995035817] [2024-11-11 19:30:34,291 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 19:30:34,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:30:34,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:30:34,294 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:30:34,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 19:30:34,387 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-11 19:30:34,387 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 19:30:34,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-11 19:30:34,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:30:34,449 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-11 19:30:34,449 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 19:30:34,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995035817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:30:34,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 19:30:34,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 16 [2024-11-11 19:30:34,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233447652] [2024-11-11 19:30:34,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:30:34,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 19:30:34,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:30:34,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 19:30:34,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-11-11 19:30:34,451 INFO L87 Difference]: Start difference. First operand 166 states and 199 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:34,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:30:34,595 INFO L93 Difference]: Finished difference Result 168 states and 200 transitions. [2024-11-11 19:30:34,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 19:30:34,596 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-11 19:30:34,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:30:34,597 INFO L225 Difference]: With dead ends: 168 [2024-11-11 19:30:34,597 INFO L226 Difference]: Without dead ends: 165 [2024-11-11 19:30:34,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2024-11-11 19:30:34,598 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 26 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:30:34,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 354 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:30:34,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-11 19:30:34,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 146. [2024-11-11 19:30:34,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 133 states have (on average 1.2105263157894737) internal successors, (161), 143 states have internal predecessors, (161), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-11 19:30:34,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 176 transitions. [2024-11-11 19:30:34,607 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 176 transitions. Word has length 42 [2024-11-11 19:30:34,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:30:34,607 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 176 transitions. [2024-11-11 19:30:34,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:34,607 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 176 transitions. [2024-11-11 19:30:34,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-11 19:30:34,608 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:30:34,608 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2024-11-11 19:30:34,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-11 19:30:34,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-11 19:30:34,808 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:30:34,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:30:34,809 INFO L85 PathProgramCache]: Analyzing trace with hash -600772008, now seen corresponding path program 2 times [2024-11-11 19:30:34,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:30:34,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118838288] [2024-11-11 19:30:34,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:34,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:30:34,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:35,282 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:30:35,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:30:35,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118838288] [2024-11-11 19:30:35,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118838288] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:30:35,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803854019] [2024-11-11 19:30:35,283 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 19:30:35,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:30:35,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:30:35,284 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:30:35,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 19:30:35,393 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 19:30:35,393 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 19:30:35,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-11 19:30:35,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:30:35,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-11 19:30:35,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-11 19:30:35,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-11 19:30:35,505 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-11 19:30:35,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-11 19:30:35,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-11 19:30:35,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-11 19:30:35,575 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-11 19:30:35,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-11 19:30:35,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-11-11 19:30:35,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 15 [2024-11-11 19:30:36,207 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:30:36,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:30:36,794 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:30:36,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 45 [2024-11-11 19:30:36,801 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:30:36,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:30:36,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 86 [2024-11-11 19:30:36,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2024-11-11 19:30:36,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2024-11-11 19:30:36,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:30:36,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 45 [2024-11-11 19:30:36,964 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:30:36,969 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:30:36,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 166 [2024-11-11 19:30:36,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2024-11-11 19:30:36,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-11 19:30:37,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 113 [2024-11-11 19:30:37,254 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:30:37,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803854019] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:30:37,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:30:37,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 30 [2024-11-11 19:30:37,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120529312] [2024-11-11 19:30:37,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:30:37,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-11 19:30:37,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:30:37,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-11 19:30:37,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=796, Unknown=1, NotChecked=0, Total=870 [2024-11-11 19:30:37,256 INFO L87 Difference]: Start difference. First operand 146 states and 176 transitions. Second operand has 30 states, 30 states have (on average 3.8) internal successors, (114), 30 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:39,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:30:39,067 INFO L93 Difference]: Finished difference Result 388 states and 460 transitions. [2024-11-11 19:30:39,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-11 19:30:39,068 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.8) internal successors, (114), 30 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-11 19:30:39,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:30:39,069 INFO L225 Difference]: With dead ends: 388 [2024-11-11 19:30:39,069 INFO L226 Difference]: Without dead ends: 288 [2024-11-11 19:30:39,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=295, Invalid=2356, Unknown=1, NotChecked=0, Total=2652 [2024-11-11 19:30:39,070 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 754 mSDsluCounter, 1757 mSDsCounter, 0 mSdLazyCounter, 1397 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 1858 SdHoareTripleChecker+Invalid, 1413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:30:39,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 1858 Invalid, 1413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1397 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 19:30:39,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-11 19:30:39,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 182. [2024-11-11 19:30:39,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 169 states have (on average 1.183431952662722) internal successors, (200), 179 states have internal predecessors, (200), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-11 19:30:39,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 215 transitions. [2024-11-11 19:30:39,085 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 215 transitions. Word has length 44 [2024-11-11 19:30:39,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:30:39,086 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 215 transitions. [2024-11-11 19:30:39,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.8) internal successors, (114), 30 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:39,086 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 215 transitions. [2024-11-11 19:30:39,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-11 19:30:39,086 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:30:39,086 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2024-11-11 19:30:39,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-11 19:30:39,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-11 19:30:39,291 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:30:39,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:30:39,291 INFO L85 PathProgramCache]: Analyzing trace with hash 186164473, now seen corresponding path program 1 times [2024-11-11 19:30:39,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:30:39,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276614249] [2024-11-11 19:30:39,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:39,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:30:39,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:39,754 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:30:39,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:30:39,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276614249] [2024-11-11 19:30:39,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276614249] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:30:39,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394218917] [2024-11-11 19:30:39,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:39,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:30:39,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:30:39,757 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:30:39,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 19:30:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:39,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-11 19:30:39,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:30:39,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-11 19:30:39,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2024-11-11 19:30:39,923 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-11 19:30:39,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-11 19:30:39,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-11 19:30:39,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-11 19:30:39,980 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2024-11-11 19:30:39,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 24 [2024-11-11 19:30:40,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-11 19:30:40,373 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-11 19:30:40,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 22 [2024-11-11 19:30:40,375 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:30:40,375 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:30:40,846 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:30:40,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 71 [2024-11-11 19:30:40,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:30:40,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 489 treesize of output 475 [2024-11-11 19:30:40,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 569 treesize of output 541 [2024-11-11 19:30:41,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 116 [2024-11-11 19:30:41,181 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:30:41,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394218917] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:30:41,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:30:41,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 34 [2024-11-11 19:30:41,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976767661] [2024-11-11 19:30:41,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:30:41,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-11 19:30:41,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:30:41,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-11 19:30:41,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1004, Unknown=1, NotChecked=0, Total=1122 [2024-11-11 19:30:41,183 INFO L87 Difference]: Start difference. First operand 182 states and 215 transitions. Second operand has 34 states, 34 states have (on average 3.235294117647059) internal successors, (110), 34 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:43,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:30:43,041 INFO L93 Difference]: Finished difference Result 244 states and 282 transitions. [2024-11-11 19:30:43,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-11 19:30:43,042 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.235294117647059) internal successors, (110), 34 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-11 19:30:43,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:30:43,044 INFO L225 Difference]: With dead ends: 244 [2024-11-11 19:30:43,044 INFO L226 Difference]: Without dead ends: 241 [2024-11-11 19:30:43,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=420, Invalid=2439, Unknown=3, NotChecked=0, Total=2862 [2024-11-11 19:30:43,045 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 620 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 13 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 19:30:43,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 1601 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1281 Invalid, 9 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 19:30:43,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-11 19:30:43,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 189. [2024-11-11 19:30:43,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 176 states have (on average 1.1761363636363635) internal successors, (207), 186 states have internal predecessors, (207), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-11 19:30:43,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 222 transitions. [2024-11-11 19:30:43,070 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 222 transitions. Word has length 44 [2024-11-11 19:30:43,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:30:43,070 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 222 transitions. [2024-11-11 19:30:43,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.235294117647059) internal successors, (110), 34 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:43,072 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 222 transitions. [2024-11-11 19:30:43,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-11 19:30:43,072 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:30:43,072 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:30:43,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-11 19:30:43,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:30:43,273 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:30:43,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:30:43,273 INFO L85 PathProgramCache]: Analyzing trace with hash -498608817, now seen corresponding path program 1 times [2024-11-11 19:30:43,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:30:43,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898908494] [2024-11-11 19:30:43,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:43,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:30:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:43,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 19:30:43,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:30:43,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898908494] [2024-11-11 19:30:43,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898908494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:30:43,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:30:43,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 19:30:43,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698703122] [2024-11-11 19:30:43,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:30:43,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 19:30:43,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:30:43,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 19:30:43,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:30:43,348 INFO L87 Difference]: Start difference. First operand 189 states and 222 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:43,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:30:43,460 INFO L93 Difference]: Finished difference Result 191 states and 223 transitions. [2024-11-11 19:30:43,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:30:43,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-11-11 19:30:43,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:30:43,465 INFO L225 Difference]: With dead ends: 191 [2024-11-11 19:30:43,465 INFO L226 Difference]: Without dead ends: 173 [2024-11-11 19:30:43,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 19:30:43,466 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 1 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:30:43,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 327 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:30:43,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-11 19:30:43,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2024-11-11 19:30:43,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 161 states have (on average 1.173913043478261) internal successors, (189), 170 states have internal predecessors, (189), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-11 19:30:43,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 203 transitions. [2024-11-11 19:30:43,488 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 203 transitions. Word has length 45 [2024-11-11 19:30:43,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:30:43,489 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 203 transitions. [2024-11-11 19:30:43,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:43,489 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 203 transitions. [2024-11-11 19:30:43,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-11 19:30:43,489 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:30:43,489 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:30:43,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 19:30:43,490 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:30:43,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:30:43,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1371065139, now seen corresponding path program 1 times [2024-11-11 19:30:43,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:30:43,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771452930] [2024-11-11 19:30:43,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:43,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:30:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:43,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:30:43,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:30:43,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771452930] [2024-11-11 19:30:43,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771452930] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:30:43,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801325312] [2024-11-11 19:30:43,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:43,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:30:43,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:30:43,728 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:30:43,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-11 19:30:43,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:43,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-11 19:30:43,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:30:43,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2024-11-11 19:30:43,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-11 19:30:43,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-11 19:30:43,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 19:30:43,984 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 19:30:43,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801325312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:30:43,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 19:30:43,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 16 [2024-11-11 19:30:43,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765328068] [2024-11-11 19:30:43,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:30:43,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 19:30:43,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:30:43,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 19:30:43,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-11 19:30:43,986 INFO L87 Difference]: Start difference. First operand 173 states and 203 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:44,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:30:44,261 INFO L93 Difference]: Finished difference Result 214 states and 261 transitions. [2024-11-11 19:30:44,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 19:30:44,262 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-11-11 19:30:44,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:30:44,263 INFO L225 Difference]: With dead ends: 214 [2024-11-11 19:30:44,263 INFO L226 Difference]: Without dead ends: 203 [2024-11-11 19:30:44,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2024-11-11 19:30:44,264 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 57 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 19:30:44,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 626 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 19:30:44,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-11 19:30:44,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 183. [2024-11-11 19:30:44,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 171 states have (on average 1.1871345029239766) internal successors, (203), 180 states have internal predecessors, (203), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-11 19:30:44,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 217 transitions. [2024-11-11 19:30:44,282 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 217 transitions. Word has length 45 [2024-11-11 19:30:44,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:30:44,282 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 217 transitions. [2024-11-11 19:30:44,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:44,283 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 217 transitions. [2024-11-11 19:30:44,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-11 19:30:44,283 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:30:44,283 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:30:44,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-11 19:30:44,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:30:44,484 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:30:44,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:30:44,484 INFO L85 PathProgramCache]: Analyzing trace with hash -762728988, now seen corresponding path program 1 times [2024-11-11 19:30:44,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:30:44,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125739048] [2024-11-11 19:30:44,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:44,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:30:44,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:44,545 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 19:30:44,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:30:44,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125739048] [2024-11-11 19:30:44,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125739048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:30:44,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:30:44,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 19:30:44,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604311170] [2024-11-11 19:30:44,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:30:44,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 19:30:44,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:30:44,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 19:30:44,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 19:30:44,546 INFO L87 Difference]: Start difference. First operand 183 states and 217 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:44,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:30:44,575 INFO L93 Difference]: Finished difference Result 250 states and 310 transitions. [2024-11-11 19:30:44,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 19:30:44,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-11-11 19:30:44,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:30:44,577 INFO L225 Difference]: With dead ends: 250 [2024-11-11 19:30:44,577 INFO L226 Difference]: Without dead ends: 186 [2024-11-11 19:30:44,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 19:30:44,577 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:30:44,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:30:44,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-11 19:30:44,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2024-11-11 19:30:44,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 173 states have (on average 1.1849710982658959) internal successors, (205), 182 states have internal predecessors, (205), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-11 19:30:44,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 219 transitions. [2024-11-11 19:30:44,595 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 219 transitions. Word has length 46 [2024-11-11 19:30:44,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:30:44,596 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 219 transitions. [2024-11-11 19:30:44,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:44,596 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 219 transitions. [2024-11-11 19:30:44,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-11 19:30:44,596 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:30:44,596 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:30:44,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 19:30:44,597 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:30:44,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:30:44,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1773846238, now seen corresponding path program 1 times [2024-11-11 19:30:44,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:30:44,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156967763] [2024-11-11 19:30:44,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:44,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:30:44,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:44,725 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 19:30:44,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:30:44,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156967763] [2024-11-11 19:30:44,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156967763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:30:44,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:30:44,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 19:30:44,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412440888] [2024-11-11 19:30:44,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:30:44,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 19:30:44,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:30:44,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 19:30:44,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 19:30:44,727 INFO L87 Difference]: Start difference. First operand 185 states and 219 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:44,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:30:44,832 INFO L93 Difference]: Finished difference Result 231 states and 283 transitions. [2024-11-11 19:30:44,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 19:30:44,833 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-11-11 19:30:44,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:30:44,834 INFO L225 Difference]: With dead ends: 231 [2024-11-11 19:30:44,834 INFO L226 Difference]: Without dead ends: 198 [2024-11-11 19:30:44,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-11 19:30:44,835 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 78 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:30:44,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 458 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:30:44,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-11 19:30:44,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 164. [2024-11-11 19:30:44,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 155 states have (on average 1.1483870967741936) internal successors, (178), 161 states have internal predecessors, (178), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 19:30:44,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 187 transitions. [2024-11-11 19:30:44,853 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 187 transitions. Word has length 46 [2024-11-11 19:30:44,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:30:44,856 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 187 transitions. [2024-11-11 19:30:44,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:30:44,856 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 187 transitions. [2024-11-11 19:30:44,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-11 19:30:44,856 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:30:44,856 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2024-11-11 19:30:44,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-11 19:30:44,857 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:30:44,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:30:44,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1117057735, now seen corresponding path program 1 times [2024-11-11 19:30:44,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:30:44,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390050300] [2024-11-11 19:30:44,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:44,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:30:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:46,068 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:30:46,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:30:46,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390050300] [2024-11-11 19:30:46,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390050300] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:30:46,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061336901] [2024-11-11 19:30:46,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:30:46,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:30:46,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:30:46,071 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:30:46,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-11 19:30:46,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:30:46,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-11-11 19:30:46,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:30:46,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-11 19:30:46,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-11 19:30:46,238 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-11 19:30:46,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-11 19:30:46,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-11 19:30:46,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-11-11 19:30:46,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 15 [2024-11-11 19:30:46,354 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2024-11-11 19:30:46,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2024-11-11 19:30:46,444 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-11 19:30:46,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 48 [2024-11-11 19:30:46,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-11 19:30:46,469 INFO L349 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2024-11-11 19:30:46,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 29 [2024-11-11 19:30:46,574 INFO L349 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2024-11-11 19:30:46,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 66 [2024-11-11 19:30:46,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 47 [2024-11-11 19:30:47,388 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:30:47,388 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:30:53,151 INFO L349 Elim1Store]: treesize reduction 208, result has 34.4 percent of original size [2024-11-11 19:30:53,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 569 treesize of output 470 [2024-11-11 19:30:53,784 INFO L349 Elim1Store]: treesize reduction 10, result has 92.4 percent of original size [2024-11-11 19:30:53,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 1060896 treesize of output 1051638 [2024-11-11 19:31:01,150 WARN L286 SmtUtils]: Spent 7.36s on a formula simplification. DAG size of input: 1220 DAG size of output: 821 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-11 19:31:02,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:31:02,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 452054 treesize of output 450822 [2024-11-11 19:31:04,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:31:04,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 13768 treesize of output 13593 [2024-11-11 19:31:06,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14516 treesize of output 13616