./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e8d55036 Calling Ultimate with: /usr/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/list-simple/sll2c_prepend_equal.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.graphml --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 f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 19:48:16,735 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 19:48:16,738 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 19:48:16,791 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 19:48:16,791 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 19:48:16,794 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 19:48:16,796 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 19:48:16,799 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 19:48:16,802 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 19:48:16,805 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 19:48:16,806 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 19:48:16,808 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 19:48:16,809 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 19:48:16,810 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 19:48:16,811 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 19:48:16,812 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 19:48:16,813 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 19:48:16,814 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 19:48:16,815 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 19:48:16,818 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 19:48:16,820 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 19:48:16,821 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 19:48:16,821 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 19:48:16,822 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 19:48:16,828 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 19:48:16,830 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 19:48:16,830 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 19:48:16,831 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 19:48:16,831 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 19:48:16,834 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 19:48:16,834 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 19:48:16,834 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 19:48:16,836 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 19:48:16,836 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 19:48:16,837 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 19:48:16,837 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 19:48:16,838 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 19:48:16,838 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 19:48:16,838 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 19:48:16,839 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 19:48:16,840 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 19:48:16,841 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 19:48:16,871 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 19:48:16,872 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 19:48:16,872 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 19:48:16,876 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 19:48:16,877 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 19:48:16,877 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 19:48:16,878 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 19:48:16,878 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 19:48:16,878 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 19:48:16,878 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 19:48:16,879 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 19:48:16,879 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 19:48:16,879 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 19:48:16,880 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 19:48:16,880 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 19:48:16,880 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 19:48:16,880 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 19:48:16,880 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 19:48:16,880 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 19:48:16,880 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 19:48:16,881 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 19:48:16,881 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 19:48:16,881 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 19:48:16,881 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 19:48:16,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:48:16,882 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 19:48:16,882 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 19:48:16,882 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 19:48:16,882 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 19:48:16,882 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 19:48:16,882 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 19:48:16,883 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 19:48:16,883 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 19:48:16,883 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 19:48:16,883 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 19:48:16,883 INFO L138 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.graphml 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 -> f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 [2023-02-15 19:48:17,141 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 19:48:17,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 19:48:17,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 19:48:17,168 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 19:48:17,168 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 19:48:17,169 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2023-02-15 19:48:18,244 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 19:48:18,487 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 19:48:18,488 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2023-02-15 19:48:18,497 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/500098fb9/1665a2d963764cb4a0f3a48a227d24ef/FLAG211948abd [2023-02-15 19:48:18,508 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/500098fb9/1665a2d963764cb4a0f3a48a227d24ef [2023-02-15 19:48:18,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 19:48:18,511 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 19:48:18,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 19:48:18,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 19:48:18,515 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 19:48:18,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:48:18" (1/1) ... [2023-02-15 19:48:18,516 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f656ba4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:48:18, skipping insertion in model container [2023-02-15 19:48:18,517 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:48:18" (1/1) ... [2023-02-15 19:48:18,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 19:48:18,545 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 19:48:18,820 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2023-02-15 19:48:18,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:48:18,841 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 19:48:18,907 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2023-02-15 19:48:18,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:48:18,946 INFO L208 MainTranslator]: Completed translation [2023-02-15 19:48:18,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:48:18 WrapperNode [2023-02-15 19:48:18,947 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 19:48:18,948 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 19:48:18,948 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 19:48:18,948 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 19:48:18,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:48:18" (1/1) ... [2023-02-15 19:48:18,971 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:48:18" (1/1) ... [2023-02-15 19:48:18,998 INFO L138 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 137 [2023-02-15 19:48:18,998 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 19:48:18,999 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 19:48:18,999 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 19:48:19,000 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 19:48:19,007 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:48:18" (1/1) ... [2023-02-15 19:48:19,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:48:18" (1/1) ... [2023-02-15 19:48:19,011 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:48:18" (1/1) ... [2023-02-15 19:48:19,011 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:48:18" (1/1) ... [2023-02-15 19:48:19,017 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:48:18" (1/1) ... [2023-02-15 19:48:19,020 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:48:18" (1/1) ... [2023-02-15 19:48:19,022 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:48:18" (1/1) ... [2023-02-15 19:48:19,024 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:48:18" (1/1) ... [2023-02-15 19:48:19,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 19:48:19,027 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 19:48:19,027 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 19:48:19,027 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 19:48:19,028 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:48:18" (1/1) ... [2023-02-15 19:48:19,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:48:19,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:48:19,063 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 19:48:19,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 19:48:19,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 19:48:19,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 19:48:19,110 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-15 19:48:19,110 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-15 19:48:19,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 19:48:19,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 19:48:19,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 19:48:19,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 19:48:19,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 19:48:19,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 19:48:19,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 19:48:19,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 19:48:19,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 19:48:19,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 19:48:19,218 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 19:48:19,219 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 19:48:19,472 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 19:48:19,477 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 19:48:19,478 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-15 19:48:19,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:48:19 BoogieIcfgContainer [2023-02-15 19:48:19,479 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 19:48:19,481 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 19:48:19,481 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 19:48:19,484 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 19:48:19,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 07:48:18" (1/3) ... [2023-02-15 19:48:19,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d96737f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:48:19, skipping insertion in model container [2023-02-15 19:48:19,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:48:18" (2/3) ... [2023-02-15 19:48:19,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d96737f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:48:19, skipping insertion in model container [2023-02-15 19:48:19,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:48:19" (3/3) ... [2023-02-15 19:48:19,487 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_equal.i [2023-02-15 19:48:19,505 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 19:48:19,505 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 19:48:19,540 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 19:48:19,546 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@2b21a6b9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 19:48:19,546 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 19:48:19,549 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 19:48:19,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 19:48:19,556 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:48:19,556 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:48:19,557 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:48:19,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:48:19,560 INFO L85 PathProgramCache]: Analyzing trace with hash -483023916, now seen corresponding path program 1 times [2023-02-15 19:48:19,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:48:19,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499041341] [2023-02-15 19:48:19,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:48:19,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:48:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:19,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 19:48:19,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:19,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 19:48:19,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:19,933 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 19:48:19,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:48:19,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499041341] [2023-02-15 19:48:19,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499041341] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:48:19,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:48:19,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:48:19,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858177484] [2023-02-15 19:48:19,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:48:19,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:48:19,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:48:19,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:48:19,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:48:19,992 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 19:48:20,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:48:20,074 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2023-02-15 19:48:20,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:48:20,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2023-02-15 19:48:20,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:48:20,083 INFO L225 Difference]: With dead ends: 65 [2023-02-15 19:48:20,083 INFO L226 Difference]: Without dead ends: 28 [2023-02-15 19:48:20,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:48:20,092 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:48:20,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:48:20,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-02-15 19:48:20,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-02-15 19:48:20,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 19:48:20,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2023-02-15 19:48:20,133 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2023-02-15 19:48:20,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:48:20,134 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2023-02-15 19:48:20,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 19:48:20,134 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2023-02-15 19:48:20,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 19:48:20,136 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:48:20,136 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:48:20,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 19:48:20,137 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:48:20,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:48:20,138 INFO L85 PathProgramCache]: Analyzing trace with hash -938400178, now seen corresponding path program 1 times [2023-02-15 19:48:20,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:48:20,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753017635] [2023-02-15 19:48:20,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:48:20,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:48:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:20,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 19:48:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:20,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 19:48:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:20,370 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 19:48:20,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:48:20,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753017635] [2023-02-15 19:48:20,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753017635] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:48:20,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:48:20,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 19:48:20,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239037987] [2023-02-15 19:48:20,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:48:20,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 19:48:20,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:48:20,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 19:48:20,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 19:48:20,376 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 19:48:20,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:48:20,433 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2023-02-15 19:48:20,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 19:48:20,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2023-02-15 19:48:20,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:48:20,438 INFO L225 Difference]: With dead ends: 52 [2023-02-15 19:48:20,438 INFO L226 Difference]: Without dead ends: 31 [2023-02-15 19:48:20,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 19:48:20,444 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:48:20,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 73 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:48:20,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-15 19:48:20,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-02-15 19:48:20,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 19:48:20,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2023-02-15 19:48:20,455 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 24 [2023-02-15 19:48:20,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:48:20,456 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-02-15 19:48:20,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 19:48:20,456 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2023-02-15 19:48:20,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 19:48:20,457 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:48:20,457 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:48:20,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 19:48:20,458 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:48:20,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:48:20,458 INFO L85 PathProgramCache]: Analyzing trace with hash 436872902, now seen corresponding path program 1 times [2023-02-15 19:48:20,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:48:20,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218646580] [2023-02-15 19:48:20,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:48:20,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:48:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:20,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 19:48:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:20,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:48:20,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:20,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 19:48:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:21,067 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 19:48:21,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:48:21,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218646580] [2023-02-15 19:48:21,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218646580] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:48:21,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904496785] [2023-02-15 19:48:21,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:48:21,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:48:21,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:48:21,072 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) [2023-02-15 19:48:21,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 19:48:21,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:21,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-15 19:48:21,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:48:21,507 INFO L350 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 8 treesize of output 4 [2023-02-15 19:48:21,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:48:21,647 INFO L350 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 15 treesize of output 17 [2023-02-15 19:48:21,686 INFO L350 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 [2023-02-15 19:48:21,702 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 19:48:21,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:48:21,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904496785] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:48:21,829 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:48:21,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2023-02-15 19:48:21,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126554820] [2023-02-15 19:48:21,829 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:48:21,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-15 19:48:21,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:48:21,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-15 19:48:21,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=516, Unknown=9, NotChecked=0, Total=600 [2023-02-15 19:48:21,835 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 17 states have internal predecessors, (40), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 19:48:22,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:48:22,229 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2023-02-15 19:48:22,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 19:48:22,229 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 17 states have internal predecessors, (40), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 32 [2023-02-15 19:48:22,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:48:22,230 INFO L225 Difference]: With dead ends: 39 [2023-02-15 19:48:22,230 INFO L226 Difference]: Without dead ends: 31 [2023-02-15 19:48:22,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=833, Unknown=9, NotChecked=0, Total=992 [2023-02-15 19:48:22,232 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 100 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 19:48:22,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 178 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 19:48:22,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-15 19:48:22,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-02-15 19:48:22,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 19:48:22,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2023-02-15 19:48:22,238 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 32 [2023-02-15 19:48:22,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:48:22,238 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-02-15 19:48:22,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 17 states have internal predecessors, (40), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 19:48:22,239 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2023-02-15 19:48:22,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-15 19:48:22,240 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:48:22,240 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:48:22,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 19:48:22,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:48:22,447 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:48:22,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:48:22,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1205420011, now seen corresponding path program 1 times [2023-02-15 19:48:22,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:48:22,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410823612] [2023-02-15 19:48:22,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:48:22,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:48:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:23,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 19:48:23,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:23,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:48:23,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:23,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 19:48:23,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:23,503 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 19:48:23,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:48:23,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410823612] [2023-02-15 19:48:23,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410823612] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:48:23,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996964005] [2023-02-15 19:48:23,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:48:23,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:48:23,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:48:23,506 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) [2023-02-15 19:48:23,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 19:48:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:23,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 91 conjunts are in the unsatisfiable core [2023-02-15 19:48:23,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:48:23,689 INFO L350 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 [2023-02-15 19:48:23,897 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:48:23,898 INFO L350 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 [2023-02-15 19:48:23,948 INFO L350 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 11 treesize of output 7 [2023-02-15 19:48:24,020 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 19:48:24,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-02-15 19:48:24,118 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 19:48:24,119 INFO L350 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 22 [2023-02-15 19:48:24,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 19:48:24,134 INFO L350 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 [2023-02-15 19:48:24,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:48:24,269 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 19:48:24,272 INFO L350 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 53 treesize of output 51 [2023-02-15 19:48:24,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:48:24,278 INFO L350 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 51 treesize of output 49 [2023-02-15 19:48:24,295 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2023-02-15 19:48:24,296 INFO L350 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 32 treesize of output 34 [2023-02-15 19:48:24,381 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2023-02-15 19:48:24,423 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 19:48:24,424 INFO L350 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 18 [2023-02-15 19:48:24,446 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:48:24,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:48:24,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996964005] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:48:24,622 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:48:24,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 35 [2023-02-15 19:48:24,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218959146] [2023-02-15 19:48:24,623 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:48:24,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-15 19:48:24,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:48:24,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-15 19:48:24,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1283, Unknown=0, NotChecked=0, Total=1406 [2023-02-15 19:48:24,625 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 35 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 27 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 19:48:26,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:48:26,087 INFO L93 Difference]: Finished difference Result 66 states and 83 transitions. [2023-02-15 19:48:26,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 19:48:26,088 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 27 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 35 [2023-02-15 19:48:26,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:48:26,089 INFO L225 Difference]: With dead ends: 66 [2023-02-15 19:48:26,089 INFO L226 Difference]: Without dead ends: 57 [2023-02-15 19:48:26,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=304, Invalid=2246, Unknown=0, NotChecked=0, Total=2550 [2023-02-15 19:48:26,091 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 112 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 19:48:26,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 308 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 19:48:26,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-02-15 19:48:26,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 42. [2023-02-15 19:48:26,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 19:48:26,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2023-02-15 19:48:26,100 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 35 [2023-02-15 19:48:26,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:48:26,101 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2023-02-15 19:48:26,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 27 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 19:48:26,101 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2023-02-15 19:48:26,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 19:48:26,102 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:48:26,102 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:48:26,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 19:48:26,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-02-15 19:48:26,309 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:48:26,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:48:26,310 INFO L85 PathProgramCache]: Analyzing trace with hash 790772624, now seen corresponding path program 1 times [2023-02-15 19:48:26,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:48:26,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726516809] [2023-02-15 19:48:26,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:48:26,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:48:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:27,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 19:48:27,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:28,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:48:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:28,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 19:48:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:28,413 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 19:48:28,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:48:28,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726516809] [2023-02-15 19:48:28,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726516809] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:48:28,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178464841] [2023-02-15 19:48:28,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:48:28,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:48:28,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:48:28,417 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) [2023-02-15 19:48:28,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 19:48:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:28,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 127 conjunts are in the unsatisfiable core [2023-02-15 19:48:28,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:48:28,586 INFO L350 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 [2023-02-15 19:48:28,634 INFO L350 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 5 treesize of output 3 [2023-02-15 19:48:28,754 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:48:28,755 INFO L350 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 [2023-02-15 19:48:28,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 19:48:28,927 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-15 19:48:28,928 INFO L350 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 22 treesize of output 33 [2023-02-15 19:48:29,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 19:48:29,136 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 19:48:29,137 INFO L350 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-02-15 19:48:29,329 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-02-15 19:48:29,330 INFO L350 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 26 [2023-02-15 19:48:29,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-02-15 19:48:29,453 INFO L350 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 19:48:29,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:48:29,568 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 19:48:29,568 INFO L350 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 77 treesize of output 67 [2023-02-15 19:48:29,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:48:29,578 INFO L350 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 60 treesize of output 58 [2023-02-15 19:48:29,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:48:29,595 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2023-02-15 19:48:29,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 37 [2023-02-15 19:48:30,145 INFO L350 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 41 [2023-02-15 19:48:30,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:48:30,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:48:30,173 INFO L321 Elim1Store]: treesize reduction 28, result has 33.3 percent of original size [2023-02-15 19:48:30,174 INFO L350 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 127 [2023-02-15 19:48:30,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:48:30,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:48:30,213 INFO L321 Elim1Store]: treesize reduction 88, result has 17.8 percent of original size [2023-02-15 19:48:30,214 INFO L350 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 109 treesize of output 87 [2023-02-15 19:48:30,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 76 treesize of output 61 [2023-02-15 19:48:30,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 58 treesize of output 49 [2023-02-15 19:48:30,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:48:30,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 35 [2023-02-15 19:48:30,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 38 [2023-02-15 19:48:30,357 INFO L350 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 21 treesize of output 13 [2023-02-15 19:48:30,418 INFO L350 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 19 treesize of output 7 [2023-02-15 19:48:30,455 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 19:48:30,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:48:33,169 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_749 Int) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_753 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_749)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_752) .cse0 v_ArrVal_751) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_754) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_757) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) .cse0 v_ArrVal_753) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_756) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_759) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) .cse0 v_ArrVal_755) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 19:48:33,412 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_749 Int) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_753 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_749)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_752) .cse0 v_ArrVal_751) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_754) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_757) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) .cse0 v_ArrVal_753) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_756) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_759) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)) .cse0 v_ArrVal_755) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 19:48:33,507 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:48:33,507 INFO L350 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 133 treesize of output 139 [2023-02-15 19:48:33,527 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:48:33,528 INFO L350 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 616 treesize of output 615 [2023-02-15 19:48:33,541 INFO L350 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 280 treesize of output 234 [2023-02-15 19:48:33,553 INFO L350 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 470 treesize of output 378 [2023-02-15 19:48:40,206 WARN L233 SmtUtils]: Spent 6.29s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 19:48:40,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178464841] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:48:40,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:48:40,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22] total 45 [2023-02-15 19:48:40,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664287105] [2023-02-15 19:48:40,209 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:48:40,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-02-15 19:48:40,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:48:40,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-02-15 19:48:40,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2259, Unknown=64, NotChecked=194, Total=2652 [2023-02-15 19:48:40,212 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 45 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 36 states have internal predecessors, (56), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 19:48:51,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:48:51,693 INFO L93 Difference]: Finished difference Result 67 states and 81 transitions. [2023-02-15 19:48:51,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 19:48:51,693 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 36 states have internal predecessors, (56), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 37 [2023-02-15 19:48:51,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:48:51,694 INFO L225 Difference]: With dead ends: 67 [2023-02-15 19:48:51,694 INFO L226 Difference]: Without dead ends: 65 [2023-02-15 19:48:51,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=331, Invalid=3771, Unknown=66, NotChecked=254, Total=4422 [2023-02-15 19:48:51,697 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 187 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:48:51,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 387 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-15 19:48:51,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-02-15 19:48:51,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2023-02-15 19:48:51,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 46 states have internal predecessors, (53), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 19:48:51,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2023-02-15 19:48:51,709 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 37 [2023-02-15 19:48:51,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:48:51,710 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2023-02-15 19:48:51,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 36 states have internal predecessors, (56), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 19:48:51,710 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2023-02-15 19:48:51,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 19:48:51,711 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:48:51,711 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:48:51,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 19:48:51,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:48:51,918 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:48:51,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:48:51,918 INFO L85 PathProgramCache]: Analyzing trace with hash -718486453, now seen corresponding path program 2 times [2023-02-15 19:48:51,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:48:51,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3784825] [2023-02-15 19:48:51,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:48:51,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:48:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:52,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 19:48:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:52,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:48:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:52,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 19:48:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:53,167 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 19:48:53,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:48:53,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3784825] [2023-02-15 19:48:53,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3784825] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:48:53,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939029562] [2023-02-15 19:48:53,168 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 19:48:53,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:48:53,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:48:53,170 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) [2023-02-15 19:48:53,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 19:48:53,348 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 19:48:53,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:48:53,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 127 conjunts are in the unsatisfiable core [2023-02-15 19:48:53,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:48:53,388 INFO L350 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 [2023-02-15 19:48:53,596 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:48:53,597 INFO L350 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 [2023-02-15 19:48:53,670 INFO L350 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 11 treesize of output 7 [2023-02-15 19:48:53,675 INFO L350 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 11 treesize of output 7 [2023-02-15 19:48:53,764 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-02-15 19:48:53,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 46 [2023-02-15 19:48:53,771 INFO L350 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2023-02-15 19:48:53,905 INFO L321 Elim1Store]: treesize reduction 33, result has 10.8 percent of original size [2023-02-15 19:48:53,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 58 [2023-02-15 19:48:53,915 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 19:48:53,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 13 [2023-02-15 19:48:54,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:48:54,107 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-15 19:48:54,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 123 treesize of output 109 [2023-02-15 19:48:54,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:48:54,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:48:54,130 INFO L321 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2023-02-15 19:48:54,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 121 treesize of output 112 [2023-02-15 19:48:54,155 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2023-02-15 19:48:54,156 INFO L350 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 32 treesize of output 34 [2023-02-15 19:48:54,409 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:48:54,431 INFO L321 Elim1Store]: treesize reduction 126, result has 8.0 percent of original size [2023-02-15 19:48:54,431 INFO L350 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 9 new quantified variables, introduced 14 case distinctions, treesize of input 135 treesize of output 77 [2023-02-15 19:48:54,512 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:48:54,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:48:55,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939029562] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:48:55,042 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:48:55,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 38 [2023-02-15 19:48:55,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398322446] [2023-02-15 19:48:55,042 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:48:55,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-15 19:48:55,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:48:55,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-15 19:48:55,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1835, Unknown=0, NotChecked=0, Total=1980 [2023-02-15 19:48:55,045 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand has 38 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 30 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 19:48:56,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:48:56,616 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2023-02-15 19:48:56,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 19:48:56,616 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 30 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 39 [2023-02-15 19:48:56,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:48:56,617 INFO L225 Difference]: With dead ends: 73 [2023-02-15 19:48:56,617 INFO L226 Difference]: Without dead ends: 62 [2023-02-15 19:48:56,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=289, Invalid=2681, Unknown=0, NotChecked=0, Total=2970 [2023-02-15 19:48:56,619 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 122 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 19:48:56,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 268 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 19:48:56,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-02-15 19:48:56,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2023-02-15 19:48:56,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 states have internal predecessors, (52), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 19:48:56,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2023-02-15 19:48:56,631 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 39 [2023-02-15 19:48:56,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:48:56,632 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2023-02-15 19:48:56,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 30 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 19:48:56,632 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2023-02-15 19:48:56,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 19:48:56,633 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:48:56,633 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2023-02-15 19:48:56,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 19:48:56,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:48:56,840 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:48:56,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:48:56,841 INFO L85 PathProgramCache]: Analyzing trace with hash 12485255, now seen corresponding path program 1 times [2023-02-15 19:48:56,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:48:56,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143558599] [2023-02-15 19:48:56,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:48:56,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:48:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:58,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 19:48:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:58,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:48:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:58,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 19:48:58,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:58,568 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 19:48:58,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:48:58,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143558599] [2023-02-15 19:48:58,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143558599] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:48:58,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54452482] [2023-02-15 19:48:58,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:48:58,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:48:58,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:48:58,570 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) [2023-02-15 19:48:58,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 19:48:58,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:48:58,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 127 conjunts are in the unsatisfiable core [2023-02-15 19:48:58,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:48:58,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-02-15 19:48:59,069 INFO L350 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 18 treesize of output 10 [2023-02-15 19:48:59,074 INFO L350 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 [2023-02-15 19:48:59,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:48:59,247 INFO L350 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 14 treesize of output 16 [2023-02-15 19:48:59,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:48:59,258 INFO L350 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 32 treesize of output 31 [2023-02-15 19:48:59,268 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 19:48:59,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 19:48:59,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:48:59,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:00,154 INFO L321 Elim1Store]: treesize reduction 281, result has 24.7 percent of original size [2023-02-15 19:49:00,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 388 treesize of output 413 [2023-02-15 19:49:00,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:00,217 INFO L321 Elim1Store]: treesize reduction 84, result has 15.2 percent of original size [2023-02-15 19:49:00,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 6 case distinctions, treesize of input 114 treesize of output 38 [2023-02-15 19:49:00,254 INFO L350 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 10 treesize of output 9 [2023-02-15 19:49:00,349 INFO L350 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 10 treesize of output 9 [2023-02-15 19:49:00,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:00,527 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:49:00,571 INFO L321 Elim1Store]: treesize reduction 62, result has 22.5 percent of original size [2023-02-15 19:49:00,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 123 treesize of output 63 [2023-02-15 19:49:00,607 INFO L350 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 7 treesize of output 3 [2023-02-15 19:49:00,630 INFO L350 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 7 treesize of output 3 [2023-02-15 19:49:00,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:00,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:00,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:00,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:00,779 INFO L321 Elim1Store]: treesize reduction 91, result has 16.5 percent of original size [2023-02-15 19:49:00,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 147 treesize of output 85 [2023-02-15 19:49:00,829 INFO L350 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 7 treesize of output 3 [2023-02-15 19:49:00,843 INFO L350 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 7 treesize of output 3 [2023-02-15 19:49:00,866 INFO L350 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 7 treesize of output 3 [2023-02-15 19:49:01,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:01,117 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:49:01,120 INFO L350 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 33 [2023-02-15 19:49:01,408 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-02-15 19:49:01,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1140 treesize of output 974 [2023-02-15 19:49:01,827 INFO L350 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 108 treesize of output 90 [2023-02-15 19:49:02,064 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 19:49:02,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 378 treesize of output 311 [2023-02-15 19:49:02,221 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 19:49:02,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 270 treesize of output 229 [2023-02-15 19:49:02,741 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:49:02,741 INFO L350 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 48 treesize of output 46 [2023-02-15 19:49:02,749 INFO L350 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 35 treesize of output 31 [2023-02-15 19:49:02,782 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:49:02,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 52 [2023-02-15 19:49:02,989 INFO L321 Elim1Store]: treesize reduction 58, result has 4.9 percent of original size [2023-02-15 19:49:02,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 36 [2023-02-15 19:49:03,029 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 19:49:03,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:49:04,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54452482] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:49:04,483 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:49:04,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2023-02-15 19:49:04,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812223460] [2023-02-15 19:49:04,484 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:49:04,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-02-15 19:49:04,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:49:04,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-02-15 19:49:04,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1974, Unknown=26, NotChecked=0, Total=2162 [2023-02-15 19:49:04,486 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 40 states, 38 states have (on average 1.631578947368421) internal successors, (62), 34 states have internal predecessors, (62), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 19:49:05,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:49:05,685 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2023-02-15 19:49:05,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 19:49:05,685 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 38 states have (on average 1.631578947368421) internal successors, (62), 34 states have internal predecessors, (62), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2023-02-15 19:49:05,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:49:05,686 INFO L225 Difference]: With dead ends: 70 [2023-02-15 19:49:05,686 INFO L226 Difference]: Without dead ends: 67 [2023-02-15 19:49:05,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 854 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=333, Invalid=3423, Unknown=26, NotChecked=0, Total=3782 [2023-02-15 19:49:05,688 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 68 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 19:49:05,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 317 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 19:49:05,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-02-15 19:49:05,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 59. [2023-02-15 19:49:05,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 50 states have (on average 1.14) internal successors, (57), 50 states have internal predecessors, (57), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 19:49:05,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2023-02-15 19:49:05,714 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 40 [2023-02-15 19:49:05,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:49:05,714 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2023-02-15 19:49:05,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 38 states have (on average 1.631578947368421) internal successors, (62), 34 states have internal predecessors, (62), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 19:49:05,715 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2023-02-15 19:49:05,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 19:49:05,715 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:49:05,716 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2023-02-15 19:49:05,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 19:49:05,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:49:05,918 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:49:05,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:49:05,918 INFO L85 PathProgramCache]: Analyzing trace with hash 387084070, now seen corresponding path program 1 times [2023-02-15 19:49:05,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:49:05,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282620675] [2023-02-15 19:49:05,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:49:05,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:49:05,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:08,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 19:49:08,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:08,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:49:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:08,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 19:49:08,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:08,647 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 19:49:08,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:49:08,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282620675] [2023-02-15 19:49:08,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282620675] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:49:08,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077509833] [2023-02-15 19:49:08,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:49:08,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:49:08,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:49:08,649 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) [2023-02-15 19:49:08,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 19:49:08,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:08,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 166 conjunts are in the unsatisfiable core [2023-02-15 19:49:08,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:49:08,852 INFO L350 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 [2023-02-15 19:49:08,911 INFO L350 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 5 treesize of output 3 [2023-02-15 19:49:09,039 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:49:09,040 INFO L350 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 [2023-02-15 19:49:09,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 19:49:09,235 INFO L350 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 19:49:09,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:09,329 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:49:09,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2023-02-15 19:49:09,440 INFO L350 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 19 treesize of output 18 [2023-02-15 19:49:09,455 INFO L350 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 11 treesize of output 7 [2023-02-15 19:49:09,599 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 19:49:09,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 43 [2023-02-15 19:49:09,611 INFO L350 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 18 treesize of output 20 [2023-02-15 19:49:09,798 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 19:49:09,798 INFO L350 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 32 [2023-02-15 19:49:09,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-02-15 19:49:09,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-02-15 19:49:09,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:09,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-02-15 19:49:10,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:10,032 INFO L350 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 14 treesize of output 16 [2023-02-15 19:49:10,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:10,060 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 19:49:10,060 INFO L350 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 77 treesize of output 65 [2023-02-15 19:49:10,077 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 19:49:10,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2023-02-15 19:49:10,081 INFO L350 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 5 treesize of output 3 [2023-02-15 19:49:10,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:10,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:10,112 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 19:49:10,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-02-15 19:49:10,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:10,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:10,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:10,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:10,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:10,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 42 [2023-02-15 19:49:10,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:10,716 INFO L350 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 78 [2023-02-15 19:49:10,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:10,749 INFO L321 Elim1Store]: treesize reduction 95, result has 16.7 percent of original size [2023-02-15 19:49:10,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 137 treesize of output 76 [2023-02-15 19:49:10,781 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2023-02-15 19:49:10,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 177 treesize of output 118 [2023-02-15 19:49:10,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:10,818 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-15 19:49:10,819 INFO L350 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 45 treesize of output 47 [2023-02-15 19:49:11,050 INFO L321 Elim1Store]: treesize reduction 36, result has 18.2 percent of original size [2023-02-15 19:49:11,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 139 treesize of output 64 [2023-02-15 19:49:11,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:11,180 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 19:49:11,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2023-02-15 19:49:11,243 INFO L350 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 15 treesize of output 7 [2023-02-15 19:49:11,304 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 19:49:11,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:49:11,536 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1461 (Array Int Int))) (= (let ((.cse3 (store (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_1469)) (.cse0 (store (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_1458))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_1461) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_1456) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_1454) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 19:49:11,567 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1461 (Array Int Int))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|))) (let ((.cse4 (store (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) .cse0 v_ArrVal_1469)) (.cse1 (store (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) .cse0 v_ArrVal_1458))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_1461) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_1456) .cse0 v_ArrVal_1454) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 4))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 19:49:11,596 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1461 (Array Int Int))) (= (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse6) .cse8))) (let ((.cse4 (store (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse8)))) (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) .cse0 v_ArrVal_1469)) (.cse1 (store (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse6)))) (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) .cse0 v_ArrVal_1458))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_1461) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_1456) .cse0 v_ArrVal_1454) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 4)))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 19:49:11,612 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1461 (Array Int Int))) (= (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse6) .cse8))) (let ((.cse4 (store (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| .cse8)))) (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|))) .cse0 v_ArrVal_1469)) (.cse1 (store (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| .cse6)))) (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|))) .cse0 v_ArrVal_1458))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_1461) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_1456) .cse0 v_ArrVal_1454) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 4)))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 19:49:11,723 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| Int) (v_ArrVal_1480 (Array Int Int))) (or (= (let ((.cse9 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_1480))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse8 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_1479) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select .cse9 .cse6) .cse8))) (let ((.cse4 (store (let ((.cse7 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| (store v_ArrVal_1479 0 .cse8)))) (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0))) .cse0 v_ArrVal_1469)) (.cse1 (store (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| (store v_ArrVal_1480 0 .cse6)))) (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|))) .cse0 v_ArrVal_1458))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_1461) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_1456) .cse0 v_ArrVal_1454) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 4))))))) |c_ULTIMATE.start_main_~data~0#1|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|))) (not (< |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| |c_#StackHeapBarrier|)))) is different from false [2023-02-15 19:49:11,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077509833] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:49:11,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:49:11,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 49 [2023-02-15 19:49:11,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336316025] [2023-02-15 19:49:11,726 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:49:11,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-02-15 19:49:11,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:49:11,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-02-15 19:49:11,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2515, Unknown=7, NotChecked=520, Total=3192 [2023-02-15 19:49:11,729 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand has 49 states, 45 states have (on average 1.488888888888889) internal successors, (67), 40 states have internal predecessors, (67), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 19:49:15,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:49:15,162 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2023-02-15 19:49:15,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 19:49:15,162 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 45 states have (on average 1.488888888888889) internal successors, (67), 40 states have internal predecessors, (67), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 41 [2023-02-15 19:49:15,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:49:15,163 INFO L225 Difference]: With dead ends: 74 [2023-02-15 19:49:15,163 INFO L226 Difference]: Without dead ends: 72 [2023-02-15 19:49:15,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=341, Invalid=4364, Unknown=7, NotChecked=690, Total=5402 [2023-02-15 19:49:15,165 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 189 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-15 19:49:15,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 311 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-02-15 19:49:15,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-02-15 19:49:15,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 63. [2023-02-15 19:49:15,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 states have internal predecessors, (61), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 19:49:15,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2023-02-15 19:49:15,180 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 41 [2023-02-15 19:49:15,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:49:15,181 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2023-02-15 19:49:15,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 45 states have (on average 1.488888888888889) internal successors, (67), 40 states have internal predecessors, (67), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 19:49:15,181 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2023-02-15 19:49:15,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 19:49:15,182 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:49:15,182 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2023-02-15 19:49:15,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 19:49:15,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:49:15,388 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:49:15,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:49:15,389 INFO L85 PathProgramCache]: Analyzing trace with hash -364798159, now seen corresponding path program 1 times [2023-02-15 19:49:15,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:49:15,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382111907] [2023-02-15 19:49:15,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:49:15,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:49:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:17,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 19:49:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:17,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:49:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:17,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 19:49:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:18,150 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 19:49:18,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:49:18,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382111907] [2023-02-15 19:49:18,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382111907] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:49:18,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296666224] [2023-02-15 19:49:18,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:49:18,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:49:18,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:49:18,152 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) [2023-02-15 19:49:18,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 19:49:18,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:18,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 153 conjunts are in the unsatisfiable core [2023-02-15 19:49:18,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:49:18,674 INFO L350 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 [2023-02-15 19:49:18,678 INFO L350 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 [2023-02-15 19:49:18,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:18,825 INFO L350 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 14 treesize of output 16 [2023-02-15 19:49:18,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:18,836 INFO L350 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 32 treesize of output 31 [2023-02-15 19:49:19,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:19,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:19,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:19,528 INFO L321 Elim1Store]: treesize reduction 23, result has 56.6 percent of original size [2023-02-15 19:49:19,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 282 treesize of output 250 [2023-02-15 19:49:19,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:19,611 INFO L321 Elim1Store]: treesize reduction 257, result has 12.9 percent of original size [2023-02-15 19:49:19,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 280 treesize of output 141 [2023-02-15 19:49:19,637 INFO L321 Elim1Store]: treesize reduction 58, result has 15.9 percent of original size [2023-02-15 19:49:19,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 329 treesize of output 289 [2023-02-15 19:49:19,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 277 treesize of output 232 [2023-02-15 19:49:19,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:19,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:19,705 INFO L321 Elim1Store]: treesize reduction 101, result has 49.8 percent of original size [2023-02-15 19:49:19,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 70 treesize of output 144 [2023-02-15 19:49:19,803 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-02-15 19:49:19,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 43 [2023-02-15 19:49:19,855 INFO L321 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2023-02-15 19:49:19,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2023-02-15 19:49:19,937 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-02-15 19:49:19,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 237 treesize of output 260 [2023-02-15 19:49:20,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:20,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:20,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 178 [2023-02-15 19:49:20,266 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 19:49:20,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 150 [2023-02-15 19:49:20,510 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 19:49:20,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 154 [2023-02-15 19:49:20,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 90 [2023-02-15 19:52:16,588 WARN L233 SmtUtils]: Spent 2.10m on a formula simplification. DAG size of input: 449 DAG size of output: 99 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 19:52:22,020 INFO L321 Elim1Store]: treesize reduction 228, result has 53.4 percent of original size [2023-02-15 19:52:22,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 16 new quantified variables, introduced 36 case distinctions, treesize of input 440 treesize of output 469 [2023-02-15 19:52:23,036 INFO L321 Elim1Store]: treesize reduction 72, result has 66.8 percent of original size [2023-02-15 19:52:23,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 27 case distinctions, treesize of input 333 treesize of output 417 [2023-02-15 19:52:35,225 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 19:52:35,857 WARN L207 Elim1Store]: Array PQE input equivalent to false