./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2c_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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_append_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 b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 14:42:32,069 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 14:42:32,070 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 14:42:32,098 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 14:42:32,098 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 14:42:32,099 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 14:42:32,103 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 14:42:32,109 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 14:42:32,110 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 14:42:32,115 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 14:42:32,117 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 14:42:32,118 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 14:42:32,119 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 14:42:32,121 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 14:42:32,123 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 14:42:32,124 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 14:42:32,125 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 14:42:32,126 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 14:42:32,130 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 14:42:32,132 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 14:42:32,135 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 14:42:32,136 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 14:42:32,137 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 14:42:32,138 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 14:42:32,139 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 14:42:32,145 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 14:42:32,147 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 14:42:32,147 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 14:42:32,148 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 14:42:32,149 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 14:42:32,150 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 14:42:32,150 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 14:42:32,152 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 14:42:32,152 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 14:42:32,153 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 14:42:32,154 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 14:42:32,154 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 14:42:32,155 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 14:42:32,155 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 14:42:32,155 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 14:42:32,156 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 14:42:32,157 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 14:42:32,158 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 14:42:32,188 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 14:42:32,191 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 14:42:32,191 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 14:42:32,191 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 14:42:32,192 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 14:42:32,192 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 14:42:32,193 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 14:42:32,193 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 14:42:32,193 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 14:42:32,194 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 14:42:32,194 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 14:42:32,194 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 14:42:32,194 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 14:42:32,194 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 14:42:32,195 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 14:42:32,195 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 14:42:32,195 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 14:42:32,195 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 14:42:32,195 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 14:42:32,196 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 14:42:32,196 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 14:42:32,196 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 14:42:32,196 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 14:42:32,196 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 14:42:32,197 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:42:32,197 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 14:42:32,197 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 14:42:32,197 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 14:42:32,197 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 14:42:32,198 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 14:42:32,198 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 14:42:32,198 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 14:42:32,198 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 14:42:32,198 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab [2022-07-19 14:42:32,424 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 14:42:32,448 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 14:42:32,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 14:42:32,452 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 14:42:32,452 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 14:42:32,453 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_append_equal.i [2022-07-19 14:42:32,510 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ec5209cf/1699713471e6479291e69f27c02a309a/FLAG4adb67b2d [2022-07-19 14:42:32,977 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 14:42:32,977 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2022-07-19 14:42:32,997 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ec5209cf/1699713471e6479291e69f27c02a309a/FLAG4adb67b2d [2022-07-19 14:42:33,008 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ec5209cf/1699713471e6479291e69f27c02a309a [2022-07-19 14:42:33,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 14:42:33,011 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 14:42:33,012 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 14:42:33,012 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 14:42:33,015 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 14:42:33,016 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:42:33" (1/1) ... [2022-07-19 14:42:33,016 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62f70216 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:33, skipping insertion in model container [2022-07-19 14:42:33,017 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:42:33" (1/1) ... [2022-07-19 14:42:33,022 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 14:42:33,078 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 14:42:33,312 WARN L230 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_append_equal.i[24433,24446] [2022-07-19 14:42:33,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:42:33,330 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 14:42:33,390 WARN L230 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_append_equal.i[24433,24446] [2022-07-19 14:42:33,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:42:33,417 INFO L208 MainTranslator]: Completed translation [2022-07-19 14:42:33,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:33 WrapperNode [2022-07-19 14:42:33,418 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 14:42:33,419 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 14:42:33,419 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 14:42:33,419 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 14:42:33,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:33" (1/1) ... [2022-07-19 14:42:33,433 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:33" (1/1) ... [2022-07-19 14:42:33,451 INFO L137 Inliner]: procedures = 127, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 136 [2022-07-19 14:42:33,451 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 14:42:33,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 14:42:33,452 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 14:42:33,452 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 14:42:33,460 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:33" (1/1) ... [2022-07-19 14:42:33,460 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:33" (1/1) ... [2022-07-19 14:42:33,463 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:33" (1/1) ... [2022-07-19 14:42:33,464 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:33" (1/1) ... [2022-07-19 14:42:33,470 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:33" (1/1) ... [2022-07-19 14:42:33,474 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:33" (1/1) ... [2022-07-19 14:42:33,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:33" (1/1) ... [2022-07-19 14:42:33,479 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 14:42:33,479 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 14:42:33,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 14:42:33,480 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 14:42:33,489 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:33" (1/1) ... [2022-07-19 14:42:33,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:42:33,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:42:33,523 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) [2022-07-19 14:42:33,524 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 [2022-07-19 14:42:33,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 14:42:33,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 14:42:33,548 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-19 14:42:33,548 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-19 14:42:33,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 14:42:33,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 14:42:33,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 14:42:33,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 14:42:33,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 14:42:33,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 14:42:33,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 14:42:33,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 14:42:33,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 14:42:33,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 14:42:33,629 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 14:42:33,630 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 14:42:33,845 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 14:42:33,850 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 14:42:33,851 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-19 14:42:33,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:42:33 BoogieIcfgContainer [2022-07-19 14:42:33,852 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 14:42:33,854 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 14:42:33,854 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 14:42:33,857 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 14:42:33,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 02:42:33" (1/3) ... [2022-07-19 14:42:33,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f224e0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:42:33, skipping insertion in model container [2022-07-19 14:42:33,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:33" (2/3) ... [2022-07-19 14:42:33,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f224e0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:42:33, skipping insertion in model container [2022-07-19 14:42:33,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:42:33" (3/3) ... [2022-07-19 14:42:33,859 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2022-07-19 14:42:33,871 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 14:42:33,872 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 14:42:33,917 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 14:42:33,927 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2fc1ba5a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@12026386 [2022-07-19 14:42:33,928 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 14:42:33,936 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) [2022-07-19 14:42:33,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-19 14:42:33,954 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:42:33,954 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] [2022-07-19 14:42:33,955 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:42:33,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:42:33,962 INFO L85 PathProgramCache]: Analyzing trace with hash -483023916, now seen corresponding path program 1 times [2022-07-19 14:42:33,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:42:33,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646754851] [2022-07-19 14:42:33,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:42:33,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:42:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:34,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 14:42:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:34,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 14:42:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:34,244 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 14:42:34,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:42:34,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646754851] [2022-07-19 14:42:34,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646754851] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:42:34,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:42:34,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:42:34,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577536132] [2022-07-19 14:42:34,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:42:34,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 14:42:34,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:42:34,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 14:42:34,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:42:34,276 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) [2022-07-19 14:42:34,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:42:34,330 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2022-07-19 14:42:34,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 14:42:34,333 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 [2022-07-19 14:42:34,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:42:34,338 INFO L225 Difference]: With dead ends: 65 [2022-07-19 14:42:34,338 INFO L226 Difference]: Without dead ends: 28 [2022-07-19 14:42:34,341 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 [2022-07-19 14:42:34,343 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 [2022-07-19 14:42:34,344 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] [2022-07-19 14:42:34,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-19 14:42:34,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-07-19 14:42:34,371 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) [2022-07-19 14:42:34,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-07-19 14:42:34,373 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2022-07-19 14:42:34,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:42:34,374 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-07-19 14:42:34,375 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) [2022-07-19 14:42:34,375 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-07-19 14:42:34,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-19 14:42:34,376 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:42:34,376 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] [2022-07-19 14:42:34,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 14:42:34,377 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:42:34,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:42:34,378 INFO L85 PathProgramCache]: Analyzing trace with hash -938400178, now seen corresponding path program 1 times [2022-07-19 14:42:34,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:42:34,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217218559] [2022-07-19 14:42:34,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:42:34,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:42:34,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:34,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 14:42:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:34,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 14:42:34,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:34,476 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 14:42:34,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:42:34,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217218559] [2022-07-19 14:42:34,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217218559] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:42:34,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:42:34,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:42:34,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909360945] [2022-07-19 14:42:34,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:42:34,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:42:34,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:42:34,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:42:34,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:42:34,484 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) [2022-07-19 14:42:34,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:42:34,536 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2022-07-19 14:42:34,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:42:34,537 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 [2022-07-19 14:42:34,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:42:34,540 INFO L225 Difference]: With dead ends: 52 [2022-07-19 14:42:34,540 INFO L226 Difference]: Without dead ends: 31 [2022-07-19 14:42:34,544 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 [2022-07-19 14:42:34,545 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 [2022-07-19 14:42:34,546 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] [2022-07-19 14:42:34,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-19 14:42:34,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-07-19 14:42:34,551 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) [2022-07-19 14:42:34,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-07-19 14:42:34,552 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 24 [2022-07-19 14:42:34,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:42:34,553 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-07-19 14:42:34,554 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) [2022-07-19 14:42:34,554 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-07-19 14:42:34,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-19 14:42:34,556 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:42:34,557 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] [2022-07-19 14:42:34,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 14:42:34,557 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:42:34,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:42:34,558 INFO L85 PathProgramCache]: Analyzing trace with hash 436872902, now seen corresponding path program 1 times [2022-07-19 14:42:34,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:42:34,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659947578] [2022-07-19 14:42:34,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:42:34,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:42:34,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:34,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 14:42:34,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:34,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 14:42:34,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:34,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 14:42:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:34,879 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 14:42:34,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:42:34,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659947578] [2022-07-19 14:42:34,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659947578] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:42:34,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874138956] [2022-07-19 14:42:34,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:42:34,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:42:34,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:42:34,887 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) [2022-07-19 14:42:34,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 14:42:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:35,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-19 14:42:35,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:42:35,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 5 [2022-07-19 14:42:35,371 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-19 14:42:35,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:42:35,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-07-19 14:42:35,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-19 14:42:35,529 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 14:42:35,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:42:35,627 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_316 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_8| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_8| v_ArrVal_316) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_8| |c_#StackHeapBarrier|)) (<= (+ .cse0 1) 0) (<= 1 .cse0)))) is different from false [2022-07-19 14:42:35,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874138956] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:42:35,629 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:42:35,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2022-07-19 14:42:35,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769375042] [2022-07-19 14:42:35,630 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:42:35,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-19 14:42:35,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:42:35,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-19 14:42:35,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=482, Unknown=1, NotChecked=44, Total=600 [2022-07-19 14:42:35,632 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) [2022-07-19 14:42:35,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:42:35,893 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-07-19 14:42:35,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 14:42:35,893 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 [2022-07-19 14:42:35,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:42:35,895 INFO L225 Difference]: With dead ends: 38 [2022-07-19 14:42:35,896 INFO L226 Difference]: Without dead ends: 30 [2022-07-19 14:42:35,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=756, Unknown=1, NotChecked=56, Total=930 [2022-07-19 14:42:35,897 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:42:35,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 187 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 151 Invalid, 0 Unknown, 10 Unchecked, 0.1s Time] [2022-07-19 14:42:35,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-19 14:42:35,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-07-19 14:42:35,902 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) [2022-07-19 14:42:35,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-07-19 14:42:35,903 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 32 [2022-07-19 14:42:35,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:42:35,904 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-07-19 14:42:35,904 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) [2022-07-19 14:42:35,904 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-07-19 14:42:35,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-19 14:42:35,905 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:42:35,905 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] [2022-07-19 14:42:35,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 14:42:36,119 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 [2022-07-19 14:42:36,120 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:42:36,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:42:36,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1205420011, now seen corresponding path program 1 times [2022-07-19 14:42:36,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:42:36,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883180974] [2022-07-19 14:42:36,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:42:36,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:42:36,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:36,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 14:42:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:36,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 14:42:36,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:36,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 14:42:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:36,588 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 14:42:36,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:42:36,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883180974] [2022-07-19 14:42:36,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883180974] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:42:36,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479514576] [2022-07-19 14:42:36,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:42:36,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:42:36,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:42:36,591 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) [2022-07-19 14:42:36,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 14:42:36,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:36,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 118 conjunts are in the unsatisfiable core [2022-07-19 14:42:36,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:42:36,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:36,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:36,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:42:36,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-19 14:42:37,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:42:37,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:37,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:37,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:42:37,224 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-19 14:42:37,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:37,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-19 14:42:37,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-19 14:42:37,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 21 [2022-07-19 14:42:37,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-07-19 14:42:37,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:42:37,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:37,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:37,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:42:37,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 39 [2022-07-19 14:42:37,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:42:37,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-19 14:42:37,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:42:37,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:42:37,859 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-19 14:42:37,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 25 [2022-07-19 14:42:37,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:42:37,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-19 14:42:38,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:42:38,113 INFO L356 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-07-19 14:42:38,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 76 treesize of output 71 [2022-07-19 14:42:38,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:42:38,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 32 [2022-07-19 14:42:38,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:42:38,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-07-19 14:42:38,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:38,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 15 [2022-07-19 14:42:38,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-07-19 14:42:38,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:38,261 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 14:42:38,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:42:38,366 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_505 (Array Int Int)) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 (Array Int Int)) (v_ArrVal_506 Int) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_506)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_508) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_511) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_505) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_510) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_507) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2022-07-19 14:42:38,401 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_505 (Array Int Int)) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_7| Int) (v_ArrVal_506 Int) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_7| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_7| v_ArrVal_506)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_508) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_511) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_505) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_510) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_507) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) |c_ULTIMATE.start_main_~data~0#1|))) is different from false [2022-07-19 14:42:38,416 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_505 (Array Int Int)) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_507 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_7| Int) (v_ArrVal_506 Int) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_7| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_7| v_ArrVal_506)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_508) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_511) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_505) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_510) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_507) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))) is different from false [2022-07-19 14:42:38,496 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_505 (Array Int Int)) (v_ArrVal_519 (Array Int Int)) (v_ArrVal_508 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11| Int) (v_ArrVal_507 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_7| Int) (v_ArrVal_506 Int) (v_ArrVal_520 (Array Int Int)) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_521 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11| v_ArrVal_521))) (or (not (<= |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_7| (select (select .cse0 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11| v_ArrVal_519))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (select (select (store (let ((.cse1 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11| v_ArrVal_520))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_7| v_ArrVal_506))) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11| v_ArrVal_508) (select (select (store (store .cse3 .cse2 v_ArrVal_511) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11| v_ArrVal_505) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store .cse0 .cse2 v_ArrVal_510) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_11| v_ArrVal_507) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))))) is different from false [2022-07-19 14:42:38,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479514576] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:42:38,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:42:38,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 40 [2022-07-19 14:42:38,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112630985] [2022-07-19 14:42:38,499 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:42:38,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-19 14:42:38,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:42:38,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-19 14:42:38,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1679, Unknown=6, NotChecked=340, Total=2162 [2022-07-19 14:42:38,502 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 40 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 32 states have internal predecessors, (56), 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) [2022-07-19 14:42:39,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:42:39,433 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2022-07-19 14:42:39,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-19 14:42:39,435 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 32 states have internal predecessors, (56), 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 35 [2022-07-19 14:42:39,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:42:39,436 INFO L225 Difference]: With dead ends: 70 [2022-07-19 14:42:39,436 INFO L226 Difference]: Without dead ends: 61 [2022-07-19 14:42:39,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=248, Invalid=3068, Unknown=6, NotChecked=460, Total=3782 [2022-07-19 14:42:39,438 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 35 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 14:42:39,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 362 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 493 Invalid, 0 Unknown, 101 Unchecked, 0.3s Time] [2022-07-19 14:42:39,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-19 14:42:39,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 47. [2022-07-19 14:42:39,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-19 14:42:39,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2022-07-19 14:42:39,448 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 35 [2022-07-19 14:42:39,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:42:39,448 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2022-07-19 14:42:39,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 32 states have internal predecessors, (56), 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) [2022-07-19 14:42:39,449 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-07-19 14:42:39,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 14:42:39,450 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:42:39,450 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] [2022-07-19 14:42:39,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 14:42:39,671 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 [2022-07-19 14:42:39,672 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:42:39,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:42:39,672 INFO L85 PathProgramCache]: Analyzing trace with hash 790772624, now seen corresponding path program 1 times [2022-07-19 14:42:39,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:42:39,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281987877] [2022-07-19 14:42:39,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:42:39,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:42:39,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:40,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 14:42:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:40,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 14:42:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:40,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 14:42:40,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:40,543 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 14:42:40,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:42:40,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281987877] [2022-07-19 14:42:40,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281987877] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:42:40,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176743743] [2022-07-19 14:42:40,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:42:40,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:42:40,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:42:40,546 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) [2022-07-19 14:42:40,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 14:42:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:40,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 138 conjunts are in the unsatisfiable core [2022-07-19 14:42:40,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:42:40,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:40,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:41,022 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 14:42:41,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:41,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:41,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:41,299 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-19 14:42:41,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:41,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-19 14:42:41,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:41,516 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:42:41,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 43 [2022-07-19 14:42:41,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-19 14:42:41,728 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:42:41,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 62 treesize of output 33 [2022-07-19 14:42:41,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-07-19 14:42:41,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:41,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:42:41,959 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-19 14:42:41,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 68 treesize of output 58 [2022-07-19 14:42:41,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:42:41,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2022-07-19 14:42:41,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:42:41,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:42:41,982 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-19 14:42:41,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:41,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:42:41,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:42:42,433 INFO L356 Elim1Store]: treesize reduction 107, result has 17.1 percent of original size [2022-07-19 14:42:42,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 140 treesize of output 82 [2022-07-19 14:42:42,466 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-19 14:42:42,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 221 treesize of output 132 [2022-07-19 14:42:42,489 INFO L356 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-07-19 14:42:42,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 195 treesize of output 185 [2022-07-19 14:42:42,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 53 [2022-07-19 14:42:42,601 INFO L356 Elim1Store]: treesize reduction 33, result has 10.8 percent of original size [2022-07-19 14:42:42,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 42 [2022-07-19 14:42:42,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-07-19 14:42:42,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:42,684 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 14:42:42,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:42:42,774 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_722 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_718 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_715) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_714) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_723) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_718) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_722) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2022-07-19 14:42:42,792 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_722 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_9| Int) (v_ArrVal_718 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_715) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_714) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_9| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_723) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_718) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_722) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2022-07-19 14:42:42,804 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_722 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_9| Int) (v_ArrVal_718 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_715) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_714) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_9| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_723) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_718) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_722) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2022-07-19 14:42:42,812 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_722 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_9| Int) (v_ArrVal_718 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_715) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_714) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_9| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_723) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_718) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_722) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2022-07-19 14:42:42,899 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_722 (Array Int Int)) (v_ArrVal_732 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| Int) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_9| Int) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_731 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| v_ArrVal_731)) (.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| v_ArrVal_733))) (let ((.cse0 (select (select .cse1 (select (select .cse1 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| v_ArrVal_732) .cse0 v_ArrVal_715) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| v_ArrVal_714) (select (select (store (store .cse1 .cse0 (store (select .cse1 .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_9| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| v_ArrVal_723) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store .cse2 .cse0 v_ArrVal_718) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| v_ArrVal_722) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| |c_#StackHeapBarrier|)))) is different from false [2022-07-19 14:42:42,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176743743] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:42:42,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:42:42,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 45 [2022-07-19 14:42:42,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994513711] [2022-07-19 14:42:42,902 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:42:42,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-19 14:42:42,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:42:42,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-19 14:42:42,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=2028, Unknown=5, NotChecked=470, Total=2652 [2022-07-19 14:42:42,904 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 45 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 36 states have internal predecessors, (60), 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) [2022-07-19 14:42:43,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:42:43,852 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2022-07-19 14:42:43,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-19 14:42:43,852 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 36 states have internal predecessors, (60), 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 37 [2022-07-19 14:42:43,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:42:43,853 INFO L225 Difference]: With dead ends: 65 [2022-07-19 14:42:43,853 INFO L226 Difference]: Without dead ends: 63 [2022-07-19 14:42:43,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=220, Invalid=2765, Unknown=5, NotChecked=550, Total=3540 [2022-07-19 14:42:43,855 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 23 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 14:42:43,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 326 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 738 Invalid, 0 Unknown, 16 Unchecked, 0.5s Time] [2022-07-19 14:42:43,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-19 14:42:43,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2022-07-19 14:42:43,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 50 states have (on average 1.14) internal successors, (57), 50 states have internal predecessors, (57), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-19 14:42:43,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2022-07-19 14:42:43,865 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 37 [2022-07-19 14:42:43,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:42:43,865 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2022-07-19 14:42:43,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 36 states have internal predecessors, (60), 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) [2022-07-19 14:42:43,866 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-07-19 14:42:43,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-19 14:42:43,867 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:42:43,867 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] [2022-07-19 14:42:43,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 14:42:44,071 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 [2022-07-19 14:42:44,071 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:42:44,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:42:44,072 INFO L85 PathProgramCache]: Analyzing trace with hash -718486453, now seen corresponding path program 2 times [2022-07-19 14:42:44,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:42:44,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444152402] [2022-07-19 14:42:44,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:42:44,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:42:44,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:44,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 14:42:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:44,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 14:42:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:44,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 14:42:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:44,784 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 14:42:44,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:42:44,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444152402] [2022-07-19 14:42:44,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444152402] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:42:44,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465907687] [2022-07-19 14:42:44,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 14:42:44,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:42:44,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:42:44,788 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) [2022-07-19 14:42:44,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 14:42:45,015 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 14:42:45,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:42:45,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 178 conjunts are in the unsatisfiable core [2022-07-19 14:42:45,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:42:45,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:45,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:45,316 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 14:42:45,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:45,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:45,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:45,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:45,515 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:42:45,522 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-19 14:42:45,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 74 treesize of output 52 [2022-07-19 14:42:45,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2022-07-19 14:42:45,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 53 treesize of output 39 [2022-07-19 14:42:45,738 INFO L356 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2022-07-19 14:42:45,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 122 treesize of output 67 [2022-07-19 14:42:45,747 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-19 14:42:45,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 16 [2022-07-19 14:42:45,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:42:45,936 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-19 14:42:45,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 128 treesize of output 108 [2022-07-19 14:42:45,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:42:45,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2022-07-19 14:42:45,959 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-19 14:42:45,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 30 [2022-07-19 14:42:45,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:42:45,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:42:45,967 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-19 14:42:45,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 76 [2022-07-19 14:42:46,481 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:42:46,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:42:46,582 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_936 (Array Int Int)) (v_ArrVal_939 (Array Int Int)) (v_ArrVal_938 (Array Int Int)) (v_ArrVal_929 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_930) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_936) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_939) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_938) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_929) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-19 14:42:47,203 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| Int) (v_ArrVal_930 (Array Int Int)) (v_ArrVal_948 (Array Int Int)) (v_ArrVal_947 (Array Int Int)) (v_ArrVal_936 (Array Int Int)) (v_ArrVal_939 (Array Int Int)) (v_ArrVal_949 (Array Int Int)) (v_ArrVal_938 (Array Int Int)) (v_ArrVal_929 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| v_ArrVal_947)) (.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| v_ArrVal_948))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse3 (select (select .cse5 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse6 (select (select .cse4 .cse0) .cse3)) (.cse7 (select (select .cse5 .cse0) .cse3))) (let ((.cse2 (select (select .cse5 .cse6) .cse7)) (.cse1 (select (select .cse4 .cse6) .cse7))) (or (and (= .cse0 .cse1) (= .cse2 .cse3)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| v_ArrVal_949) .cse1 v_ArrVal_930) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| v_ArrVal_936) (select (select (store (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| v_ArrVal_939) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store .cse5 .cse1 v_ArrVal_938) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| v_ArrVal_929) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))))))) is different from false [2022-07-19 14:42:47,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465907687] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:42:47,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:42:47,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 39 [2022-07-19 14:42:47,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876297965] [2022-07-19 14:42:47,205 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:42:47,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-19 14:42:47,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:42:47,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-19 14:42:47,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1996, Unknown=4, NotChecked=182, Total=2352 [2022-07-19 14:42:47,207 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 39 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 31 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) [2022-07-19 14:42:47,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:42:47,763 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2022-07-19 14:42:47,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-19 14:42:47,763 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 31 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 [2022-07-19 14:42:47,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:42:47,764 INFO L225 Difference]: With dead ends: 71 [2022-07-19 14:42:47,764 INFO L226 Difference]: Without dead ends: 60 [2022-07-19 14:42:47,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=233, Invalid=2527, Unknown=4, NotChecked=206, Total=2970 [2022-07-19 14:42:47,766 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 14:42:47,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 173 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 283 Invalid, 0 Unknown, 14 Unchecked, 0.2s Time] [2022-07-19 14:42:47,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-19 14:42:47,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-07-19 14:42:47,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-19 14:42:47,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2022-07-19 14:42:47,775 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 39 [2022-07-19 14:42:47,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:42:47,776 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2022-07-19 14:42:47,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 31 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) [2022-07-19 14:42:47,776 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2022-07-19 14:42:47,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-19 14:42:47,777 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:42:47,777 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] [2022-07-19 14:42:47,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 14:42:47,983 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 [2022-07-19 14:42:47,983 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:42:47,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:42:47,984 INFO L85 PathProgramCache]: Analyzing trace with hash 12485255, now seen corresponding path program 1 times [2022-07-19 14:42:47,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:42:47,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296118084] [2022-07-19 14:42:47,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:42:47,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:42:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:48,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 14:42:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:48,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 14:42:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:48,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 14:42:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:48,631 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 14:42:48,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:42:48,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296118084] [2022-07-19 14:42:48,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296118084] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:42:48,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114370523] [2022-07-19 14:42:48,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:42:48,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:42:48,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:42:48,633 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) [2022-07-19 14:42:48,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 14:42:48,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:48,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 108 conjunts are in the unsatisfiable core [2022-07-19 14:42:48,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:42:48,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:48,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:48,926 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 14:42:48,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:49,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:49,048 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-19 14:42:49,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:49,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:49,170 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:42:49,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:49,278 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-19 14:42:49,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:49,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:49,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:42:49,418 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-19 14:42:49,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:49,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:42:49,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:49,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:42:49,435 INFO L356 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-07-19 14:42:49,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:49,785 INFO L356 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-07-19 14:42:49,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 67 [2022-07-19 14:42:49,808 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-19 14:42:49,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 181 treesize of output 112 [2022-07-19 14:42:49,823 INFO L356 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-07-19 14:42:49,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 151 treesize of output 147 [2022-07-19 14:42:49,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 121 treesize of output 93 [2022-07-19 14:42:50,036 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-07-19 14:42:50,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 38 [2022-07-19 14:42:50,039 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 14:42:50,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:42:50,053 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (v_ArrVal_1135 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int)) (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1139))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1135) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2022-07-19 14:42:50,065 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (v_ArrVal_1135 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17| Int)) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1139))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1135) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) is different from false [2022-07-19 14:42:50,075 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (v_ArrVal_1135 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17| Int)) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1139))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1135) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-07-19 14:42:50,083 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (v_ArrVal_1135 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17| Int)) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1139))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1135) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-07-19 14:42:50,144 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (v_ArrVal_1147 (Array Int Int)) (v_ArrVal_1146 (Array Int Int)) (v_ArrVal_1135 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17| Int)) (or (not (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| v_ArrVal_1147)) (.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| v_ArrVal_1146))) (let ((.cse3 (select (select .cse4 (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse1 (store (store .cse4 .cse3 (store (select .cse4 .cse3) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| v_ArrVal_1139))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store .cse2 .cse3 v_ArrVal_1135) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| v_ArrVal_1138) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20|) 0)))) is different from false [2022-07-19 14:42:50,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114370523] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:42:50,145 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:42:50,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 43 [2022-07-19 14:42:50,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905368272] [2022-07-19 14:42:50,146 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:42:50,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-19 14:42:50,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:42:50,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-19 14:42:50,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1683, Unknown=8, NotChecked=430, Total=2256 [2022-07-19 14:42:50,148 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand has 43 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 34 states have internal predecessors, (59), 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) [2022-07-19 14:42:50,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:42:50,767 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2022-07-19 14:42:50,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-19 14:42:50,767 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 34 states have internal predecessors, (59), 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 40 [2022-07-19 14:42:50,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:42:50,768 INFO L225 Difference]: With dead ends: 65 [2022-07-19 14:42:50,769 INFO L226 Difference]: Without dead ends: 62 [2022-07-19 14:42:50,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=194, Invalid=2268, Unknown=8, NotChecked=500, Total=2970 [2022-07-19 14:42:50,770 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 14:42:50,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 242 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 443 Invalid, 0 Unknown, 71 Unchecked, 0.3s Time] [2022-07-19 14:42:50,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-19 14:42:50,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-07-19 14:42:50,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 52 states have internal predecessors, (58), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-19 14:42:50,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2022-07-19 14:42:50,780 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 40 [2022-07-19 14:42:50,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:42:50,780 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2022-07-19 14:42:50,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 34 states have internal predecessors, (59), 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) [2022-07-19 14:42:50,781 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2022-07-19 14:42:50,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-19 14:42:50,782 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:42:50,782 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] [2022-07-19 14:42:50,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-19 14:42:51,006 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 [2022-07-19 14:42:51,007 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:42:51,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:42:51,007 INFO L85 PathProgramCache]: Analyzing trace with hash 387084070, now seen corresponding path program 1 times [2022-07-19 14:42:51,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:42:51,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396006386] [2022-07-19 14:42:51,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:42:51,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:42:51,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:51,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 14:42:51,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:51,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 14:42:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:52,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 14:42:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:52,352 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 14:42:52,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:42:52,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396006386] [2022-07-19 14:42:52,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396006386] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:42:52,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979548956] [2022-07-19 14:42:52,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:42:52,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:42:52,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:42:52,354 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) [2022-07-19 14:42:52,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-19 14:42:52,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:52,622 WARN L261 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 201 conjunts are in the unsatisfiable core [2022-07-19 14:42:52,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:42:52,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:52,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:52,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:52,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:53,047 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 14:42:53,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 20 [2022-07-19 14:42:53,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:53,071 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 14:42:53,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:53,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:53,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:53,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:53,325 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:42:53,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 81 treesize of output 72 [2022-07-19 14:42:53,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:42:53,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 30 [2022-07-19 14:42:53,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 25 [2022-07-19 14:42:53,522 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:42:53,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 89 treesize of output 48 [2022-07-19 14:42:53,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:53,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 treesize of output 10 [2022-07-19 14:42:53,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:42:53,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-19 14:42:53,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:42:53,789 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-19 14:42:53,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 95 treesize of output 77 [2022-07-19 14:42:53,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:42:53,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2022-07-19 14:42:53,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:42:53,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:42:53,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:42:53,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2022-07-19 14:42:53,820 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-19 14:42:53,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 30 [2022-07-19 14:42:54,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:42:54,813 INFO L356 Elim1Store]: treesize reduction 366, result has 12.9 percent of original size [2022-07-19 14:42:54,815 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-19 14:42:54,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-19 14:42:55,015 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 [2022-07-19 14:42:55,016 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_83| input size 106 context size 106 output size 106 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-19 14:42:55,018 INFO L158 Benchmark]: Toolchain (without parser) took 22007.34ms. Allocated memory was 92.3MB in the beginning and 197.1MB in the end (delta: 104.9MB). Free memory was 53.9MB in the beginning and 100.2MB in the end (delta: -46.3MB). Peak memory consumption was 59.1MB. Max. memory is 16.1GB. [2022-07-19 14:42:55,019 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 92.3MB. Free memory was 72.0MB in the beginning and 71.9MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:42:55,019 INFO L158 Benchmark]: CACSL2BoogieTranslator took 405.66ms. Allocated memory is still 92.3MB. Free memory was 53.8MB in the beginning and 59.9MB in the end (delta: -6.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 14:42:55,019 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.90ms. Allocated memory is still 92.3MB. Free memory was 59.5MB in the beginning and 57.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:42:55,019 INFO L158 Benchmark]: Boogie Preprocessor took 26.81ms. Allocated memory is still 92.3MB. Free memory was 57.4MB in the beginning and 55.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:42:55,019 INFO L158 Benchmark]: RCFGBuilder took 372.98ms. Allocated memory is still 92.3MB. Free memory was 55.7MB in the beginning and 41.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-19 14:42:55,020 INFO L158 Benchmark]: TraceAbstraction took 21164.39ms. Allocated memory was 92.3MB in the beginning and 197.1MB in the end (delta: 104.9MB). Free memory was 40.3MB in the beginning and 100.2MB in the end (delta: -59.9MB). Peak memory consumption was 48.5MB. Max. memory is 16.1GB. [2022-07-19 14:42:55,021 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 92.3MB. Free memory was 72.0MB in the beginning and 71.9MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 405.66ms. Allocated memory is still 92.3MB. Free memory was 53.8MB in the beginning and 59.9MB in the end (delta: -6.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.90ms. Allocated memory is still 92.3MB. Free memory was 59.5MB in the beginning and 57.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.81ms. Allocated memory is still 92.3MB. Free memory was 57.4MB in the beginning and 55.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 372.98ms. Allocated memory is still 92.3MB. Free memory was 55.7MB in the beginning and 41.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 21164.39ms. Allocated memory was 92.3MB in the beginning and 197.1MB in the end (delta: 104.9MB). Free memory was 40.3MB in the beginning and 100.2MB in the end (delta: -59.9MB). Peak memory consumption was 48.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_83| input size 106 context size 106 output size 106 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_83| input size 106 context size 106 output size 106: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-19 14:42:55,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_append_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 14:42:56,892 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 14:42:56,894 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 14:42:56,918 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 14:42:56,920 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 14:42:56,921 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 14:42:56,925 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 14:42:56,928 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 14:42:56,930 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 14:42:56,933 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 14:42:56,934 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 14:42:56,936 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 14:42:56,937 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 14:42:56,938 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 14:42:56,940 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 14:42:56,943 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 14:42:56,944 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 14:42:56,945 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 14:42:56,947 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 14:42:56,950 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 14:42:56,953 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 14:42:56,953 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 14:42:56,955 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 14:42:56,956 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 14:42:56,957 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 14:42:56,962 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 14:42:56,965 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 14:42:56,966 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 14:42:56,967 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 14:42:56,967 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 14:42:56,968 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 14:42:56,968 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 14:42:56,970 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 14:42:56,970 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 14:42:56,972 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 14:42:56,972 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 14:42:56,973 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 14:42:56,973 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 14:42:56,973 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 14:42:56,974 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 14:42:56,974 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 14:42:56,975 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 14:42:56,984 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-19 14:42:57,007 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 14:42:57,008 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 14:42:57,009 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 14:42:57,009 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 14:42:57,010 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 14:42:57,010 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 14:42:57,011 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 14:42:57,011 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 14:42:57,011 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 14:42:57,012 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 14:42:57,018 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 14:42:57,018 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 14:42:57,018 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 14:42:57,018 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 14:42:57,019 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 14:42:57,019 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 14:42:57,019 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-19 14:42:57,019 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-19 14:42:57,020 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-19 14:42:57,020 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 14:42:57,020 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 14:42:57,020 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 14:42:57,021 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 14:42:57,021 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 14:42:57,021 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 14:42:57,021 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 14:42:57,022 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:42:57,022 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 14:42:57,022 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 14:42:57,022 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 14:42:57,023 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-19 14:42:57,023 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-19 14:42:57,023 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 14:42:57,023 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 14:42:57,024 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 14:42:57,024 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-19 14:42:57,024 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab [2022-07-19 14:42:57,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 14:42:57,351 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 14:42:57,353 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 14:42:57,354 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 14:42:57,355 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 14:42:57,356 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_append_equal.i [2022-07-19 14:42:57,417 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7e0b79f5/b8ba49d7e1b14348ac9f2c91a8de2167/FLAG2b1909154 [2022-07-19 14:42:57,869 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 14:42:57,870 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2022-07-19 14:42:57,885 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7e0b79f5/b8ba49d7e1b14348ac9f2c91a8de2167/FLAG2b1909154 [2022-07-19 14:42:58,235 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7e0b79f5/b8ba49d7e1b14348ac9f2c91a8de2167 [2022-07-19 14:42:58,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 14:42:58,238 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 14:42:58,243 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 14:42:58,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 14:42:58,247 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 14:42:58,247 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:42:58" (1/1) ... [2022-07-19 14:42:58,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@709f55c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:58, skipping insertion in model container [2022-07-19 14:42:58,249 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:42:58" (1/1) ... [2022-07-19 14:42:58,254 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 14:42:58,284 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 14:42:58,552 WARN L230 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_append_equal.i[24433,24446] [2022-07-19 14:42:58,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:42:58,564 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 14:42:58,606 WARN L230 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_append_equal.i[24433,24446] [2022-07-19 14:42:58,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:42:58,636 INFO L208 MainTranslator]: Completed translation [2022-07-19 14:42:58,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:58 WrapperNode [2022-07-19 14:42:58,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 14:42:58,638 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 14:42:58,638 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 14:42:58,638 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 14:42:58,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:58" (1/1) ... [2022-07-19 14:42:58,659 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:58" (1/1) ... [2022-07-19 14:42:58,690 INFO L137 Inliner]: procedures = 130, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 137 [2022-07-19 14:42:58,691 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 14:42:58,692 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 14:42:58,692 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 14:42:58,693 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 14:42:58,699 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:58" (1/1) ... [2022-07-19 14:42:58,700 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:58" (1/1) ... [2022-07-19 14:42:58,721 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:58" (1/1) ... [2022-07-19 14:42:58,722 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:58" (1/1) ... [2022-07-19 14:42:58,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:58" (1/1) ... [2022-07-19 14:42:58,746 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:58" (1/1) ... [2022-07-19 14:42:58,749 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:58" (1/1) ... [2022-07-19 14:42:58,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 14:42:58,763 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 14:42:58,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 14:42:58,763 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 14:42:58,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:58" (1/1) ... [2022-07-19 14:42:58,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:42:58,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:42:58,803 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) [2022-07-19 14:42:58,805 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 [2022-07-19 14:42:58,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-19 14:42:58,833 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-19 14:42:58,833 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-19 14:42:58,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 14:42:58,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 14:42:58,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 14:42:58,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 14:42:58,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 14:42:58,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 14:42:58,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-19 14:42:58,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 14:42:58,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-19 14:42:58,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 14:42:58,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 14:42:58,942 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 14:42:58,943 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 14:42:59,276 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 14:42:59,281 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 14:42:59,281 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-19 14:42:59,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:42:59 BoogieIcfgContainer [2022-07-19 14:42:59,283 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 14:42:59,284 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 14:42:59,284 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 14:42:59,287 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 14:42:59,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 02:42:58" (1/3) ... [2022-07-19 14:42:59,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a268312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:42:59, skipping insertion in model container [2022-07-19 14:42:59,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:42:58" (2/3) ... [2022-07-19 14:42:59,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a268312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:42:59, skipping insertion in model container [2022-07-19 14:42:59,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:42:59" (3/3) ... [2022-07-19 14:42:59,293 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2022-07-19 14:42:59,305 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 14:42:59,310 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 14:42:59,373 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 14:42:59,381 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5acf6ec2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@22cf7cc9 [2022-07-19 14:42:59,381 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 14:42:59,385 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) [2022-07-19 14:42:59,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-19 14:42:59,394 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:42:59,395 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] [2022-07-19 14:42:59,396 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:42:59,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:42:59,421 INFO L85 PathProgramCache]: Analyzing trace with hash -483023916, now seen corresponding path program 1 times [2022-07-19 14:42:59,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:42:59,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1279158877] [2022-07-19 14:42:59,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:42:59,435 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:42:59,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:42:59,443 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:42:59,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-19 14:42:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:42:59,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-19 14:42:59,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:42:59,665 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:42:59,665 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:42:59,666 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:42:59,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1279158877] [2022-07-19 14:42:59,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1279158877] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:42:59,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:42:59,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 14:42:59,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109044483] [2022-07-19 14:42:59,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:42:59,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 14:42:59,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:42:59,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 14:42:59,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 14:42:59,707 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 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:42:59,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:42:59,728 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2022-07-19 14:42:59,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 14:42:59,730 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-07-19 14:42:59,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:42:59,736 INFO L225 Difference]: With dead ends: 65 [2022-07-19 14:42:59,736 INFO L226 Difference]: Without dead ends: 28 [2022-07-19 14:42:59,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 14:42:59,746 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:42:59,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:42:59,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-19 14:42:59,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-07-19 14:42:59,779 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) [2022-07-19 14:42:59,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-07-19 14:42:59,783 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2022-07-19 14:42:59,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:42:59,785 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-07-19 14:42:59,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:42:59,785 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-07-19 14:42:59,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-19 14:42:59,788 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:42:59,788 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] [2022-07-19 14:42:59,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-19 14:43:00,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:43:00,001 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:43:00,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:43:00,001 INFO L85 PathProgramCache]: Analyzing trace with hash -938400178, now seen corresponding path program 1 times [2022-07-19 14:43:00,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:43:00,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [686257573] [2022-07-19 14:43:00,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:43:00,003 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:43:00,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:43:00,004 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:43:00,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-19 14:43:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:00,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 14:43:00,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:43:00,171 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:43:00,172 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:43:00,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:43:00,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [686257573] [2022-07-19 14:43:00,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [686257573] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:43:00,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:43:00,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:43:00,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517698043] [2022-07-19 14:43:00,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:43:00,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 14:43:00,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:43:00,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 14:43:00,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:43:00,181 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:43:00,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:43:00,207 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2022-07-19 14:43:00,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 14:43:00,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-07-19 14:43:00,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:43:00,213 INFO L225 Difference]: With dead ends: 52 [2022-07-19 14:43:00,214 INFO L226 Difference]: Without dead ends: 31 [2022-07-19 14:43:00,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:43:00,215 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:43:00,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 61 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:43:00,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-19 14:43:00,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-07-19 14:43:00,220 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) [2022-07-19 14:43:00,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-07-19 14:43:00,221 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 24 [2022-07-19 14:43:00,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:43:00,222 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-07-19 14:43:00,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:43:00,222 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-07-19 14:43:00,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-19 14:43:00,223 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:43:00,223 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] [2022-07-19 14:43:00,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-19 14:43:00,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:43:00,435 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:43:00,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:43:00,436 INFO L85 PathProgramCache]: Analyzing trace with hash 436872902, now seen corresponding path program 1 times [2022-07-19 14:43:00,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:43:00,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1079827999] [2022-07-19 14:43:00,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:43:00,437 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:43:00,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:43:00,438 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:43:00,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-19 14:43:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:00,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-19 14:43:00,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:43:00,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-07-19 14:43:00,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:00,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:00,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:01,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:01,046 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 14:43:01,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:43:01,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:43:01,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1079827999] [2022-07-19 14:43:01,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1079827999] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:43:01,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1916963497] [2022-07-19 14:43:01,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:43:01,161 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-19 14:43:01,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-19 14:43:01,164 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-19 14:43:01,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2022-07-19 14:43:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:01,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-19 14:43:01,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:43:01,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:01,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:01,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:01,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 [2022-07-19 14:43:01,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:01,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:01,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 [2022-07-19 14:43:01,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2022-07-19 14:43:02,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 7 [2022-07-19 14:43:02,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:02,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2022-07-19 14:43:02,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 7 [2022-07-19 14:43:02,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 14 [2022-07-19 14:43:02,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:02,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:02,250 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-19 14:43:02,251 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:43:02,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1916963497] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:43:02,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 14:43:02,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [15] total 24 [2022-07-19 14:43:02,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080273784] [2022-07-19 14:43:02,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:43:02,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 14:43:02,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:43:02,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 14:43:02,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=566, Unknown=11, NotChecked=0, Total=650 [2022-07-19 14:43:02,254 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 14:43:02,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:43:02,503 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-07-19 14:43:02,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 14:43:02,504 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2022-07-19 14:43:02,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:43:02,505 INFO L225 Difference]: With dead ends: 34 [2022-07-19 14:43:02,505 INFO L226 Difference]: Without dead ends: 32 [2022-07-19 14:43:02,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=85, Invalid=659, Unknown=12, NotChecked=0, Total=756 [2022-07-19 14:43:02,506 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 9 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:43:02,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 120 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 77 Unchecked, 0.1s Time] [2022-07-19 14:43:02,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-19 14:43:02,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-07-19 14:43:02,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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) [2022-07-19 14:43:02,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-07-19 14:43:02,514 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 32 [2022-07-19 14:43:02,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:43:02,515 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-07-19 14:43:02,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 14:43:02,516 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-07-19 14:43:02,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-19 14:43:02,518 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:43:02,518 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] [2022-07-19 14:43:02,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2022-07-19 14:43:02,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-19 14:43:02,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:43:02,923 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:43:02,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:43:02,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1130578833, now seen corresponding path program 1 times [2022-07-19 14:43:02,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:43:02,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [893267789] [2022-07-19 14:43:02,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:43:02,925 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:43:02,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:43:02,926 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:43:02,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-19 14:43:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:03,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-19 14:43:03,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:43:03,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:03,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:03,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:03,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:03,489 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 14:43:03,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:43:03,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:43:03,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [893267789] [2022-07-19 14:43:03,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [893267789] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:43:03,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [648881851] [2022-07-19 14:43:03,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:43:03,589 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-19 14:43:03,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-19 14:43:03,593 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-19 14:43:03,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2022-07-19 14:43:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:03,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-19 14:43:03,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:43:04,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:04,147 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_383 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_383) |c_#memory_$Pointer$.base|)) (not (= |c_#StackHeapBarrier| (_ bv4294967295 32))) (bvult |c_node_create_#res#1.base| |c_#StackHeapBarrier|)) is different from true [2022-07-19 14:43:04,181 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 14:43:04,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 21 [2022-07-19 14:43:04,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:04,269 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2022-07-19 14:43:04,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:43:04,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [648881851] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:43:04,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:43:04,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2022-07-19 14:43:04,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328784440] [2022-07-19 14:43:04,364 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:43:04,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-19 14:43:04,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:43:04,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-19 14:43:04,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=419, Unknown=9, NotChecked=42, Total=552 [2022-07-19 14:43:04,366 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 22 states, 20 states have (on average 1.95) internal successors, (39), 17 states have internal predecessors, (39), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-19 14:43:04,472 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_383 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_383) |c_#memory_$Pointer$.base|)) (not (= |c_#StackHeapBarrier| (_ bv4294967295 32))) (exists ((v_ArrVal_313 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_313)))) (not (= |c_node_create_#res#1.base| (_ bv0 32))) (not (= (_ bv0 32) |c_node_create_~temp~0#1.base|)) (bvult |c_node_create_#res#1.base| |c_#StackHeapBarrier|)) is different from true [2022-07-19 14:43:04,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:43:04,690 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2022-07-19 14:43:04,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 14:43:04,691 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 1.95) internal successors, (39), 17 states have internal predecessors, (39), 4 states have call successors, (6), 2 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 35 [2022-07-19 14:43:04,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:43:04,693 INFO L225 Difference]: With dead ends: 40 [2022-07-19 14:43:04,693 INFO L226 Difference]: Without dead ends: 30 [2022-07-19 14:43:04,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=580, Unknown=12, NotChecked=102, Total=812 [2022-07-19 14:43:04,695 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 11 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 14:43:04,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 197 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 126 Invalid, 0 Unknown, 72 Unchecked, 0.2s Time] [2022-07-19 14:43:04,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-19 14:43:04,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-07-19 14:43:04,699 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) [2022-07-19 14:43:04,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-07-19 14:43:04,700 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 35 [2022-07-19 14:43:04,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:43:04,700 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-07-19 14:43:04,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 1.95) internal successors, (39), 17 states have internal predecessors, (39), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-19 14:43:04,701 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-07-19 14:43:04,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-19 14:43:04,701 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:43:04,702 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] [2022-07-19 14:43:04,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2022-07-19 14:43:04,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-19 14:43:05,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:43:05,106 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:43:05,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:43:05,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1205420011, now seen corresponding path program 1 times [2022-07-19 14:43:05,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:43:05,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [204335512] [2022-07-19 14:43:05,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:43:05,107 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:43:05,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:43:05,109 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:43:05,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-19 14:43:05,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:05,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-19 14:43:05,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:43:05,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:05,592 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-19 14:43:05,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 27 [2022-07-19 14:43:05,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:05,720 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:43:05,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 33 [2022-07-19 14:43:05,860 INFO L356 Elim1Store]: treesize reduction 3, result has 81.3 percent of original size [2022-07-19 14:43:05,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 51 treesize of output 35 [2022-07-19 14:43:05,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-07-19 14:43:05,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 11 [2022-07-19 14:43:06,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:06,088 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-19 14:43:06,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 57 treesize of output 55 [2022-07-19 14:43:06,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:06,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 48 treesize of output 48 [2022-07-19 14:43:06,121 INFO L356 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-07-19 14:43:06,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 38 [2022-07-19 14:43:06,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 44 treesize of output 32 [2022-07-19 14:43:06,319 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-07-19 14:43:06,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 55 treesize of output 31 [2022-07-19 14:43:06,377 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:43:06,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:43:06,571 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:43:06,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [204335512] [2022-07-19 14:43:06,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [204335512] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:43:06,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1020372335] [2022-07-19 14:43:06,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:43:06,572 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-19 14:43:06,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-19 14:43:06,573 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-19 14:43:06,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2022-07-19 14:43:06,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:06,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-19 14:43:06,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:43:06,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:07,354 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-19 14:43:07,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 27 [2022-07-19 14:43:07,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:07,631 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:43:07,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 33 [2022-07-19 14:43:07,848 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 14:43:07,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 53 treesize of output 28 [2022-07-19 14:43:07,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 14 [2022-07-19 14:43:07,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:08,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:08,070 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-19 14:43:08,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 59 treesize of output 55 [2022-07-19 14:43:08,097 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-19 14:43:08,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 37 [2022-07-19 14:43:08,142 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 14:43:08,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-19 14:43:08,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-07-19 14:43:08,640 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 14:43:08,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 62 treesize of output 25 [2022-07-19 14:43:08,757 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:43:08,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:43:08,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1020372335] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:43:08,904 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:43:08,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 40 [2022-07-19 14:43:08,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594283570] [2022-07-19 14:43:08,905 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:43:08,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-19 14:43:08,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:43:08,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-19 14:43:08,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1588, Unknown=11, NotChecked=0, Total=1806 [2022-07-19 14:43:08,907 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 40 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 30 states have internal predecessors, (51), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-19 14:43:09,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:43:09,628 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2022-07-19 14:43:09,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-19 14:43:09,629 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 30 states have internal predecessors, (51), 6 states have call successors, (6), 5 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 35 [2022-07-19 14:43:09,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:43:09,630 INFO L225 Difference]: With dead ends: 62 [2022-07-19 14:43:09,630 INFO L226 Difference]: Without dead ends: 53 [2022-07-19 14:43:09,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=292, Invalid=2145, Unknown=13, NotChecked=0, Total=2450 [2022-07-19 14:43:09,632 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 43 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 14:43:09,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 229 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 179 Invalid, 0 Unknown, 87 Unchecked, 0.3s Time] [2022-07-19 14:43:09,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-19 14:43:09,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 45. [2022-07-19 14:43:09,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 37 states have internal predecessors, (41), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-19 14:43:09,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2022-07-19 14:43:09,644 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 35 [2022-07-19 14:43:09,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:43:09,646 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2022-07-19 14:43:09,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 30 states have internal predecessors, (51), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-19 14:43:09,648 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-07-19 14:43:09,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 14:43:09,649 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:43:09,650 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] [2022-07-19 14:43:09,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2022-07-19 14:43:09,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-07-19 14:43:10,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:43:10,054 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:43:10,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:43:10,055 INFO L85 PathProgramCache]: Analyzing trace with hash 790772624, now seen corresponding path program 1 times [2022-07-19 14:43:10,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:43:10,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778926350] [2022-07-19 14:43:10,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:43:10,056 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:43:10,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:43:10,057 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:43:10,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-19 14:43:10,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:10,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 90 conjunts are in the unsatisfiable core [2022-07-19 14:43:10,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:43:10,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:10,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:10,415 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-19 14:43:10,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 [2022-07-19 14:43:10,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-07-19 14:43:10,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:10,638 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-19 14:43:10,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 41 [2022-07-19 14:43:10,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-19 14:43:10,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:10,881 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:43:10,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 49 treesize of output 46 [2022-07-19 14:43:10,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-19 14:43:11,085 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-19 14:43:11,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 85 treesize of output 36 [2022-07-19 14:43:11,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-07-19 14:43:11,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 15 [2022-07-19 14:43:11,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:11,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:11,371 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-19 14:43:11,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 91 treesize of output 79 [2022-07-19 14:43:11,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:11,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:11,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:11,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 70 treesize of output 66 [2022-07-19 14:43:11,429 INFO L356 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2022-07-19 14:43:11,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 46 [2022-07-19 14:43:12,361 INFO L356 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-07-19 14:43:12,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 177 treesize of output 88 [2022-07-19 14:43:12,441 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-19 14:43:12,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 244 treesize of output 147 [2022-07-19 14:43:12,465 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-19 14:43:12,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 210 treesize of output 163 [2022-07-19 14:43:12,491 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:43:12,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 178 treesize of output 165 [2022-07-19 14:43:12,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 53 [2022-07-19 14:43:12,638 INFO L356 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2022-07-19 14:43:12,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 40 [2022-07-19 14:43:12,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-07-19 14:43:12,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:12,783 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 14:43:12,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:43:12,942 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_append_~last~1#1.offset| (_ BitVec 32)) (v_ArrVal_641 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_642 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_648 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_647 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_641) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_642) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_647) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_648) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-07-19 14:43:12,996 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_641 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_642 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| (_ BitVec 32)) (v_ArrVal_648 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_647 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_641) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_642) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_647) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_648) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-07-19 14:43:13,044 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_641 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_642 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| (_ BitVec 32)) (v_ArrVal_648 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_647 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_641) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_642) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_647) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_648) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-07-19 14:43:13,073 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_641 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_642 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| (_ BitVec 32)) (v_ArrVal_648 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_647 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_641) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_642) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_647) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_648) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-07-19 14:43:13,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:43:13,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1778926350] [2022-07-19 14:43:13,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1778926350] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:43:13,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [236263053] [2022-07-19 14:43:13,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:43:13,636 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-19 14:43:13,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-19 14:43:13,637 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-19 14:43:13,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2022-07-19 14:43:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:13,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 75 conjunts are in the unsatisfiable core [2022-07-19 14:43:13,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:43:14,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:14,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 6 [2022-07-19 14:43:14,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:14,717 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-19 14:43:14,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 27 [2022-07-19 14:43:14,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:14,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:15,052 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:43:15,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 49 treesize of output 46 [2022-07-19 14:43:15,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2022-07-19 14:43:15,360 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:43:15,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 77 treesize of output 36 [2022-07-19 14:43:15,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 11 [2022-07-19 14:43:15,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-07-19 14:43:15,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:15,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:15,614 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-19 14:43:15,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 83 treesize of output 73 [2022-07-19 14:43:15,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:15,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2022-07-19 14:43:15,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:15,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 70 treesize of output 66 [2022-07-19 14:43:15,660 INFO L356 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-07-19 14:43:15,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 38 [2022-07-19 14:43:16,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:16,780 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-19 14:43:16,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 case distinctions, treesize of input 134 treesize of output 111 [2022-07-19 14:43:16,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:16,817 INFO L356 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-07-19 14:43:16,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 101 treesize of output 98 [2022-07-19 14:43:16,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2022-07-19 14:43:17,197 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:43:17,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 78 treesize of output 33 [2022-07-19 14:43:17,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-07-19 14:43:17,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:17,324 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:43:17,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:43:17,343 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_750 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_751 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_752 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_747 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_748 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_749 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_748) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_750) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_749) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_751) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_747) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_752) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-19 14:43:17,371 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_750 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_751 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_752 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_747 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_748 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_749 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_748) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_750) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_749) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_751) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_747) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_752) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-07-19 14:43:17,405 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_750 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_751 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_752 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_747 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_748 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_749 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_748) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_750) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_749) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_751) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_747) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_752) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))))) is different from false [2022-07-19 14:43:17,424 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_750 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_751 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_752 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_747 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_748 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_749 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_748) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_750) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_749) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_751) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_747) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_752) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-07-19 14:43:18,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [236263053] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:43:18,030 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:43:18,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 44 [2022-07-19 14:43:18,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331924433] [2022-07-19 14:43:18,030 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:43:18,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-19 14:43:18,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:43:18,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-19 14:43:18,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2183, Unknown=18, NotChecked=808, Total=3192 [2022-07-19 14:43:18,033 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 44 states, 40 states have (on average 1.375) internal successors, (55), 33 states have internal predecessors, (55), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-19 14:43:20,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:43:20,092 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-07-19 14:43:20,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-19 14:43:20,092 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 40 states have (on average 1.375) internal successors, (55), 33 states have internal predecessors, (55), 6 states have call successors, (6), 5 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 [2022-07-19 14:43:20,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:43:20,093 INFO L225 Difference]: With dead ends: 54 [2022-07-19 14:43:20,094 INFO L226 Difference]: Without dead ends: 52 [2022-07-19 14:43:20,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=276, Invalid=3398, Unknown=18, NotChecked=1000, Total=4692 [2022-07-19 14:43:20,096 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 18 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 14:43:20,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 237 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 292 Invalid, 0 Unknown, 123 Unchecked, 0.5s Time] [2022-07-19 14:43:20,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-07-19 14:43:20,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2022-07-19 14:43:20,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 43 states have internal predecessors, (48), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-19 14:43:20,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2022-07-19 14:43:20,105 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 37 [2022-07-19 14:43:20,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:43:20,105 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2022-07-19 14:43:20,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 40 states have (on average 1.375) internal successors, (55), 33 states have internal predecessors, (55), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-19 14:43:20,106 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2022-07-19 14:43:20,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-19 14:43:20,107 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:43:20,107 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] [2022-07-19 14:43:20,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2022-07-19 14:43:20,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-19 14:43:20,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:43:20,511 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:43:20,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:43:20,512 INFO L85 PathProgramCache]: Analyzing trace with hash -718486453, now seen corresponding path program 2 times [2022-07-19 14:43:20,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:43:20,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [350676891] [2022-07-19 14:43:20,513 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 14:43:20,513 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:43:20,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:43:20,514 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:43:20,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-19 14:43:20,765 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 14:43:20,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:43:20,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-19 14:43:20,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:43:20,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:21,002 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-19 14:43:21,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 27 [2022-07-19 14:43:21,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:21,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:21,172 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-19 14:43:21,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 67 treesize of output 49 [2022-07-19 14:43:21,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:21,337 INFO L356 Elim1Store]: treesize reduction 32, result has 28.9 percent of original size [2022-07-19 14:43:21,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 120 treesize of output 70 [2022-07-19 14:43:21,350 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-19 14:43:21,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 22 [2022-07-19 14:43:21,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 10 [2022-07-19 14:43:21,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:21,598 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-19 14:43:21,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 126 treesize of output 112 [2022-07-19 14:43:21,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:21,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:21,627 INFO L356 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2022-07-19 14:43:21,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 124 treesize of output 115 [2022-07-19 14:43:21,651 INFO L356 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-07-19 14:43:21,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 37 [2022-07-19 14:43:22,017 INFO L356 Elim1Store]: treesize reduction 32, result has 28.9 percent of original size [2022-07-19 14:43:22,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 184 treesize of output 86 [2022-07-19 14:43:22,033 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-19 14:43:22,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 28 [2022-07-19 14:43:22,103 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:43:22,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:43:22,539 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:43:22,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [350676891] [2022-07-19 14:43:22,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [350676891] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:43:22,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [736110030] [2022-07-19 14:43:22,540 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 14:43:22,540 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-19 14:43:22,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-19 14:43:22,544 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-19 14:43:22,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2022-07-19 14:43:22,906 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 14:43:22,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:43:22,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 121 conjunts are in the unsatisfiable core [2022-07-19 14:43:22,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:43:22,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:23,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:23,489 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-19 14:43:23,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 20 treesize of output 27 [2022-07-19 14:43:23,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-19 14:43:23,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:23,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:23,895 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-19 14:43:23,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 69 treesize of output 47 [2022-07-19 14:43:23,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:23,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 22 [2022-07-19 14:43:24,277 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-19 14:43:24,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 63 [2022-07-19 14:43:24,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:24,301 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 14:43:24,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 13 [2022-07-19 14:43:24,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 10 [2022-07-19 14:43:24,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:24,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-19 14:43:28,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:28,959 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-19 14:43:28,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 151 treesize of output 102 [2022-07-19 14:43:28,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:28,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:28,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:29,013 INFO L356 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-07-19 14:43:29,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 123 treesize of output 114 [2022-07-19 14:43:29,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:29,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:29,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:29,058 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-19 14:43:29,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 31 treesize of output 21 [2022-07-19 14:43:31,246 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:43:31,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:43:31,536 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_957 (_ BitVec 32)) (v_ArrVal_956 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_952 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_953 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_953))) (store .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_957))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_956) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_952) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-19 14:43:36,486 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:43:36,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 949 treesize of output 950 [2022-07-19 14:43:45,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [736110030] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:43:45,148 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:43:45,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 41 [2022-07-19 14:43:45,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460802298] [2022-07-19 14:43:45,148 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:43:45,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-19 14:43:45,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:43:45,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-19 14:43:45,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=2900, Unknown=28, NotChecked=110, Total=3306 [2022-07-19 14:43:45,151 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand has 41 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 32 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-19 14:43:54,801 WARN L233 SmtUtils]: Spent 8.20s on a formula simplification. DAG size of input: 74 DAG size of output: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 14:43:54,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:43:54,855 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2022-07-19 14:43:54,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-19 14:43:54,856 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 32 states have internal predecessors, (58), 6 states have call successors, (6), 4 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 39 [2022-07-19 14:43:54,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:43:54,857 INFO L225 Difference]: With dead ends: 72 [2022-07-19 14:43:54,857 INFO L226 Difference]: Without dead ends: 61 [2022-07-19 14:43:54,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1324 ImplicationChecksByTransitivity, 23.8s TimeCoverageRelationStatistics Valid=312, Invalid=3320, Unknown=32, NotChecked=118, Total=3782 [2022-07-19 14:43:54,858 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 7 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 232 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 14:43:54,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 321 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 104 Invalid, 0 Unknown, 232 Unchecked, 0.3s Time] [2022-07-19 14:43:54,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-19 14:43:54,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-07-19 14:43:54,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 50 states have (on average 1.1) internal successors, (55), 51 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-19 14:43:54,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2022-07-19 14:43:54,867 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 39 [2022-07-19 14:43:54,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:43:54,871 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2022-07-19 14:43:54,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 32 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-19 14:43:54,872 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2022-07-19 14:43:54,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-19 14:43:54,875 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:43:54,875 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] [2022-07-19 14:43:54,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2022-07-19 14:43:55,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-19 14:43:55,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:43:55,280 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:43:55,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:43:55,280 INFO L85 PathProgramCache]: Analyzing trace with hash 12485255, now seen corresponding path program 1 times [2022-07-19 14:43:55,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:43:55,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [28630919] [2022-07-19 14:43:55,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:43:55,281 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:43:55,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:43:55,282 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:43:55,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-19 14:43:55,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:55,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-19 14:43:55,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:43:55,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:55,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:55,601 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-19 14:43:55,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 [2022-07-19 14:43:55,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-07-19 14:43:55,725 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-19 14:43:55,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 41 [2022-07-19 14:43:55,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:55,877 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:43:55,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 37 [2022-07-19 14:43:55,999 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-19 14:43:55,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 73 treesize of output 28 [2022-07-19 14:43:56,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 14 [2022-07-19 14:43:56,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:56,166 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-19 14:43:56,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 79 treesize of output 69 [2022-07-19 14:43:56,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:43:56,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 62 treesize of output 60 [2022-07-19 14:43:56,203 INFO L356 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2022-07-19 14:43:56,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 45 [2022-07-19 14:43:56,887 INFO L356 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-07-19 14:43:56,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 72 [2022-07-19 14:43:56,942 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-19 14:43:56,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 196 treesize of output 121 [2022-07-19 14:43:56,964 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-19 14:43:56,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 131 [2022-07-19 14:43:56,990 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:43:56,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 134 treesize of output 127 [2022-07-19 14:43:57,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 119 treesize of output 91 [2022-07-19 14:43:57,326 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-07-19 14:43:57,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 36 [2022-07-19 14:43:57,443 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 14:43:57,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:43:57,589 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_append_~last~1#1.offset| (_ BitVec 32)) (v_ArrVal_1058 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_1060 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1058))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1060) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2022-07-19 14:43:57,636 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_24| (_ BitVec 32)) (v_ArrVal_1058 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_1060 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_24| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1058))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_24| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1060) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) is different from false [2022-07-19 14:43:57,664 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_24| (_ BitVec 32)) (v_ArrVal_1058 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_1060 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_24| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1058))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_24| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1060) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) is different from false [2022-07-19 14:43:57,682 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_24| (_ BitVec 32)) (v_ArrVal_1058 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_1060 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_24| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1058))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_24| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1060) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-07-19 14:43:58,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:43:58,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [28630919] [2022-07-19 14:43:58,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [28630919] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:43:58,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1863864780] [2022-07-19 14:43:58,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:43:58,112 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-19 14:43:58,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-19 14:43:58,113 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-19 14:43:58,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2022-07-19 14:43:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:43:58,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-19 14:43:58,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:43:58,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:58,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 6 [2022-07-19 14:43:59,238 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-19 14:43:59,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 27 [2022-07-19 14:43:59,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:59,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:43:59,575 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:43:59,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 48 treesize of output 45 [2022-07-19 14:43:59,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2022-07-19 14:43:59,955 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:43:59,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 80 treesize of output 39 [2022-07-19 14:43:59,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 10 [2022-07-19 14:43:59,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2022-07-19 14:44:00,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:00,171 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-19 14:44:00,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 86 treesize of output 76 [2022-07-19 14:44:00,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:00,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:00,186 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-19 14:44:00,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 81 [2022-07-19 14:44:00,210 INFO L356 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-07-19 14:44:00,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 37 [2022-07-19 14:44:01,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:01,520 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-19 14:44:01,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 case distinctions, treesize of input 117 treesize of output 100 [2022-07-19 14:44:01,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:01,569 INFO L356 Elim1Store]: treesize reduction 66, result has 23.3 percent of original size [2022-07-19 14:44:01,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 95 treesize of output 95 [2022-07-19 14:44:01,955 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-19 14:44:01,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 52 [2022-07-19 14:44:02,296 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:44:02,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 66 treesize of output 29 [2022-07-19 14:44:04,349 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:44:04,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:44:04,368 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1151 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1152 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1150 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1153 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1150) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1153))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1151) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1152) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-07-19 14:44:05,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1863864780] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:44:05,906 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:44:05,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 27] total 46 [2022-07-19 14:44:05,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583490367] [2022-07-19 14:44:05,906 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:44:05,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-19 14:44:05,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:44:05,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-19 14:44:05,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=2761, Unknown=20, NotChecked=550, Total=3540 [2022-07-19 14:44:05,908 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 46 states, 42 states have (on average 1.380952380952381) internal successors, (58), 35 states have internal predecessors, (58), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-19 14:44:07,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:44:07,672 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2022-07-19 14:44:07,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-19 14:44:07,672 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 42 states have (on average 1.380952380952381) internal successors, (58), 35 states have internal predecessors, (58), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2022-07-19 14:44:07,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:44:07,673 INFO L225 Difference]: With dead ends: 67 [2022-07-19 14:44:07,673 INFO L226 Difference]: Without dead ends: 64 [2022-07-19 14:44:07,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1097 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=303, Invalid=4119, Unknown=20, NotChecked=670, Total=5112 [2022-07-19 14:44:07,675 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 16 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 211 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 14:44:07,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 392 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 135 Invalid, 0 Unknown, 211 Unchecked, 0.2s Time] [2022-07-19 14:44:07,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-07-19 14:44:07,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2022-07-19 14:44:07,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 53 states have internal predecessors, (57), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-19 14:44:07,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2022-07-19 14:44:07,687 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 40 [2022-07-19 14:44:07,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:44:07,687 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2022-07-19 14:44:07,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 42 states have (on average 1.380952380952381) internal successors, (58), 35 states have internal predecessors, (58), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-19 14:44:07,688 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2022-07-19 14:44:07,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-19 14:44:07,689 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:44:07,689 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] [2022-07-19 14:44:07,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2022-07-19 14:44:07,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-07-19 14:44:08,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:44:08,092 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:44:08,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:44:08,092 INFO L85 PathProgramCache]: Analyzing trace with hash 387084070, now seen corresponding path program 1 times [2022-07-19 14:44:08,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:44:08,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [201503944] [2022-07-19 14:44:08,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:44:08,092 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:44:08,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:44:08,093 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:44:08,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-19 14:44:08,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:08,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 106 conjunts are in the unsatisfiable core [2022-07-19 14:44:08,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:44:08,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:44:08,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:44:08,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:44:08,544 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-19 14:44:08,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 [2022-07-19 14:44:08,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:44:08,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-07-19 14:44:08,803 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 14:44:08,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-19 14:44:08,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:44:08,851 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-19 14:44:08,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 41 [2022-07-19 14:44:08,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:44:09,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-19 14:44:09,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:44:09,254 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:44:09,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 79 treesize of output 70 [2022-07-19 14:44:09,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-19 14:44:09,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-07-19 14:44:09,533 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-19 14:44:09,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 111 treesize of output 50 [2022-07-19 14:44:09,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2022-07-19 14:44:09,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-07-19 14:44:09,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 19 [2022-07-19 14:44:09,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:09,800 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-19 14:44:09,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 117 treesize of output 99 [2022-07-19 14:44:09,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:09,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:09,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 99 [2022-07-19 14:44:09,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:09,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-07-19 14:44:09,853 INFO L356 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2022-07-19 14:44:09,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 50 [2022-07-19 14:44:10,785 INFO L356 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-07-19 14:44:10,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 253 treesize of output 131 [2022-07-19 14:44:10,866 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-19 14:44:10,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 380 treesize of output 255 [2022-07-19 14:44:10,911 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-19 14:44:10,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 new quantified variables, introduced 2 case distinctions, treesize of input 345 treesize of output 211 [2022-07-19 14:44:10,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 74 treesize of output 68 [2022-07-19 14:44:10,970 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-07-19 14:44:10,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 154 treesize of output 132 [2022-07-19 14:44:10,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 44 [2022-07-19 14:44:11,413 INFO L356 Elim1Store]: treesize reduction 64, result has 11.1 percent of original size [2022-07-19 14:44:11,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 160 treesize of output 68 [2022-07-19 14:44:11,437 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-19 14:44:11,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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 [2022-07-19 14:44:11,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:44:11,635 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:44:11,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:44:11,988 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1265 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1266 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1263 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_1253 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1266)) (.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1265))) (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 |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_1253)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1263) (select (select .cse0 .cse1) .cse2)) (bvadd (_ bv4 32) (select (select .cse3 .cse1) .cse2))))))) is different from false [2022-07-19 14:44:12,113 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1265 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1266 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1263 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_1253 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1266)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1265))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_1253)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1263) (select (select .cse2 .cse3) .cse4)) (bvadd (_ bv4 32) (select (select .cse5 .cse3) .cse4)))))))) is different from false [2022-07-19 14:44:12,210 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1265 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1266 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1263 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_1253 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse6) .cse7)) (.cse1 (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1266)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1265))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_1253)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1263) (select (select .cse2 .cse3) .cse4)) (bvadd (_ bv4 32) (select (select .cse5 .cse3) .cse4))))))))) is different from false [2022-07-19 14:44:12,323 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1265 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1266 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1263 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_1253 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse6) .cse7)) (.cse1 (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1266)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1265))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_1253)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1263) (select (select .cse2 .cse3) .cse4)) (bvadd (_ bv4 32) (select (select .cse5 .cse3) .cse4))))))))) is different from false [2022-07-19 14:44:15,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:44:15,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [201503944] [2022-07-19 14:44:15,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [201503944] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:44:15,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1191936460] [2022-07-19 14:44:15,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:44:15,352 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-19 14:44:15,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-19 14:44:15,353 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-19 14:44:15,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2022-07-19 14:44:15,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:15,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 96 conjunts are in the unsatisfiable core [2022-07-19 14:44:15,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:44:16,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:44:16,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:44:16,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 6 [2022-07-19 14:44:16,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:44:17,204 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 14:44:17,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 20 [2022-07-19 14:44:17,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:44:17,258 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-19 14:44:17,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 27 [2022-07-19 14:44:17,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:44:17,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:44:17,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:44:17,836 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:44:17,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 78 treesize of output 69 [2022-07-19 14:44:17,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 26 [2022-07-19 14:44:17,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2022-07-19 14:44:18,353 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:44:18,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 102 treesize of output 49 [2022-07-19 14:44:18,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 13 [2022-07-19 14:44:18,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2022-07-19 14:44:18,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:44:18,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:18,666 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-19 14:44:18,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 108 treesize of output 92 [2022-07-19 14:44:18,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:18,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:18,685 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-19 14:44:18,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 98 [2022-07-19 14:44:18,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:18,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 28 [2022-07-19 14:44:18,723 INFO L356 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-07-19 14:44:18,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 40 [2022-07-19 14:44:20,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:20,508 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-19 14:44:20,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 case distinctions, treesize of input 186 treesize of output 149 [2022-07-19 14:44:20,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:20,565 INFO L356 Elim1Store]: treesize reduction 66, result has 23.3 percent of original size [2022-07-19 14:44:20,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 164 treesize of output 150 [2022-07-19 14:44:20,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 70 treesize of output 60 [2022-07-19 14:44:20,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-07-19 14:44:21,270 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:44:21,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 124 treesize of output 55 [2022-07-19 14:44:21,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2022-07-19 14:44:21,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-07-19 14:44:21,494 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:44:21,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:44:21,529 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1371 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1366 (_ BitVec 32)) (v_ArrVal_1370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1369 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1367 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1368) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1370)) (.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1367) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1369))) (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 |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_1366)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1371) (select (select .cse0 .cse1) .cse2)) (bvadd (_ bv4 32) (select (select .cse3 .cse1) .cse2))))))) is different from false [2022-07-19 14:44:25,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1191936460] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:44:25,481 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:44:25,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 48 [2022-07-19 14:44:25,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646458669] [2022-07-19 14:44:25,481 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:44:25,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-19 14:44:25,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:44:25,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-19 14:44:25,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=3093, Unknown=22, NotChecked=580, Total=3906 [2022-07-19 14:44:25,484 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 48 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 36 states have internal predecessors, (64), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-19 14:44:28,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:44:28,167 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2022-07-19 14:44:28,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-19 14:44:28,167 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 36 states have internal predecessors, (64), 6 states have call successors, (6), 6 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 41 [2022-07-19 14:44:28,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:44:28,168 INFO L225 Difference]: With dead ends: 68 [2022-07-19 14:44:28,168 INFO L226 Difference]: Without dead ends: 66 [2022-07-19 14:44:28,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=280, Invalid=4410, Unknown=22, NotChecked=690, Total=5402 [2022-07-19 14:44:28,170 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 7 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 256 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 14:44:28,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 357 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 202 Invalid, 0 Unknown, 256 Unchecked, 0.3s Time] [2022-07-19 14:44:28,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-19 14:44:28,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2022-07-19 14:44:28,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 55 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-19 14:44:28,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2022-07-19 14:44:28,180 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 41 [2022-07-19 14:44:28,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:44:28,180 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2022-07-19 14:44:28,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 36 states have internal predecessors, (64), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-19 14:44:28,180 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-07-19 14:44:28,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-19 14:44:28,181 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:44:28,181 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:44:28,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2022-07-19 14:44:28,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-07-19 14:44:28,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:44:28,586 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:44:28,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:44:28,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1003701405, now seen corresponding path program 2 times [2022-07-19 14:44:28,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:44:28,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1444361065] [2022-07-19 14:44:28,587 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 14:44:28,587 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:44:28,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:44:28,589 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:44:28,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-19 14:44:28,776 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 14:44:28,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:44:28,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 14:44:28,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:44:28,801 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 14:44:28,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:44:28,843 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-19 14:44:28,843 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:44:28,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1444361065] [2022-07-19 14:44:28,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1444361065] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:44:28,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:44:28,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-19 14:44:28,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683399481] [2022-07-19 14:44:28,844 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:44:28,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 14:44:28,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:44:28,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 14:44:28,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:44:28,845 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-19 14:44:28,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:44:28,875 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2022-07-19 14:44:28,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:44:28,876 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 43 [2022-07-19 14:44:28,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:44:28,877 INFO L225 Difference]: With dead ends: 72 [2022-07-19 14:44:28,877 INFO L226 Difference]: Without dead ends: 42 [2022-07-19 14:44:28,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:44:28,877 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 18 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:44:28,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 81 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:44:28,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-19 14:44:28,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-07-19 14:44:28,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:44:28,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2022-07-19 14:44:28,886 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 43 [2022-07-19 14:44:28,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:44:28,886 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2022-07-19 14:44:28,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-19 14:44:28,886 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2022-07-19 14:44:28,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-19 14:44:28,887 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:44:28,887 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] [2022-07-19 14:44:28,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-19 14:44:29,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:44:29,100 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:44:29,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:44:29,101 INFO L85 PathProgramCache]: Analyzing trace with hash -364798159, now seen corresponding path program 1 times [2022-07-19 14:44:29,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:44:29,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [47486416] [2022-07-19 14:44:29,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:44:29,101 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:44:29,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:44:29,102 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:44:29,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-19 14:44:29,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:29,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 70 conjunts are in the unsatisfiable core [2022-07-19 14:44:29,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:44:29,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:44:29,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:44:29,497 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-19 14:44:29,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 [2022-07-19 14:44:29,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-07-19 14:44:29,641 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-19 14:44:29,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 41 [2022-07-19 14:44:29,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:44:29,798 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:44:29,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 48 treesize of output 45 [2022-07-19 14:44:29,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 10 treesize of output 9 [2022-07-19 14:44:29,943 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-19 14:44:29,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 73 treesize of output 28 [2022-07-19 14:44:29,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 14 [2022-07-19 14:44:30,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:30,121 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-19 14:44:30,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 79 treesize of output 69 [2022-07-19 14:44:30,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:30,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 62 treesize of output 60 [2022-07-19 14:44:30,158 INFO L356 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2022-07-19 14:44:30,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 45 [2022-07-19 14:44:30,714 INFO L356 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-07-19 14:44:30,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 169 treesize of output 91 [2022-07-19 14:44:30,774 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-19 14:44:30,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 268 treesize of output 181 [2022-07-19 14:44:30,813 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-19 14:44:30,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 new quantified variables, introduced 2 case distinctions, treesize of input 226 treesize of output 148 [2022-07-19 14:44:30,849 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-07-19 14:44:30,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 182 treesize of output 152 [2022-07-19 14:44:31,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 105 [2022-07-19 14:44:31,494 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-07-19 14:44:31,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 36 [2022-07-19 14:44:31,615 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 14:44:31,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:44:31,993 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1555 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1554 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32))) (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1554))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1555))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))) .cse1))))) is different from false [2022-07-19 14:44:32,044 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1555 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1554 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32))) (not (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) .cse5 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1554))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 (store (select |c_#memory_$Pointer$.offset| .cse4) .cse5 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1555))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse1 (select (select .cse1 .cse0) .cse2)) (select (select .cse3 .cse0) .cse2)))))))))) is different from false [2022-07-19 14:44:32,084 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1555 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1554 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32))) (not (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse6) .cse7)) (.cse5 (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) .cse5 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1554))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 (store (select |c_#memory_$Pointer$.offset| .cse4) .cse5 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1555))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse1 (select (select .cse1 .cse0) .cse2)) (select (select .cse3 .cse0) .cse2))))))))))) is different from false [2022-07-19 14:44:32,112 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1555 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1554 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32))) (not (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse6) .cse7)) (.cse5 (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) .cse5 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1554))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 (store (select |c_#memory_$Pointer$.offset| .cse4) .cse5 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1555))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))) .cse1))))))) is different from false [2022-07-19 14:44:32,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:44:32,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [47486416] [2022-07-19 14:44:32,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [47486416] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:44:32,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1106482465] [2022-07-19 14:44:32,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:44:32,945 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-19 14:44:32,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-19 14:44:32,947 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-19 14:44:32,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-07-19 14:44:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:44:33,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 86 conjunts are in the unsatisfiable core [2022-07-19 14:44:33,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:44:33,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:44:33,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 6 [2022-07-19 14:44:34,299 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-19 14:44:34,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 20 treesize of output 27 [2022-07-19 14:44:34,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:44:34,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:44:34,788 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:44:34,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 48 treesize of output 45 [2022-07-19 14:44:34,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:44:35,255 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 14:44:35,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 98 treesize of output 45 [2022-07-19 14:44:35,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 13 [2022-07-19 14:44:35,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:35,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2022-07-19 14:44:37,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:37,985 INFO L356 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-07-19 14:44:37,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 112 treesize of output 77 [2022-07-19 14:44:38,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:38,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:38,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:38,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 81 [2022-07-19 14:44:38,049 INFO L356 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-07-19 14:44:38,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 38 treesize of output 40 [2022-07-19 14:44:40,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:40,502 INFO L356 Elim1Store]: treesize reduction 136, result has 18.1 percent of original size [2022-07-19 14:44:40,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 new quantified variables, introduced 8 case distinctions, treesize of input 187 treesize of output 104 [2022-07-19 14:44:40,567 INFO L356 Elim1Store]: treesize reduction 90, result has 15.1 percent of original size [2022-07-19 14:44:40,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 295 treesize of output 182 [2022-07-19 14:44:40,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:40,639 INFO L356 Elim1Store]: treesize reduction 102, result has 16.4 percent of original size [2022-07-19 14:44:40,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 218 treesize of output 181 [2022-07-19 14:44:41,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:41,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 94 [2022-07-19 14:44:42,135 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-07-19 14:44:42,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 38 [2022-07-19 14:44:42,486 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:44:42,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:44:42,518 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1654 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1655 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1652 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1654))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1652) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1655))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))) .cse1))))) is different from false [2022-07-19 14:44:48,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1106482465] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:44:48,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:44:48,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 29] total 51 [2022-07-19 14:44:48,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130339030] [2022-07-19 14:44:48,290 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:44:48,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-19 14:44:48,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:44:48,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-19 14:44:48,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=3661, Unknown=24, NotChecked=630, Total=4556 [2022-07-19 14:44:48,292 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 51 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 40 states have internal predecessors, (69), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-19 14:44:54,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:44:54,216 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2022-07-19 14:44:54,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-19 14:44:54,217 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 40 states have internal predecessors, (69), 6 states have call successors, (6), 5 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 44 [2022-07-19 14:44:54,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:44:54,218 INFO L225 Difference]: With dead ends: 48 [2022-07-19 14:44:54,218 INFO L226 Difference]: Without dead ends: 45 [2022-07-19 14:44:54,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1397 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=326, Invalid=4926, Unknown=24, NotChecked=730, Total=6006 [2022-07-19 14:44:54,219 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 182 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 14:44:54,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 243 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 137 Invalid, 0 Unknown, 182 Unchecked, 0.2s Time] [2022-07-19 14:44:54,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-19 14:44:54,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2022-07-19 14:44:54,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:44:54,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-07-19 14:44:54,225 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 44 [2022-07-19 14:44:54,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:44:54,225 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-07-19 14:44:54,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 40 states have internal predecessors, (69), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-19 14:44:54,226 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-07-19 14:44:54,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-19 14:44:54,226 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:44:54,226 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-07-19 14:44:54,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2022-07-19 14:44:54,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-19 14:44:54,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:44:54,634 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:44:54,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:44:54,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1576200124, now seen corresponding path program 2 times [2022-07-19 14:44:54,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:44:54,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1282802] [2022-07-19 14:44:54,635 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 14:44:54,635 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:44:54,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:44:54,636 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:44:54,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-19 14:44:54,981 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 14:44:54,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:44:54,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 105 conjunts are in the unsatisfiable core [2022-07-19 14:44:54,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:44:55,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:44:55,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:44:55,098 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-19 14:44:55,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 [2022-07-19 14:44:55,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-07-19 14:44:55,253 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-19 14:44:55,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 41 [2022-07-19 14:44:55,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:44:55,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:44:55,462 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:44:55,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 48 treesize of output 45 [2022-07-19 14:44:55,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-19 14:44:55,657 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-19 14:44:55,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 88 treesize of output 39 [2022-07-19 14:44:55,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2022-07-19 14:44:55,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 14 [2022-07-19 14:44:55,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 14:44:55,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:55,895 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-19 14:44:55,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 94 treesize of output 82 [2022-07-19 14:44:55,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:55,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:55,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 81 [2022-07-19 14:44:55,938 INFO L356 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2022-07-19 14:44:55,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 45 [2022-07-19 14:44:56,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:44:57,203 INFO L356 Elim1Store]: treesize reduction 228, result has 18.3 percent of original size [2022-07-19 14:44:57,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:44:57,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1282802] [2022-07-19 14:44:57,204 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-19 14:44:57,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-19 14:44:57,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:44:57,405 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_208| input size 96 context size 96 output size 96 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-19 14:44:57,410 INFO L158 Benchmark]: Toolchain (without parser) took 119172.06ms. Allocated memory was 56.6MB in the beginning and 125.8MB in the end (delta: 69.2MB). Free memory was 34.3MB in the beginning and 86.6MB in the end (delta: -52.3MB). Peak memory consumption was 77.3MB. Max. memory is 16.1GB. [2022-07-19 14:44:57,410 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 56.6MB. Free memory was 38.7MB in the beginning and 38.7MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:44:57,410 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.62ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 34.1MB in the beginning and 45.0MB in the end (delta: -10.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-19 14:44:57,410 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.63ms. Allocated memory is still 69.2MB. Free memory was 45.0MB in the beginning and 42.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:44:57,411 INFO L158 Benchmark]: Boogie Preprocessor took 69.78ms. Allocated memory is still 69.2MB. Free memory was 42.8MB in the beginning and 40.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:44:57,411 INFO L158 Benchmark]: RCFGBuilder took 520.31ms. Allocated memory is still 69.2MB. Free memory was 40.7MB in the beginning and 40.5MB in the end (delta: 233.3kB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2022-07-19 14:44:57,411 INFO L158 Benchmark]: TraceAbstraction took 118125.23ms. Allocated memory was 69.2MB in the beginning and 125.8MB in the end (delta: 56.6MB). Free memory was 39.8MB in the beginning and 86.6MB in the end (delta: -46.8MB). Peak memory consumption was 69.6MB. Max. memory is 16.1GB. [2022-07-19 14:44:57,412 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 56.6MB. Free memory was 38.7MB in the beginning and 38.7MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 393.62ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 34.1MB in the beginning and 45.0MB in the end (delta: -10.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.63ms. Allocated memory is still 69.2MB. Free memory was 45.0MB in the beginning and 42.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.78ms. Allocated memory is still 69.2MB. Free memory was 42.8MB in the beginning and 40.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 520.31ms. Allocated memory is still 69.2MB. Free memory was 40.7MB in the beginning and 40.5MB in the end (delta: 233.3kB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. * TraceAbstraction took 118125.23ms. Allocated memory was 69.2MB in the beginning and 125.8MB in the end (delta: 56.6MB). Free memory was 39.8MB in the beginning and 86.6MB in the end (delta: -46.8MB). Peak memory consumption was 69.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_208| input size 96 context size 96 output size 96 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_208| input size 96 context size 96 output size 96: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-19 14:44:57,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_208| input size 96 context size 96 output size 96