./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 c7c6ca5d 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-?-c7c6ca5-m [2024-11-08 13:51:08,530 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 13:51:08,605 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 13:51:08,610 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 13:51:08,611 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 13:51:08,633 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 13:51:08,634 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 13:51:08,634 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 13:51:08,635 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 13:51:08,635 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 13:51:08,635 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 13:51:08,635 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 13:51:08,636 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 13:51:08,636 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 13:51:08,636 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 13:51:08,637 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 13:51:08,637 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 13:51:08,637 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 13:51:08,637 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 13:51:08,637 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 13:51:08,638 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 13:51:08,643 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 13:51:08,643 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 13:51:08,644 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 13:51:08,644 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 13:51:08,644 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 13:51:08,644 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 13:51:08,644 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 13:51:08,644 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 13:51:08,645 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 13:51:08,645 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 13:51:08,645 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 13:51:08,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:51:08,646 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 13:51:08,646 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 13:51:08,646 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 13:51:08,646 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 13:51:08,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 13:51:08,646 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 13:51:08,646 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 13:51:08,647 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 13:51:08,649 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 13:51:08,649 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-08 13:51:08,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 13:51:08,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 13:51:08,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 13:51:08,865 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 13:51:08,866 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 13:51:08,866 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-08 13:51:10,242 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 13:51:10,441 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 13:51:10,441 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2024-11-08 13:51:10,452 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50ce6e2fe/be1d2d1778e040269710008bf030ce4c/FLAG555444717 [2024-11-08 13:51:10,463 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50ce6e2fe/be1d2d1778e040269710008bf030ce4c [2024-11-08 13:51:10,465 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 13:51:10,466 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 13:51:10,467 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 13:51:10,467 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 13:51:10,472 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 13:51:10,472 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:51:10" (1/1) ... [2024-11-08 13:51:10,473 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c6f9dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:10, skipping insertion in model container [2024-11-08 13:51:10,473 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:51:10" (1/1) ... [2024-11-08 13:51:10,520 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 13:51:10,756 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-08 13:51:10,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:51:10,797 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 13:51:10,849 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-08 13:51:10,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:51:10,916 INFO L204 MainTranslator]: Completed translation [2024-11-08 13:51:10,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:10 WrapperNode [2024-11-08 13:51:10,917 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 13:51:10,918 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 13:51:10,918 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 13:51:10,918 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 13:51:10,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:10" (1/1) ... [2024-11-08 13:51:10,933 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:10" (1/1) ... [2024-11-08 13:51:10,955 INFO L138 Inliner]: procedures = 125, calls = 83, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 288 [2024-11-08 13:51:10,955 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 13:51:10,956 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 13:51:10,956 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 13:51:10,956 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 13:51:10,965 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:10" (1/1) ... [2024-11-08 13:51:10,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:10" (1/1) ... [2024-11-08 13:51:10,968 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:10" (1/1) ... [2024-11-08 13:51:10,998 INFO L175 MemorySlicer]: Split 49 memory accesses to 4 slices as follows [2, 10, 34, 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, 3, 8, 2]. [2024-11-08 13:51:10,999 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:10" (1/1) ... [2024-11-08 13:51:10,999 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:10" (1/1) ... [2024-11-08 13:51:11,006 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:10" (1/1) ... [2024-11-08 13:51:11,010 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:10" (1/1) ... [2024-11-08 13:51:11,011 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:10" (1/1) ... [2024-11-08 13:51:11,013 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:10" (1/1) ... [2024-11-08 13:51:11,016 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 13:51:11,016 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 13:51:11,016 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 13:51:11,017 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 13:51:11,017 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:10" (1/1) ... [2024-11-08 13:51:11,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:51:11,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:51:11,044 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-08 13:51:11,046 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-08 13:51:11,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 13:51:11,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 13:51:11,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 13:51:11,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-08 13:51:11,087 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2024-11-08 13:51:11,087 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2024-11-08 13:51:11,087 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-11-08 13:51:11,087 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-11-08 13:51:11,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 13:51:11,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 13:51:11,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 13:51:11,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-08 13:51:11,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 13:51:11,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 13:51:11,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 13:51:11,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 13:51:11,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 13:51:11,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-08 13:51:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-08 13:51:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 13:51:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 13:51:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-08 13:51:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-08 13:51:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 13:51:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 13:51:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 13:51:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 13:51:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-08 13:51:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 13:51:11,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 13:51:11,225 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 13:51:11,227 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 13:51:11,518 INFO L? ?]: Removed 66 outVars from TransFormulas that were not future-live. [2024-11-08 13:51:11,518 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 13:51:11,531 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 13:51:11,532 INFO L316 CfgBuilder]: Removed 33 assume(true) statements. [2024-11-08 13:51:11,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:51:11 BoogieIcfgContainer [2024-11-08 13:51:11,533 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 13:51:11,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 13:51:11,535 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 13:51:11,538 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 13:51:11,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 01:51:10" (1/3) ... [2024-11-08 13:51:11,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb9cffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:51:11, skipping insertion in model container [2024-11-08 13:51:11,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:10" (2/3) ... [2024-11-08 13:51:11,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb9cffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:51:11, skipping insertion in model container [2024-11-08 13:51:11,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:51:11" (3/3) ... [2024-11-08 13:51:11,540 INFO L112 eAbstractionObserver]: Analyzing ICFG merge_sort-2.i [2024-11-08 13:51:11,553 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 13:51:11,553 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 13:51:11,611 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 13:51:11,617 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;@655b975b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 13:51:11,617 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 13:51:11,621 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-08 13:51:11,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 13:51:11,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:11,626 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:51:11,626 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:11,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:11,632 INFO L85 PathProgramCache]: Analyzing trace with hash 2117458632, now seen corresponding path program 1 times [2024-11-08 13:51:11,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:11,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981410071] [2024-11-08 13:51:11,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:11,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:11,744 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-08 13:51:11,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:11,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981410071] [2024-11-08 13:51:11,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981410071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:51:11,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:51:11,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 13:51:11,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420700431] [2024-11-08 13:51:11,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:51:11,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 13:51:11,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:11,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 13:51:11,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 13:51:11,775 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-08 13:51:11,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:11,801 INFO L93 Difference]: Finished difference Result 188 states and 335 transitions. [2024-11-08 13:51:11,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 13:51:11,803 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-08 13:51:11,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:11,810 INFO L225 Difference]: With dead ends: 188 [2024-11-08 13:51:11,810 INFO L226 Difference]: Without dead ends: 87 [2024-11-08 13:51:11,817 INFO L431 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-08 13:51:11,819 INFO L432 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-08 13:51:11,820 INFO L433 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-08 13:51:11,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-08 13:51:11,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-08 13:51:11,849 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-08 13:51:11,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2024-11-08 13:51:11,853 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 7 [2024-11-08 13:51:11,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:11,854 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2024-11-08 13:51:11,854 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-08 13:51:11,854 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2024-11-08 13:51:11,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 13:51:11,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:11,855 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:51:11,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 13:51:11,855 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:11,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:11,856 INFO L85 PathProgramCache]: Analyzing trace with hash 592840656, now seen corresponding path program 1 times [2024-11-08 13:51:11,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:11,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752393281] [2024-11-08 13:51:11,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:11,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:11,905 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-08 13:51:11,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:11,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752393281] [2024-11-08 13:51:11,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752393281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:51:11,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:51:11,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 13:51:11,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233210916] [2024-11-08 13:51:11,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:51:11,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 13:51:11,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:11,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 13:51:11,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:51:11,912 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-08 13:51:11,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:11,935 INFO L93 Difference]: Finished difference Result 172 states and 218 transitions. [2024-11-08 13:51:11,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 13:51:11,936 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-08 13:51:11,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:11,937 INFO L225 Difference]: With dead ends: 172 [2024-11-08 13:51:11,937 INFO L226 Difference]: Without dead ends: 93 [2024-11-08 13:51:11,938 INFO L431 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-08 13:51:11,939 INFO L432 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-08 13:51:11,939 INFO L433 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-08 13:51:11,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-08 13:51:11,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2024-11-08 13:51:11,946 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-08 13:51:11,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 112 transitions. [2024-11-08 13:51:11,947 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 112 transitions. Word has length 8 [2024-11-08 13:51:11,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:11,948 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 112 transitions. [2024-11-08 13:51:11,948 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-08 13:51:11,948 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 112 transitions. [2024-11-08 13:51:11,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 13:51:11,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:11,949 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:51:11,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 13:51:11,949 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:11,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:11,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1362713671, now seen corresponding path program 1 times [2024-11-08 13:51:11,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:11,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724529680] [2024-11-08 13:51:11,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:11,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:11,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:12,072 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-08 13:51:12,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:12,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724529680] [2024-11-08 13:51:12,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724529680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:51:12,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:51:12,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 13:51:12,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861361392] [2024-11-08 13:51:12,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:51:12,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 13:51:12,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:12,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 13:51:12,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 13:51:12,074 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-08 13:51:12,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:12,153 INFO L93 Difference]: Finished difference Result 146 states and 182 transitions. [2024-11-08 13:51:12,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 13:51:12,153 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-08 13:51:12,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:12,155 INFO L225 Difference]: With dead ends: 146 [2024-11-08 13:51:12,155 INFO L226 Difference]: Without dead ends: 141 [2024-11-08 13:51:12,155 INFO L431 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-08 13:51:12,156 INFO L432 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.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:51:12,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 325 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:51:12,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-08 13:51:12,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 92. [2024-11-08 13:51:12,164 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-08 13:51:12,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 115 transitions. [2024-11-08 13:51:12,165 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 115 transitions. Word has length 14 [2024-11-08 13:51:12,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:12,165 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 115 transitions. [2024-11-08 13:51:12,165 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-08 13:51:12,165 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 115 transitions. [2024-11-08 13:51:12,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 13:51:12,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:12,166 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:51:12,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 13:51:12,167 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:12,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:12,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1343418312, now seen corresponding path program 1 times [2024-11-08 13:51:12,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:12,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922551096] [2024-11-08 13:51:12,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:12,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:12,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:12,306 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-08 13:51:12,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:12,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922551096] [2024-11-08 13:51:12,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922551096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:51:12,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:51:12,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 13:51:12,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34721275] [2024-11-08 13:51:12,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:51:12,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 13:51:12,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:12,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 13:51:12,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 13:51:12,309 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-08 13:51:12,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:12,416 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2024-11-08 13:51:12,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 13:51:12,416 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-08 13:51:12,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:12,417 INFO L225 Difference]: With dead ends: 94 [2024-11-08 13:51:12,417 INFO L226 Difference]: Without dead ends: 91 [2024-11-08 13:51:12,418 INFO L431 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-08 13:51:12,418 INFO L432 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-08 13:51:12,419 INFO L433 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-08 13:51:12,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-08 13:51:12,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-08 13:51:12,425 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-08 13:51:12,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 113 transitions. [2024-11-08 13:51:12,426 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 113 transitions. Word has length 21 [2024-11-08 13:51:12,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:12,426 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 113 transitions. [2024-11-08 13:51:12,426 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-08 13:51:12,426 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 113 transitions. [2024-11-08 13:51:12,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 13:51:12,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:12,427 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:51:12,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 13:51:12,427 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:12,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:12,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1668834302, now seen corresponding path program 1 times [2024-11-08 13:51:12,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:12,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166460322] [2024-11-08 13:51:12,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:12,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:12,511 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-08 13:51:12,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:12,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166460322] [2024-11-08 13:51:12,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166460322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:51:12,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:51:12,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 13:51:12,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612055698] [2024-11-08 13:51:12,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:51:12,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 13:51:12,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:12,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 13:51:12,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 13:51:12,514 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-08 13:51:12,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:12,622 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2024-11-08 13:51:12,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 13:51:12,623 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-08 13:51:12,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:12,624 INFO L225 Difference]: With dead ends: 93 [2024-11-08 13:51:12,624 INFO L226 Difference]: Without dead ends: 90 [2024-11-08 13:51:12,624 INFO L431 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-08 13:51:12,625 INFO L432 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-08 13:51:12,625 INFO L433 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-08 13:51:12,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-08 13:51:12,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-08 13:51:12,639 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-08 13:51:12,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 111 transitions. [2024-11-08 13:51:12,643 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 111 transitions. Word has length 21 [2024-11-08 13:51:12,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:12,644 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 111 transitions. [2024-11-08 13:51:12,644 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-08 13:51:12,644 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 111 transitions. [2024-11-08 13:51:12,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 13:51:12,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:12,644 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:51:12,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 13:51:12,645 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:12,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:12,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1088949268, now seen corresponding path program 1 times [2024-11-08 13:51:12,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:12,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287987447] [2024-11-08 13:51:12,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:12,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:12,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:12,811 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-08 13:51:12,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:12,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287987447] [2024-11-08 13:51:12,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287987447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:51:12,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:51:12,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 13:51:12,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393906298] [2024-11-08 13:51:12,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:51:12,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 13:51:12,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:12,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 13:51:12,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 13:51:12,815 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-08 13:51:12,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:12,965 INFO L93 Difference]: Finished difference Result 141 states and 170 transitions. [2024-11-08 13:51:12,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 13:51:12,965 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-08 13:51:12,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:12,967 INFO L225 Difference]: With dead ends: 141 [2024-11-08 13:51:12,967 INFO L226 Difference]: Without dead ends: 138 [2024-11-08 13:51:12,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-08 13:51:12,969 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 110 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:51:12,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 338 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:51:12,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-08 13:51:12,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 96. [2024-11-08 13:51:12,985 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-08 13:51:12,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 117 transitions. [2024-11-08 13:51:12,986 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 117 transitions. Word has length 24 [2024-11-08 13:51:12,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:12,986 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 117 transitions. [2024-11-08 13:51:12,986 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-08 13:51:12,986 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 117 transitions. [2024-11-08 13:51:12,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 13:51:12,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:12,987 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:51:12,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 13:51:12,987 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:12,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:12,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1875885749, now seen corresponding path program 1 times [2024-11-08 13:51:13,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:13,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8872606] [2024-11-08 13:51:13,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:13,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:13,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:13,087 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-08 13:51:13,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:13,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8872606] [2024-11-08 13:51:13,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8872606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:51:13,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:51:13,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 13:51:13,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431994724] [2024-11-08 13:51:13,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:51:13,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 13:51:13,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:13,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 13:51:13,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 13:51:13,089 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-08 13:51:13,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:13,243 INFO L93 Difference]: Finished difference Result 140 states and 168 transitions. [2024-11-08 13:51:13,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 13:51:13,244 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-08 13:51:13,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:13,245 INFO L225 Difference]: With dead ends: 140 [2024-11-08 13:51:13,245 INFO L226 Difference]: Without dead ends: 137 [2024-11-08 13:51:13,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-08 13:51:13,246 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 108 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:51:13,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 338 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:51:13,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-08 13:51:13,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 102. [2024-11-08 13:51:13,253 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-08 13:51:13,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 123 transitions. [2024-11-08 13:51:13,254 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 123 transitions. Word has length 24 [2024-11-08 13:51:13,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:13,254 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 123 transitions. [2024-11-08 13:51:13,255 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-08 13:51:13,255 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 123 transitions. [2024-11-08 13:51:13,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 13:51:13,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:13,255 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:51:13,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 13:51:13,256 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:13,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:13,256 INFO L85 PathProgramCache]: Analyzing trace with hash 833312565, now seen corresponding path program 1 times [2024-11-08 13:51:13,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:13,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462766366] [2024-11-08 13:51:13,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:13,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:13,487 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-08 13:51:13,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:13,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462766366] [2024-11-08 13:51:13,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462766366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:51:13,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:51:13,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 13:51:13,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820889177] [2024-11-08 13:51:13,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:51:13,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 13:51:13,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:13,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 13:51:13,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 13:51:13,490 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-08 13:51:13,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:13,738 INFO L93 Difference]: Finished difference Result 139 states and 166 transitions. [2024-11-08 13:51:13,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 13:51:13,739 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-08 13:51:13,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:13,740 INFO L225 Difference]: With dead ends: 139 [2024-11-08 13:51:13,740 INFO L226 Difference]: Without dead ends: 136 [2024-11-08 13:51:13,740 INFO L431 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-08 13:51:13,741 INFO L432 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-08 13:51:13,741 INFO L433 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-08 13:51:13,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-08 13:51:13,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 105. [2024-11-08 13:51:13,752 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-08 13:51:13,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 126 transitions. [2024-11-08 13:51:13,753 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 126 transitions. Word has length 27 [2024-11-08 13:51:13,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:13,754 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 126 transitions. [2024-11-08 13:51:13,754 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-08 13:51:13,754 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2024-11-08 13:51:13,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 13:51:13,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:13,755 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:51:13,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 13:51:13,755 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:13,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:13,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1708085365, now seen corresponding path program 1 times [2024-11-08 13:51:13,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:13,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214391470] [2024-11-08 13:51:13,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:13,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:13,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:13,954 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-08 13:51:13,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:13,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214391470] [2024-11-08 13:51:13,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214391470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:51:13,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:51:13,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 13:51:13,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895443731] [2024-11-08 13:51:13,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:51:13,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 13:51:13,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:13,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 13:51:13,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 13:51:13,957 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-08 13:51:14,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:14,224 INFO L93 Difference]: Finished difference Result 138 states and 164 transitions. [2024-11-08 13:51:14,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 13:51:14,225 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-08 13:51:14,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:14,226 INFO L225 Difference]: With dead ends: 138 [2024-11-08 13:51:14,226 INFO L226 Difference]: Without dead ends: 135 [2024-11-08 13:51:14,226 INFO L431 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-08 13:51:14,227 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 102 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-08 13:51:14,227 INFO L433 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-08 13:51:14,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-08 13:51:14,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 108. [2024-11-08 13:51:14,245 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-08 13:51:14,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 129 transitions. [2024-11-08 13:51:14,246 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 129 transitions. Word has length 27 [2024-11-08 13:51:14,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:14,246 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 129 transitions. [2024-11-08 13:51:14,246 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-08 13:51:14,246 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 129 transitions. [2024-11-08 13:51:14,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 13:51:14,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:14,248 INFO L215 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-08 13:51:14,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 13:51:14,248 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:14,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:14,249 INFO L85 PathProgramCache]: Analyzing trace with hash -399551198, now seen corresponding path program 1 times [2024-11-08 13:51:14,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:14,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583537876] [2024-11-08 13:51:14,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:14,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:14,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:14,371 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-08 13:51:14,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:14,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583537876] [2024-11-08 13:51:14,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583537876] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:51:14,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95183052] [2024-11-08 13:51:14,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:14,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:51:14,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:51:14,377 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-08 13:51:14,378 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-08 13:51:14,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:14,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 13:51:14,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:51:14,597 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-08 13:51:14,601 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-08 13:51:14,616 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-08 13:51:14,616 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 13:51:14,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95183052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:51:14,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 13:51:14,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-11-08 13:51:14,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616867542] [2024-11-08 13:51:14,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:51:14,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 13:51:14,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:14,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 13:51:14,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 13:51:14,618 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-08 13:51:14,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:14,843 INFO L93 Difference]: Finished difference Result 110 states and 130 transitions. [2024-11-08 13:51:14,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 13:51:14,844 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-08 13:51:14,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:14,844 INFO L225 Difference]: With dead ends: 110 [2024-11-08 13:51:14,845 INFO L226 Difference]: Without dead ends: 106 [2024-11-08 13:51:14,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 13:51:14,845 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 31 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-11-08 13:51:14,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 287 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 13:51:14,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-08 13:51:14,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-08 13:51:14,853 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-08 13:51:14,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 125 transitions. [2024-11-08 13:51:14,853 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 125 transitions. Word has length 32 [2024-11-08 13:51:14,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:14,854 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 125 transitions. [2024-11-08 13:51:14,854 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-08 13:51:14,854 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 125 transitions. [2024-11-08 13:51:14,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-08 13:51:14,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:14,855 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:51:14,871 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-08 13:51:15,055 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-08 13:51:15,056 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:15,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:15,057 INFO L85 PathProgramCache]: Analyzing trace with hash 2096511862, now seen corresponding path program 1 times [2024-11-08 13:51:15,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:15,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681984604] [2024-11-08 13:51:15,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:15,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:15,134 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-08 13:51:15,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:15,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681984604] [2024-11-08 13:51:15,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681984604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:51:15,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:51:15,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 13:51:15,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103244816] [2024-11-08 13:51:15,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:51:15,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 13:51:15,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:15,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 13:51:15,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 13:51:15,136 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-08 13:51:15,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:15,233 INFO L93 Difference]: Finished difference Result 129 states and 152 transitions. [2024-11-08 13:51:15,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 13:51:15,234 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-08 13:51:15,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:15,234 INFO L225 Difference]: With dead ends: 129 [2024-11-08 13:51:15,234 INFO L226 Difference]: Without dead ends: 126 [2024-11-08 13:51:15,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-08 13:51:15,235 INFO L432 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.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:51:15,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 380 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:51:15,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-08 13:51:15,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 110. [2024-11-08 13:51:15,261 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-08 13:51:15,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 130 transitions. [2024-11-08 13:51:15,262 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 130 transitions. Word has length 33 [2024-11-08 13:51:15,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:15,262 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 130 transitions. [2024-11-08 13:51:15,262 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-08 13:51:15,262 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 130 transitions. [2024-11-08 13:51:15,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 13:51:15,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:15,263 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:51:15,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 13:51:15,263 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:15,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:15,263 INFO L85 PathProgramCache]: Analyzing trace with hash -236025206, now seen corresponding path program 1 times [2024-11-08 13:51:15,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:15,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666938667] [2024-11-08 13:51:15,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:15,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:15,582 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-08 13:51:15,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:15,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666938667] [2024-11-08 13:51:15,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666938667] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:51:15,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481711343] [2024-11-08 13:51:15,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:15,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:51:15,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:51:15,584 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-08 13:51:15,585 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-08 13:51:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:15,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-08 13:51:15,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:51:15,726 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-08 13:51:15,735 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-08 13:51:15,982 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-08 13:51:15,982 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:51:16,149 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-08 13:51:16,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481711343] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:51:16,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:51:16,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 11 [2024-11-08 13:51:16,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743484942] [2024-11-08 13:51:16,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:51:16,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 13:51:16,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:16,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 13:51:16,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-08 13:51:16,151 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-08 13:51:16,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:16,443 INFO L93 Difference]: Finished difference Result 195 states and 225 transitions. [2024-11-08 13:51:16,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 13:51:16,444 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-08 13:51:16,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:16,445 INFO L225 Difference]: With dead ends: 195 [2024-11-08 13:51:16,445 INFO L226 Difference]: Without dead ends: 192 [2024-11-08 13:51:16,445 INFO L431 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-08 13:51:16,446 INFO L432 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-08 13:51:16,446 INFO L433 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-08 13:51:16,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-08 13:51:16,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 174. [2024-11-08 13:51:16,463 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-08 13:51:16,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 202 transitions. [2024-11-08 13:51:16,464 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 202 transitions. Word has length 36 [2024-11-08 13:51:16,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:16,464 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 202 transitions. [2024-11-08 13:51:16,464 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-08 13:51:16,465 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 202 transitions. [2024-11-08 13:51:16,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 13:51:16,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:16,466 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:51:16,484 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-08 13:51:16,669 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-08 13:51:16,670 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:16,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:16,671 INFO L85 PathProgramCache]: Analyzing trace with hash -73182161, now seen corresponding path program 1 times [2024-11-08 13:51:16,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:16,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305145250] [2024-11-08 13:51:16,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:16,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:16,947 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-08 13:51:16,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:16,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305145250] [2024-11-08 13:51:16,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305145250] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:51:16,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304236922] [2024-11-08 13:51:16,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:16,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:51:16,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:51:16,950 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-08 13:51:16,963 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-08 13:51:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:17,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-08 13:51:17,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:51:17,124 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-08 13:51:17,132 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-08 13:51:17,221 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-08 13:51:17,242 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-08 13:51:17,242 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:51:17,363 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-08 13:51:17,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304236922] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:51:17,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:51:17,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 13 [2024-11-08 13:51:17,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531338728] [2024-11-08 13:51:17,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:51:17,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 13:51:17,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:17,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 13:51:17,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-08 13:51:17,367 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-08 13:51:17,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:17,586 INFO L93 Difference]: Finished difference Result 242 states and 285 transitions. [2024-11-08 13:51:17,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 13:51:17,587 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-08 13:51:17,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:17,588 INFO L225 Difference]: With dead ends: 242 [2024-11-08 13:51:17,588 INFO L226 Difference]: Without dead ends: 154 [2024-11-08 13:51:17,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-11-08 13:51:17,589 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 62 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-08 13:51:17,589 INFO L433 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-08 13:51:17,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-08 13:51:17,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 140. [2024-11-08 13:51:17,599 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-08 13:51:17,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 162 transitions. [2024-11-08 13:51:17,600 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 162 transitions. Word has length 38 [2024-11-08 13:51:17,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:17,600 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 162 transitions. [2024-11-08 13:51:17,601 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-08 13:51:17,601 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 162 transitions. [2024-11-08 13:51:17,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 13:51:17,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:17,601 INFO L215 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-08 13:51:17,614 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-08 13:51:17,802 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-08 13:51:17,802 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:17,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:17,803 INFO L85 PathProgramCache]: Analyzing trace with hash 490774162, now seen corresponding path program 1 times [2024-11-08 13:51:17,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:17,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561075100] [2024-11-08 13:51:17,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:17,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:17,863 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-08 13:51:17,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:17,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561075100] [2024-11-08 13:51:17,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561075100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:51:17,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:51:17,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 13:51:17,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863785595] [2024-11-08 13:51:17,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:51:17,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 13:51:17,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:17,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 13:51:17,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 13:51:17,865 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-08 13:51:17,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:17,914 INFO L93 Difference]: Finished difference Result 210 states and 256 transitions. [2024-11-08 13:51:17,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 13:51:17,915 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-08 13:51:17,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:17,916 INFO L225 Difference]: With dead ends: 210 [2024-11-08 13:51:17,916 INFO L226 Difference]: Without dead ends: 169 [2024-11-08 13:51:17,917 INFO L431 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-08 13:51:17,917 INFO L432 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.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:51:17,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 371 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:51:17,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-08 13:51:17,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 141. [2024-11-08 13:51:17,928 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-08 13:51:17,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 163 transitions. [2024-11-08 13:51:17,928 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 163 transitions. Word has length 38 [2024-11-08 13:51:17,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:17,929 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 163 transitions. [2024-11-08 13:51:17,929 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-08 13:51:17,929 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 163 transitions. [2024-11-08 13:51:17,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 13:51:17,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:17,930 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:51:17,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 13:51:17,930 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:17,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:17,930 INFO L85 PathProgramCache]: Analyzing trace with hash -557560349, now seen corresponding path program 1 times [2024-11-08 13:51:17,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:17,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222050956] [2024-11-08 13:51:17,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:17,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:18,065 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-08 13:51:18,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:18,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222050956] [2024-11-08 13:51:18,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222050956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:51:18,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:51:18,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 13:51:18,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087829026] [2024-11-08 13:51:18,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:51:18,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 13:51:18,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:18,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 13:51:18,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 13:51:18,067 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-08 13:51:18,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:18,228 INFO L93 Difference]: Finished difference Result 163 states and 187 transitions. [2024-11-08 13:51:18,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 13:51:18,228 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-08 13:51:18,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:18,229 INFO L225 Difference]: With dead ends: 163 [2024-11-08 13:51:18,229 INFO L226 Difference]: Without dead ends: 160 [2024-11-08 13:51:18,230 INFO L431 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-08 13:51:18,231 INFO L432 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-08 13:51:18,231 INFO L433 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-08 13:51:18,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-08 13:51:18,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 147. [2024-11-08 13:51:18,243 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-08 13:51:18,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 170 transitions. [2024-11-08 13:51:18,244 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 170 transitions. Word has length 39 [2024-11-08 13:51:18,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:18,244 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 170 transitions. [2024-11-08 13:51:18,244 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-08 13:51:18,244 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 170 transitions. [2024-11-08 13:51:18,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 13:51:18,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:18,246 INFO L215 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-08 13:51:18,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 13:51:18,246 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:18,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:18,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1187191264, now seen corresponding path program 1 times [2024-11-08 13:51:18,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:18,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387947397] [2024-11-08 13:51:18,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:18,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:18,350 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-08 13:51:18,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:18,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387947397] [2024-11-08 13:51:18,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387947397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:51:18,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:51:18,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 13:51:18,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399776751] [2024-11-08 13:51:18,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:51:18,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 13:51:18,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:18,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 13:51:18,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 13:51:18,352 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-08 13:51:18,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:18,483 INFO L93 Difference]: Finished difference Result 245 states and 304 transitions. [2024-11-08 13:51:18,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 13:51:18,484 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-08 13:51:18,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:18,485 INFO L225 Difference]: With dead ends: 245 [2024-11-08 13:51:18,485 INFO L226 Difference]: Without dead ends: 204 [2024-11-08 13:51:18,485 INFO L431 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-08 13:51:18,485 INFO L432 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-08 13:51:18,485 INFO L433 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-08 13:51:18,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-08 13:51:18,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 166. [2024-11-08 13:51:18,496 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-08 13:51:18,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 199 transitions. [2024-11-08 13:51:18,498 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 199 transitions. Word has length 39 [2024-11-08 13:51:18,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:18,499 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 199 transitions. [2024-11-08 13:51:18,499 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-08 13:51:18,499 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 199 transitions. [2024-11-08 13:51:18,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 13:51:18,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:18,500 INFO L215 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-08 13:51:18,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 13:51:18,500 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:18,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:18,501 INFO L85 PathProgramCache]: Analyzing trace with hash -294674701, now seen corresponding path program 2 times [2024-11-08 13:51:18,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:18,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107724484] [2024-11-08 13:51:18,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:18,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:18,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:18,966 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 13:51:18,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:18,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107724484] [2024-11-08 13:51:18,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107724484] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:51:18,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727534559] [2024-11-08 13:51:18,967 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 13:51:18,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:51:18,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:51:18,969 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-08 13:51:18,971 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-08 13:51:19,061 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-08 13:51:19,061 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 13:51:19,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-08 13:51:19,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:51:19,117 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-08 13:51:19,118 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 13:51:19,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727534559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:51:19,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 13:51:19,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 14 [2024-11-08 13:51:19,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830272437] [2024-11-08 13:51:19,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:51:19,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 13:51:19,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:19,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 13:51:19,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-08 13:51:19,119 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-08 13:51:19,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:19,270 INFO L93 Difference]: Finished difference Result 168 states and 200 transitions. [2024-11-08 13:51:19,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 13:51:19,271 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-08 13:51:19,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:19,271 INFO L225 Difference]: With dead ends: 168 [2024-11-08 13:51:19,272 INFO L226 Difference]: Without dead ends: 165 [2024-11-08 13:51:19,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2024-11-08 13:51:19,272 INFO L432 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-08 13:51:19,273 INFO L433 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-08 13:51:19,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-08 13:51:19,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 146. [2024-11-08 13:51:19,281 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-08 13:51:19,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 176 transitions. [2024-11-08 13:51:19,282 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 176 transitions. Word has length 42 [2024-11-08 13:51:19,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:19,282 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 176 transitions. [2024-11-08 13:51:19,282 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-08 13:51:19,282 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 176 transitions. [2024-11-08 13:51:19,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-08 13:51:19,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:19,283 INFO L215 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-08 13:51:19,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 13:51:19,483 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-08 13:51:19,483 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:19,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:19,484 INFO L85 PathProgramCache]: Analyzing trace with hash -600772008, now seen corresponding path program 2 times [2024-11-08 13:51:19,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:19,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259224943] [2024-11-08 13:51:19,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:19,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:19,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:19,991 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-08 13:51:19,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:19,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259224943] [2024-11-08 13:51:19,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259224943] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:51:19,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179107884] [2024-11-08 13:51:19,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 13:51:19,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:51:19,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:51:19,993 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-08 13:51:19,994 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-08 13:51:20,096 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 13:51:20,097 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 13:51:20,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-08 13:51:20,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:51:20,129 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-08 13:51:20,183 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-08 13:51:20,189 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-08 13:51:20,236 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 13:51:20,236 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-08 13:51:20,295 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-08 13:51:20,303 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-08 13:51:20,320 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-08 13:51:20,321 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-08 13:51:20,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-08 13:51:20,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-08 13:51:20,872 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:51:20,873 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:51:21,324 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:51:21,325 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-08 13:51:21,327 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:51:21,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:51:21,332 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-08 13:51:21,337 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-08 13:51:21,363 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-08 13:51:21,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:51:21,442 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-08 13:51:21,445 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:51:21,450 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:51:21,450 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-08 13:51:21,455 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-08 13:51:21,466 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-08 13:51:21,481 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-08 13:51:21,730 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:51:21,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179107884] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:51:21,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:51:21,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 29 [2024-11-08 13:51:21,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414887230] [2024-11-08 13:51:21,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:51:21,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-08 13:51:21,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:21,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-08 13:51:21,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=743, Unknown=1, NotChecked=0, Total=812 [2024-11-08 13:51:21,732 INFO L87 Difference]: Start difference. First operand 146 states and 176 transitions. Second operand has 29 states, 29 states have (on average 4.0344827586206895) internal successors, (117), 29 states have internal predecessors, (117), 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-08 13:51:23,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:23,618 INFO L93 Difference]: Finished difference Result 392 states and 464 transitions. [2024-11-08 13:51:23,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-08 13:51:23,619 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 4.0344827586206895) internal successors, (117), 29 states have internal predecessors, (117), 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-08 13:51:23,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:23,627 INFO L225 Difference]: With dead ends: 392 [2024-11-08 13:51:23,627 INFO L226 Difference]: Without dead ends: 288 [2024-11-08 13:51:23,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=279, Invalid=2170, Unknown=1, NotChecked=0, Total=2450 [2024-11-08 13:51:23,632 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 789 mSDsluCounter, 1876 mSDsCounter, 0 mSdLazyCounter, 1406 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 1982 SdHoareTripleChecker+Invalid, 1421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:51:23,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 1982 Invalid, 1421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1406 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 13:51:23,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-08 13:51:23,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 182. [2024-11-08 13:51:23,657 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-08 13:51:23,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 215 transitions. [2024-11-08 13:51:23,658 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 215 transitions. Word has length 44 [2024-11-08 13:51:23,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:23,659 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 215 transitions. [2024-11-08 13:51:23,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.0344827586206895) internal successors, (117), 29 states have internal predecessors, (117), 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-08 13:51:23,659 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 215 transitions. [2024-11-08 13:51:23,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-08 13:51:23,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:23,660 INFO L215 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-08 13:51:23,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 13:51:23,863 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-08 13:51:23,864 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:23,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:23,865 INFO L85 PathProgramCache]: Analyzing trace with hash 186164473, now seen corresponding path program 1 times [2024-11-08 13:51:23,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:23,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509893315] [2024-11-08 13:51:23,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:23,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:24,476 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-08 13:51:24,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:24,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509893315] [2024-11-08 13:51:24,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509893315] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:51:24,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466865063] [2024-11-08 13:51:24,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:24,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:51:24,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:51:24,480 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-08 13:51:24,482 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-08 13:51:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:24,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-08 13:51:24,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:51:24,640 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-08 13:51:24,672 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-08 13:51:24,695 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 13:51:24,695 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-08 13:51:24,739 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-08 13:51:24,757 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-08 13:51:24,758 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-08 13:51:24,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2024-11-08 13:51:24,805 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-08 13:51:25,005 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-08 13:51:25,111 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 13:51:25,111 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 52 treesize of output 23 [2024-11-08 13:51:25,113 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-08 13:51:25,113 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:51:25,204 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.base_21| Int) (v_ArrVal_726 (Array Int Int))) (or (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_726))) (store .cse0 |v_ULTIMATE.start_main_~item~0#1.base_21| (store (store (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_21|) 0 |c_ULTIMATE.start_main_~node~1#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_21|) 0)))) is different from false [2024-11-08 13:51:25,260 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:51:25,260 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 51 treesize of output 44 [2024-11-08 13:51:25,262 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:51:25,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:51:25,266 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 81 treesize of output 81 [2024-11-08 13:51:25,270 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 66 treesize of output 64 [2024-11-08 13:51:25,299 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 134 treesize of output 126 [2024-11-08 13:51:25,518 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-08 13:51:25,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466865063] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:51:25,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:51:25,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 26 [2024-11-08 13:51:25,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434942234] [2024-11-08 13:51:25,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:51:25,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-08 13:51:25,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:25,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-08 13:51:25,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=528, Unknown=1, NotChecked=46, Total=650 [2024-11-08 13:51:25,520 INFO L87 Difference]: Start difference. First operand 182 states and 215 transitions. Second operand has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 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-08 13:51:26,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:26,476 INFO L93 Difference]: Finished difference Result 244 states and 282 transitions. [2024-11-08 13:51:26,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 13:51:26,477 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 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-08 13:51:26,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:26,478 INFO L225 Difference]: With dead ends: 244 [2024-11-08 13:51:26,478 INFO L226 Difference]: Without dead ends: 241 [2024-11-08 13:51:26,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=202, Invalid=1061, Unknown=1, NotChecked=68, Total=1332 [2024-11-08 13:51:26,479 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 286 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 184 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 13:51:26,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 1312 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 945 Invalid, 0 Unknown, 184 Unchecked, 0.6s Time] [2024-11-08 13:51:26,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-08 13:51:26,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 189. [2024-11-08 13:51:26,497 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-08 13:51:26,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 222 transitions. [2024-11-08 13:51:26,498 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 222 transitions. Word has length 44 [2024-11-08 13:51:26,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:26,498 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 222 transitions. [2024-11-08 13:51:26,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 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-08 13:51:26,498 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 222 transitions. [2024-11-08 13:51:26,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 13:51:26,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:26,498 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:51:26,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-08 13:51:26,702 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-08 13:51:26,703 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:26,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:26,703 INFO L85 PathProgramCache]: Analyzing trace with hash -498608817, now seen corresponding path program 1 times [2024-11-08 13:51:26,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:26,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044998760] [2024-11-08 13:51:26,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:26,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:26,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:26,753 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-08 13:51:26,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:26,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044998760] [2024-11-08 13:51:26,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044998760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:51:26,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:51:26,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 13:51:26,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475313928] [2024-11-08 13:51:26,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:51:26,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 13:51:26,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:26,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 13:51:26,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 13:51:26,755 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-08 13:51:26,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:26,860 INFO L93 Difference]: Finished difference Result 191 states and 223 transitions. [2024-11-08 13:51:26,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 13:51:26,861 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-08 13:51:26,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:26,862 INFO L225 Difference]: With dead ends: 191 [2024-11-08 13:51:26,862 INFO L226 Difference]: Without dead ends: 173 [2024-11-08 13:51:26,862 INFO L431 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-08 13:51:26,863 INFO L432 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-08 13:51:26,863 INFO L433 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-08 13:51:26,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-08 13:51:26,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2024-11-08 13:51:26,891 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-08 13:51:26,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 203 transitions. [2024-11-08 13:51:26,891 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 203 transitions. Word has length 45 [2024-11-08 13:51:26,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:26,891 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 203 transitions. [2024-11-08 13:51:26,892 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-08 13:51:26,892 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 203 transitions. [2024-11-08 13:51:26,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 13:51:26,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:26,892 INFO L215 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-08 13:51:26,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 13:51:26,892 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:26,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:26,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1371065139, now seen corresponding path program 1 times [2024-11-08 13:51:26,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:26,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124191200] [2024-11-08 13:51:26,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:26,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:27,098 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-08 13:51:27,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:27,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124191200] [2024-11-08 13:51:27,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124191200] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:51:27,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374051725] [2024-11-08 13:51:27,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:27,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:51:27,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:51:27,100 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-08 13:51:27,100 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-08 13:51:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:27,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-08 13:51:27,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:51:27,232 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-08 13:51:27,298 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-08 13:51:27,356 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-08 13:51:27,358 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-08 13:51:27,358 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 13:51:27,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374051725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:51:27,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 13:51:27,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 16 [2024-11-08 13:51:27,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434631135] [2024-11-08 13:51:27,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:51:27,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 13:51:27,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:27,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 13:51:27,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-08 13:51:27,359 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-08 13:51:27,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:27,623 INFO L93 Difference]: Finished difference Result 214 states and 261 transitions. [2024-11-08 13:51:27,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 13:51:27,623 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-08 13:51:27,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:27,624 INFO L225 Difference]: With dead ends: 214 [2024-11-08 13:51:27,624 INFO L226 Difference]: Without dead ends: 203 [2024-11-08 13:51:27,625 INFO L431 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-08 13:51:27,625 INFO L432 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-08 13:51:27,625 INFO L433 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-08 13:51:27,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-08 13:51:27,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 183. [2024-11-08 13:51:27,641 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-08 13:51:27,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 217 transitions. [2024-11-08 13:51:27,642 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 217 transitions. Word has length 45 [2024-11-08 13:51:27,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:27,642 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 217 transitions. [2024-11-08 13:51:27,642 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-08 13:51:27,642 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 217 transitions. [2024-11-08 13:51:27,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-08 13:51:27,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:27,643 INFO L215 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-08 13:51:27,655 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-08 13:51:27,846 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-08 13:51:27,846 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:27,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:27,847 INFO L85 PathProgramCache]: Analyzing trace with hash -762728988, now seen corresponding path program 1 times [2024-11-08 13:51:27,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:27,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83805519] [2024-11-08 13:51:27,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:27,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:27,889 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-08 13:51:27,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:27,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83805519] [2024-11-08 13:51:27,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83805519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:51:27,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:51:27,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 13:51:27,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554235351] [2024-11-08 13:51:27,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:51:27,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 13:51:27,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:27,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 13:51:27,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:51:27,890 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-08 13:51:27,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:27,945 INFO L93 Difference]: Finished difference Result 250 states and 310 transitions. [2024-11-08 13:51:27,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 13:51:27,946 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-08 13:51:27,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:27,947 INFO L225 Difference]: With dead ends: 250 [2024-11-08 13:51:27,947 INFO L226 Difference]: Without dead ends: 186 [2024-11-08 13:51:27,947 INFO L431 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-08 13:51:27,947 INFO L432 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-08 13:51:27,948 INFO L433 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-08 13:51:27,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-08 13:51:27,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2024-11-08 13:51:27,965 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-08 13:51:27,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 219 transitions. [2024-11-08 13:51:27,966 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 219 transitions. Word has length 46 [2024-11-08 13:51:27,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:27,967 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 219 transitions. [2024-11-08 13:51:27,967 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-08 13:51:27,967 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 219 transitions. [2024-11-08 13:51:27,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-08 13:51:27,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:27,967 INFO L215 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-08 13:51:27,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 13:51:27,968 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:27,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:27,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1773846238, now seen corresponding path program 1 times [2024-11-08 13:51:27,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:27,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020044726] [2024-11-08 13:51:27,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:27,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:27,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:28,086 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-08 13:51:28,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:28,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020044726] [2024-11-08 13:51:28,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020044726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:51:28,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:51:28,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 13:51:28,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228932330] [2024-11-08 13:51:28,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:51:28,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 13:51:28,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:28,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 13:51:28,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 13:51:28,088 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-08 13:51:28,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:28,181 INFO L93 Difference]: Finished difference Result 231 states and 283 transitions. [2024-11-08 13:51:28,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 13:51:28,181 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-08 13:51:28,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:28,182 INFO L225 Difference]: With dead ends: 231 [2024-11-08 13:51:28,182 INFO L226 Difference]: Without dead ends: 198 [2024-11-08 13:51:28,182 INFO L431 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-08 13:51:28,183 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 78 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-08 13:51:28,183 INFO L433 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-08 13:51:28,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-08 13:51:28,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 164. [2024-11-08 13:51:28,203 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-08 13:51:28,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 187 transitions. [2024-11-08 13:51:28,204 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 187 transitions. Word has length 46 [2024-11-08 13:51:28,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:28,205 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 187 transitions. [2024-11-08 13:51:28,205 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-08 13:51:28,205 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 187 transitions. [2024-11-08 13:51:28,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-08 13:51:28,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:28,205 INFO L215 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-08 13:51:28,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-08 13:51:28,206 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:28,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:28,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1117057735, now seen corresponding path program 1 times [2024-11-08 13:51:28,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:28,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280341062] [2024-11-08 13:51:28,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:28,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:29,419 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-08 13:51:29,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:29,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280341062] [2024-11-08 13:51:29,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280341062] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:51:29,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114712708] [2024-11-08 13:51:29,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:29,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:51:29,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:51:29,421 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-08 13:51:29,422 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-08 13:51:29,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:29,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-11-08 13:51:29,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:51:29,554 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-08 13:51:29,563 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-08 13:51:29,566 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-08 13:51:29,579 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 13:51:29,579 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-08 13:51:29,607 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-08 13:51:29,610 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-08 13:51:29,675 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2024-11-08 13:51:29,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 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-08 13:51:29,815 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-08 13:51:29,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 49 [2024-11-08 13:51:29,835 INFO L349 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2024-11-08 13:51:29,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 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-08 13:51:29,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2024-11-08 13:51:29,961 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2024-11-08 13:51:29,962 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 52 [2024-11-08 13:51:29,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 61 [2024-11-08 13:51:30,826 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-08 13:51:30,827 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:51:36,140 INFO L349 Elim1Store]: treesize reduction 71, result has 82.1 percent of original size [2024-11-08 13:51:36,142 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 6865054 treesize of output 6648412 [2024-11-08 13:51:37,306 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:51:37,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 48979438 treesize of output 48516676 [2024-11-08 13:51:45,363 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 4420 DAG size of output: 875 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 13:51:45,455 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-08 13:51:45,456 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 12240 treesize of output 11316 [2024-11-08 13:51:47,044 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 10324 treesize of output 9780