./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 02:18:33,301 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 02:18:33,303 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 02:18:33,337 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 02:18:33,337 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 02:18:33,338 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 02:18:33,341 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 02:18:33,344 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 02:18:33,345 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 02:18:33,349 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 02:18:33,350 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 02:18:33,352 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 02:18:33,352 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 02:18:33,353 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 02:18:33,354 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 02:18:33,358 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 02:18:33,359 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 02:18:33,360 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 02:18:33,361 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 02:18:33,366 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 02:18:33,367 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 02:18:33,368 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 02:18:33,369 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 02:18:33,370 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 02:18:33,371 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 02:18:33,376 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 02:18:33,376 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 02:18:33,377 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 02:18:33,377 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 02:18:33,378 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 02:18:33,378 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 02:18:33,379 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 02:18:33,380 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 02:18:33,381 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 02:18:33,382 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 02:18:33,382 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 02:18:33,383 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 02:18:33,383 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 02:18:33,383 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 02:18:33,383 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 02:18:33,384 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 02:18:33,385 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 02:18:33,389 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 02:18:33,414 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 02:18:33,415 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 02:18:33,415 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 02:18:33,415 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 02:18:33,416 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 02:18:33,416 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 02:18:33,417 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 02:18:33,417 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 02:18:33,417 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 02:18:33,418 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 02:18:33,418 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 02:18:33,418 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 02:18:33,418 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 02:18:33,425 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 02:18:33,425 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 02:18:33,426 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 02:18:33,426 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 02:18:33,426 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 02:18:33,426 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 02:18:33,426 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 02:18:33,427 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 02:18:33,427 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 02:18:33,427 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 02:18:33,427 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 02:18:33,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 02:18:33,427 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 02:18:33,428 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 02:18:33,428 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 02:18:33,428 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 02:18:33,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 02:18:33,428 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 02:18:33,428 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 02:18:33,429 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 02:18:33,429 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 -> f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 [2022-07-21 02:18:33,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 02:18:33,727 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 02:18:33,728 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 02:18:33,729 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 02:18:33,730 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 02:18:33,731 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2022-07-21 02:18:33,772 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73dcef32a/c4fdde43ba594094ae81338135c812b2/FLAGb9580f6cf [2022-07-21 02:18:34,137 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 02:18:34,138 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2022-07-21 02:18:34,150 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73dcef32a/c4fdde43ba594094ae81338135c812b2/FLAGb9580f6cf [2022-07-21 02:18:34,492 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73dcef32a/c4fdde43ba594094ae81338135c812b2 [2022-07-21 02:18:34,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 02:18:34,496 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 02:18:34,498 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 02:18:34,498 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 02:18:34,501 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 02:18:34,502 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:18:34" (1/1) ... [2022-07-21 02:18:34,502 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f648d0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:18:34, skipping insertion in model container [2022-07-21 02:18:34,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:18:34" (1/1) ... [2022-07-21 02:18:34,507 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 02:18:34,538 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 02:18:34,752 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_prepend_equal.i[24458,24471] [2022-07-21 02:18:34,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:18:34,765 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 02:18:34,808 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_prepend_equal.i[24458,24471] [2022-07-21 02:18:34,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:18:34,833 INFO L208 MainTranslator]: Completed translation [2022-07-21 02:18:34,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:18:34 WrapperNode [2022-07-21 02:18:34,833 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 02:18:34,834 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 02:18:34,835 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 02:18:34,835 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 02:18:34,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:18:34" (1/1) ... [2022-07-21 02:18:34,866 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:18:34" (1/1) ... [2022-07-21 02:18:34,890 INFO L137 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 137 [2022-07-21 02:18:34,890 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 02:18:34,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 02:18:34,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 02:18:34,892 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 02:18:34,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:18:34" (1/1) ... [2022-07-21 02:18:34,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:18:34" (1/1) ... [2022-07-21 02:18:34,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:18:34" (1/1) ... [2022-07-21 02:18:34,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:18:34" (1/1) ... [2022-07-21 02:18:34,921 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:18:34" (1/1) ... [2022-07-21 02:18:34,926 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:18:34" (1/1) ... [2022-07-21 02:18:34,929 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:18:34" (1/1) ... [2022-07-21 02:18:34,933 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 02:18:34,938 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 02:18:34,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 02:18:34,940 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 02:18:34,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:18:34" (1/1) ... [2022-07-21 02:18:34,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 02:18:34,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:18:34,993 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-21 02:18:35,024 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-21 02:18:35,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 02:18:35,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 02:18:35,064 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-21 02:18:35,064 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-21 02:18:35,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 02:18:35,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 02:18:35,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 02:18:35,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 02:18:35,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 02:18:35,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 02:18:35,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 02:18:35,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 02:18:35,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 02:18:35,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 02:18:35,135 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 02:18:35,136 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 02:18:35,382 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 02:18:35,386 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 02:18:35,386 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-21 02:18:35,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:18:35 BoogieIcfgContainer [2022-07-21 02:18:35,388 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 02:18:35,389 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 02:18:35,389 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 02:18:35,391 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 02:18:35,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 02:18:34" (1/3) ... [2022-07-21 02:18:35,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67d70db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:18:35, skipping insertion in model container [2022-07-21 02:18:35,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:18:34" (2/3) ... [2022-07-21 02:18:35,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67d70db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:18:35, skipping insertion in model container [2022-07-21 02:18:35,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:18:35" (3/3) ... [2022-07-21 02:18:35,394 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_equal.i [2022-07-21 02:18:35,404 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 02:18:35,405 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 02:18:35,445 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 02:18:35,450 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@14f34dc5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7da4d78c [2022-07-21 02:18:35,451 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 02:18:35,454 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-21 02:18:35,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 02:18:35,460 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:18:35,461 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-21 02:18:35,461 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:18:35,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:18:35,465 INFO L85 PathProgramCache]: Analyzing trace with hash -483023916, now seen corresponding path program 1 times [2022-07-21 02:18:35,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:18:35,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467022752] [2022-07-21 02:18:35,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:18:35,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:18:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:35,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:18:35,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:35,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 02:18:35,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:35,685 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-21 02:18:35,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:18:35,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467022752] [2022-07-21 02:18:35,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467022752] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:18:35,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:18:35,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 02:18:35,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063696438] [2022-07-21 02:18:35,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:18:35,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 02:18:35,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:18:35,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 02:18:35,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 02:18:35,732 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-21 02:18:35,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:18:35,810 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2022-07-21 02:18:35,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 02:18:35,813 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-21 02:18:35,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:18:35,818 INFO L225 Difference]: With dead ends: 65 [2022-07-21 02:18:35,818 INFO L226 Difference]: Without dead ends: 28 [2022-07-21 02:18:35,820 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-21 02:18:35,823 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-21 02:18:35,824 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-21 02:18:35,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-21 02:18:35,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-07-21 02:18:35,856 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-21 02:18:35,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-07-21 02:18:35,859 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2022-07-21 02:18:35,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:18:35,861 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-07-21 02:18:35,862 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-21 02:18:35,862 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-07-21 02:18:35,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 02:18:35,863 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:18:35,864 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-21 02:18:35,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 02:18:35,864 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:18:35,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:18:35,866 INFO L85 PathProgramCache]: Analyzing trace with hash -938400178, now seen corresponding path program 1 times [2022-07-21 02:18:35,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:18:35,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284570813] [2022-07-21 02:18:35,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:18:35,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:18:35,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:35,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:18:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:35,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 02:18:35,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:36,007 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-21 02:18:36,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:18:36,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284570813] [2022-07-21 02:18:36,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284570813] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:18:36,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:18:36,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 02:18:36,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296580524] [2022-07-21 02:18:36,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:18:36,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 02:18:36,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:18:36,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 02:18:36,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 02:18:36,012 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-21 02:18:36,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:18:36,068 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2022-07-21 02:18:36,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 02:18:36,069 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-21 02:18:36,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:18:36,072 INFO L225 Difference]: With dead ends: 52 [2022-07-21 02:18:36,072 INFO L226 Difference]: Without dead ends: 31 [2022-07-21 02:18:36,075 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-21 02:18:36,077 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-21 02:18:36,078 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-21 02:18:36,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-21 02:18:36,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-07-21 02:18:36,087 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-21 02:18:36,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-07-21 02:18:36,093 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 24 [2022-07-21 02:18:36,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:18:36,094 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-07-21 02:18:36,094 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-21 02:18:36,095 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-07-21 02:18:36,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-21 02:18:36,096 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:18:36,096 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-21 02:18:36,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 02:18:36,096 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:18:36,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:18:36,097 INFO L85 PathProgramCache]: Analyzing trace with hash 436872902, now seen corresponding path program 1 times [2022-07-21 02:18:36,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:18:36,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81298678] [2022-07-21 02:18:36,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:18:36,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:18:36,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:36,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:18:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:36,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 02:18:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:36,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 02:18:36,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:36,458 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-21 02:18:36,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:18:36,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81298678] [2022-07-21 02:18:36,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81298678] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:18:36,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244104060] [2022-07-21 02:18:36,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:18:36,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:18:36,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:18:36,489 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-21 02:18:36,552 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-21 02:18:36,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:36,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-21 02:18:36,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:18:36,869 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-21 02:18:36,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:36,937 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-21 02:18:36,967 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-21 02:18:36,985 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-21 02:18:36,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:18:37,058 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_8| Int) (v_ArrVal_316 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_8| v_ArrVal_316) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (<= (+ .cse0 1) 0) (not (< |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_8| |c_#StackHeapBarrier|)) (<= 1 .cse0)))) is different from false [2022-07-21 02:18:37,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244104060] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:18:37,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:18:37,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2022-07-21 02:18:37,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965868225] [2022-07-21 02:18:37,060 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:18:37,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-21 02:18:37,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:18:37,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-21 02:18:37,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=482, Unknown=1, NotChecked=44, Total=600 [2022-07-21 02:18:37,064 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-21 02:18:37,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:18:37,301 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-07-21 02:18:37,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 02:18:37,303 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-21 02:18:37,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:18:37,304 INFO L225 Difference]: With dead ends: 38 [2022-07-21 02:18:37,305 INFO L226 Difference]: Without dead ends: 30 [2022-07-21 02:18:37,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=756, Unknown=1, NotChecked=56, Total=930 [2022-07-21 02:18:37,306 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-21 02:18:37,306 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-21 02:18:37,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-21 02:18:37,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-07-21 02:18:37,310 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-21 02:18:37,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-07-21 02:18:37,313 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 32 [2022-07-21 02:18:37,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:18:37,314 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-07-21 02:18:37,314 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-21 02:18:37,314 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-07-21 02:18:37,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-21 02:18:37,316 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:18:37,316 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-21 02:18:37,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-21 02:18:37,527 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-21 02:18:37,528 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:18:37,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:18:37,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1205420011, now seen corresponding path program 1 times [2022-07-21 02:18:37,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:18:37,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264363939] [2022-07-21 02:18:37,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:18:37,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:18:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:37,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:18:37,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:37,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 02:18:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:37,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 02:18:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:37,973 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-21 02:18:37,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:18:37,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264363939] [2022-07-21 02:18:37,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264363939] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:18:37,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102503959] [2022-07-21 02:18:37,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:18:37,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:18:37,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:18:37,977 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-21 02:18:37,979 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-21 02:18:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:38,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 89 conjunts are in the unsatisfiable core [2022-07-21 02:18:38,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:18:38,115 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-21 02:18:38,260 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 02:18:38,261 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-21 02:18:38,310 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-21 02:18:38,363 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:18:38,363 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 28 treesize of output 29 [2022-07-21 02:18:38,449 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 02:18:38,449 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 47 treesize of output 22 [2022-07-21 02:18:38,456 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-21 02:18:38,461 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-21 02:18:38,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:38,580 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 02:18:38,580 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 53 treesize of output 51 [2022-07-21 02:18:38,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:38,587 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 51 treesize of output 49 [2022-07-21 02:18:38,599 INFO L356 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-07-21 02:18:38,600 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 32 treesize of output 34 [2022-07-21 02:18:38,667 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 35 treesize of output 23 [2022-07-21 02:18:38,700 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 02:18:38,700 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 35 treesize of output 18 [2022-07-21 02:18:38,719 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-21 02:18:38,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:18:38,811 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_11| Int) (v_ArrVal_533 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (or (not (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_11| v_ArrVal_532))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_11| v_ArrVal_533) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_11|) 0)) (not (< |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_11| |c_#StackHeapBarrier|)))) is different from false [2022-07-21 02:18:38,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102503959] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:18:38,812 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:18:38,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 35 [2022-07-21 02:18:38,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457051215] [2022-07-21 02:18:38,813 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:18:38,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-21 02:18:38,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:18:38,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-21 02:18:38,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1213, Unknown=1, NotChecked=70, Total=1406 [2022-07-21 02:18:38,814 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 35 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 27 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 02:18:39,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:18:39,376 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2022-07-21 02:18:39,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-21 02:18:39,377 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 27 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 35 [2022-07-21 02:18:39,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:18:39,377 INFO L225 Difference]: With dead ends: 65 [2022-07-21 02:18:39,377 INFO L226 Difference]: Without dead ends: 56 [2022-07-21 02:18:39,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=232, Invalid=2123, Unknown=1, NotChecked=94, Total=2450 [2022-07-21 02:18:39,379 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 36 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 02:18:39,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 305 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 391 Invalid, 0 Unknown, 46 Unchecked, 0.2s Time] [2022-07-21 02:18:39,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-21 02:18:39,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2022-07-21 02:18:39,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 02:18:39,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2022-07-21 02:18:39,389 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 35 [2022-07-21 02:18:39,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:18:39,389 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2022-07-21 02:18:39,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 27 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 02:18:39,390 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2022-07-21 02:18:39,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-21 02:18:39,407 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:18:39,407 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-21 02:18:39,432 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-21 02:18:39,615 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-21 02:18:39,616 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:18:39,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:18:39,616 INFO L85 PathProgramCache]: Analyzing trace with hash 790772624, now seen corresponding path program 1 times [2022-07-21 02:18:39,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:18:39,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107803258] [2022-07-21 02:18:39,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:18:39,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:18:39,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:40,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:18:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:40,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 02:18:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:40,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 02:18:40,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:40,481 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-21 02:18:40,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:18:40,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107803258] [2022-07-21 02:18:40,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107803258] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:18:40,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045137316] [2022-07-21 02:18:40,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:18:40,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:18:40,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:18:40,483 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-21 02:18:40,484 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-21 02:18:40,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:40,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 123 conjunts are in the unsatisfiable core [2022-07-21 02:18:40,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:18:40,614 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-21 02:18:40,651 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-21 02:18:40,750 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 02:18:40,751 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-21 02:18:40,878 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-21 02:18:40,920 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-21 02:18:40,921 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-21 02:18:40,986 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-21 02:18:41,092 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:18:41,092 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-21 02:18:41,237 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-21 02:18:41,237 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-21 02:18:41,251 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-21 02:18:41,349 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-21 02:18:41,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:41,434 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 02:18:41,434 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-21 02:18:41,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:41,440 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-21 02:18:41,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:41,455 INFO L356 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-07-21 02:18:41,455 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-21 02:18:41,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:41,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, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 41 [2022-07-21 02:18:41,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:41,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:41,910 INFO L356 Elim1Store]: treesize reduction 28, result has 33.3 percent of original size [2022-07-21 02:18:41,910 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 3 case distinctions, treesize of input 135 treesize of output 127 [2022-07-21 02:18:41,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:41,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:41,935 INFO L356 Elim1Store]: treesize reduction 88, result has 17.8 percent of original size [2022-07-21 02:18:41,935 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 5 case distinctions, treesize of input 109 treesize of output 87 [2022-07-21 02:18:41,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 61 [2022-07-21 02:18:41,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 49 [2022-07-21 02:18:41,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:41,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 35 [2022-07-21 02:18:42,072 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 38 [2022-07-21 02:18:42,076 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 21 treesize of output 13 [2022-07-21 02:18:42,126 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 19 treesize of output 7 [2022-07-21 02:18:42,167 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-21 02:18:42,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:18:42,257 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_749 Int) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_753 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_749)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_752) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_751) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_754) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_757) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_753) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_756) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_759) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_755) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2022-07-21 02:18:42,303 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_749 Int) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_753 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_749)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_752) .cse0 v_ArrVal_751) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_754) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_757) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) .cse0 v_ArrVal_753) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_756) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_759) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) .cse0 v_ArrVal_755) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2022-07-21 02:18:42,320 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_749 Int) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_753 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (= |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_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_749)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_752) .cse0 v_ArrVal_751) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_754) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_757) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) .cse0 v_ArrVal_753) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_756) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_759) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) .cse0 v_ArrVal_755) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2022-07-21 02:18:42,330 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_754 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_749 Int) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_753 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (= |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_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_749)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_752) .cse0 v_ArrVal_751) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_754) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_757) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) .cse0 v_ArrVal_753) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_756) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_759) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)) .cse0 v_ArrVal_755) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2022-07-21 02:18:42,415 INFO L356 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2022-07-21 02:18:42,416 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 133 treesize of output 139 [2022-07-21 02:18:42,428 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:18:42,429 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 616 treesize of output 619 [2022-07-21 02:18:42,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 516 treesize of output 424 [2022-07-21 02:18:42,448 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 234 treesize of output 188 [2022-07-21 02:18:42,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045137316] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:18:42,907 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:18:42,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22] total 45 [2022-07-21 02:18:42,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891972691] [2022-07-21 02:18:42,907 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:18:42,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-21 02:18:42,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:18:42,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-21 02:18:42,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=2139, Unknown=4, NotChecked=380, Total=2652 [2022-07-21 02:18:42,909 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 45 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 36 states have internal predecessors, (56), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 02:18:44,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:18:44,383 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2022-07-21 02:18:44,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-21 02:18:44,385 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 36 states have internal predecessors, (56), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 37 [2022-07-21 02:18:44,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:18:44,387 INFO L225 Difference]: With dead ends: 60 [2022-07-21 02:18:44,387 INFO L226 Difference]: Without dead ends: 58 [2022-07-21 02:18:44,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=245, Invalid=3673, Unknown=4, NotChecked=500, Total=4422 [2022-07-21 02:18:44,393 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 31 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 02:18:44,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 431 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 823 Invalid, 0 Unknown, 63 Unchecked, 0.5s Time] [2022-07-21 02:18:44,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-21 02:18:44,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2022-07-21 02:18:44,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 46 states have internal predecessors, (53), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-21 02:18:44,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2022-07-21 02:18:44,420 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 37 [2022-07-21 02:18:44,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:18:44,421 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2022-07-21 02:18:44,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 36 states have internal predecessors, (56), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 02:18:44,422 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2022-07-21 02:18:44,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-21 02:18:44,424 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:18:44,425 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-21 02:18:44,442 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-21 02:18:44,638 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-21 02:18:44,639 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:18:44,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:18:44,639 INFO L85 PathProgramCache]: Analyzing trace with hash -718486453, now seen corresponding path program 2 times [2022-07-21 02:18:44,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:18:44,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133092031] [2022-07-21 02:18:44,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:18:44,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:18:44,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:44,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:18:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:44,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 02:18:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:45,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 02:18:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:45,197 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-21 02:18:45,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:18:45,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133092031] [2022-07-21 02:18:45,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133092031] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:18:45,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342461674] [2022-07-21 02:18:45,198 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 02:18:45,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:18:45,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:18:45,199 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-21 02:18:45,200 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-21 02:18:45,339 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 02:18:45,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 02:18:45,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 185 conjunts are in the unsatisfiable core [2022-07-21 02:18:45,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:18:45,377 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-21 02:18:45,609 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-21 02:18:45,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-21 02:18:45,809 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-21 02:18:45,810 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 157907 column 46: unknown constant v_old(#valid)_AFTER_CALL_11 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.checkOrAddAxiom(DiffWrapperScript.java:161) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.convertApplicationTerm(DiffWrapperScript.java:171) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:352) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:109) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.assertTerm(ManagedScript.java:134) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:824) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:768) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) 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-21 02:18:45,813 INFO L158 Benchmark]: Toolchain (without parser) took 11317.68ms. Allocated memory was 67.1MB in the beginning and 161.5MB in the end (delta: 94.4MB). Free memory was 48.2MB in the beginning and 77.6MB in the end (delta: -29.4MB). Peak memory consumption was 64.3MB. Max. memory is 16.1GB. [2022-07-21 02:18:45,814 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 67.1MB. Free memory was 49.1MB in the beginning and 49.1MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 02:18:45,814 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.77ms. Allocated memory is still 67.1MB. Free memory was 48.0MB in the beginning and 44.1MB in the end (delta: 3.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-21 02:18:45,814 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.20ms. Allocated memory is still 67.1MB. Free memory was 43.9MB in the beginning and 41.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 02:18:45,814 INFO L158 Benchmark]: Boogie Preprocessor took 46.57ms. Allocated memory is still 67.1MB. Free memory was 41.8MB in the beginning and 40.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 02:18:45,814 INFO L158 Benchmark]: RCFGBuilder took 449.36ms. Allocated memory was 67.1MB in the beginning and 92.3MB in the end (delta: 25.2MB). Free memory was 39.9MB in the beginning and 67.1MB in the end (delta: -27.2MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2022-07-21 02:18:45,814 INFO L158 Benchmark]: TraceAbstraction took 10422.71ms. Allocated memory was 92.3MB in the beginning and 161.5MB in the end (delta: 69.2MB). Free memory was 66.7MB in the beginning and 77.6MB in the end (delta: -10.9MB). Peak memory consumption was 58.8MB. Max. memory is 16.1GB. [2022-07-21 02:18:45,816 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.17ms. Allocated memory is still 67.1MB. Free memory was 49.1MB in the beginning and 49.1MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.77ms. Allocated memory is still 67.1MB. Free memory was 48.0MB in the beginning and 44.1MB in the end (delta: 3.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.20ms. Allocated memory is still 67.1MB. Free memory was 43.9MB in the beginning and 41.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.57ms. Allocated memory is still 67.1MB. Free memory was 41.8MB in the beginning and 40.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 449.36ms. Allocated memory was 67.1MB in the beginning and 92.3MB in the end (delta: 25.2MB). Free memory was 39.9MB in the beginning and 67.1MB in the end (delta: -27.2MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * TraceAbstraction took 10422.71ms. Allocated memory was 92.3MB in the beginning and 161.5MB in the end (delta: 69.2MB). Free memory was 66.7MB in the beginning and 77.6MB in the end (delta: -10.9MB). Peak memory consumption was 58.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 157907 column 46: unknown constant v_old(#valid)_AFTER_CALL_11 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 157907 column 46: unknown constant v_old(#valid)_AFTER_CALL_11: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-21 02:18:45,832 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 1 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_prepend_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 f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 02:18:47,771 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 02:18:47,773 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 02:18:47,806 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 02:18:47,806 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 02:18:47,808 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 02:18:47,811 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 02:18:47,813 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 02:18:47,815 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 02:18:47,818 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 02:18:47,819 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 02:18:47,823 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 02:18:47,823 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 02:18:47,825 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 02:18:47,826 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 02:18:47,828 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 02:18:47,829 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 02:18:47,830 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 02:18:47,832 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 02:18:47,836 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 02:18:47,837 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 02:18:47,839 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 02:18:47,840 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 02:18:47,841 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 02:18:47,842 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 02:18:47,847 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 02:18:47,848 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 02:18:47,848 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 02:18:47,849 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 02:18:47,849 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 02:18:47,850 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 02:18:47,850 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 02:18:47,852 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 02:18:47,852 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 02:18:47,853 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 02:18:47,854 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 02:18:47,854 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 02:18:47,855 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 02:18:47,855 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 02:18:47,855 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 02:18:47,855 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 02:18:47,857 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 02:18:47,872 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-21 02:18:47,890 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 02:18:47,891 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 02:18:47,891 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 02:18:47,891 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 02:18:47,892 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 02:18:47,892 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 02:18:47,892 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 02:18:47,893 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 02:18:47,893 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 02:18:47,893 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 02:18:47,894 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 02:18:47,894 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 02:18:47,894 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 02:18:47,894 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 02:18:47,894 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 02:18:47,894 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 02:18:47,895 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 02:18:47,895 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-21 02:18:47,895 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-21 02:18:47,895 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 02:18:47,895 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 02:18:47,896 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 02:18:47,896 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 02:18:47,896 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 02:18:47,896 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 02:18:47,896 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 02:18:47,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 02:18:47,897 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 02:18:47,897 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 02:18:47,897 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 02:18:47,897 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-21 02:18:47,897 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-21 02:18:47,897 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 02:18:47,898 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 02:18:47,898 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 02:18:47,898 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-21 02:18:47,898 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 -> f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 [2022-07-21 02:18:48,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 02:18:48,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 02:18:48,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 02:18:48,174 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 02:18:48,175 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 02:18:48,176 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2022-07-21 02:18:48,219 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e71be903f/15b461898bb64f01b222e1ebf5474d35/FLAGf5491dd74 [2022-07-21 02:18:48,667 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 02:18:48,668 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2022-07-21 02:18:48,679 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e71be903f/15b461898bb64f01b222e1ebf5474d35/FLAGf5491dd74 [2022-07-21 02:18:49,005 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e71be903f/15b461898bb64f01b222e1ebf5474d35 [2022-07-21 02:18:49,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 02:18:49,008 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 02:18:49,010 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 02:18:49,011 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 02:18:49,015 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 02:18:49,016 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:18:49" (1/1) ... [2022-07-21 02:18:49,017 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d7d26ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:18:49, skipping insertion in model container [2022-07-21 02:18:49,018 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:18:49" (1/1) ... [2022-07-21 02:18:49,022 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 02:18:49,057 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 02:18:49,362 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_prepend_equal.i[24458,24471] [2022-07-21 02:18:49,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:18:49,379 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 02:18:49,429 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_prepend_equal.i[24458,24471] [2022-07-21 02:18:49,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:18:49,460 INFO L208 MainTranslator]: Completed translation [2022-07-21 02:18:49,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:18:49 WrapperNode [2022-07-21 02:18:49,461 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 02:18:49,462 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 02:18:49,462 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 02:18:49,462 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 02:18:49,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:18:49" (1/1) ... [2022-07-21 02:18:49,480 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:18:49" (1/1) ... [2022-07-21 02:18:49,519 INFO L137 Inliner]: procedures = 130, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 138 [2022-07-21 02:18:49,519 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 02:18:49,521 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 02:18:49,521 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 02:18:49,521 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 02:18:49,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:18:49" (1/1) ... [2022-07-21 02:18:49,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:18:49" (1/1) ... [2022-07-21 02:18:49,542 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:18:49" (1/1) ... [2022-07-21 02:18:49,544 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:18:49" (1/1) ... [2022-07-21 02:18:49,551 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:18:49" (1/1) ... [2022-07-21 02:18:49,565 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:18:49" (1/1) ... [2022-07-21 02:18:49,567 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:18:49" (1/1) ... [2022-07-21 02:18:49,571 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 02:18:49,572 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 02:18:49,572 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 02:18:49,572 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 02:18:49,573 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:18:49" (1/1) ... [2022-07-21 02:18:49,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 02:18:49,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:18:49,609 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-21 02:18:49,612 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-21 02:18:49,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-21 02:18:49,639 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-21 02:18:49,639 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-21 02:18:49,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 02:18:49,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 02:18:49,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 02:18:49,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 02:18:49,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 02:18:49,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 02:18:49,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-21 02:18:49,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 02:18:49,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-21 02:18:49,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 02:18:49,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 02:18:49,787 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 02:18:49,788 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 02:18:50,024 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 02:18:50,028 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 02:18:50,029 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-21 02:18:50,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:18:50 BoogieIcfgContainer [2022-07-21 02:18:50,031 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 02:18:50,032 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 02:18:50,032 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 02:18:50,034 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 02:18:50,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 02:18:49" (1/3) ... [2022-07-21 02:18:50,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bb75a63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:18:50, skipping insertion in model container [2022-07-21 02:18:50,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:18:49" (2/3) ... [2022-07-21 02:18:50,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bb75a63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:18:50, skipping insertion in model container [2022-07-21 02:18:50,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:18:50" (3/3) ... [2022-07-21 02:18:50,036 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_equal.i [2022-07-21 02:18:50,048 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 02:18:50,052 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 02:18:50,083 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 02:18:50,111 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@5a35e2ae, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@56d4aff1 [2022-07-21 02:18:50,111 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 02:18:50,114 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-21 02:18:50,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 02:18:50,119 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:18:50,119 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-21 02:18:50,120 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:18:50,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:18:50,124 INFO L85 PathProgramCache]: Analyzing trace with hash -483023916, now seen corresponding path program 1 times [2022-07-21 02:18:50,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:18:50,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1792486506] [2022-07-21 02:18:50,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:18:50,135 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:18:50,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:18:50,137 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-21 02:18:50,165 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-21 02:18:50,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:50,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-21 02:18:50,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:18:50,391 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-21 02:18:50,405 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:18:50,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:18:50,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1792486506] [2022-07-21 02:18:50,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1792486506] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:18:50,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:18:50,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 02:18:50,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364418746] [2022-07-21 02:18:50,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:18:50,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 02:18:50,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:18:50,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 02:18:50,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 02:18:50,441 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-21 02:18:50,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:18:50,454 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2022-07-21 02:18:50,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 02:18:50,455 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-21 02:18:50,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:18:50,459 INFO L225 Difference]: With dead ends: 65 [2022-07-21 02:18:50,459 INFO L226 Difference]: Without dead ends: 28 [2022-07-21 02:18:50,461 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-21 02:18:50,463 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-21 02:18:50,464 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-21 02:18:50,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-21 02:18:50,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-07-21 02:18:50,487 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-21 02:18:50,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-07-21 02:18:50,488 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2022-07-21 02:18:50,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:18:50,489 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-07-21 02:18:50,490 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-21 02:18:50,490 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-07-21 02:18:50,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 02:18:50,491 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:18:50,491 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-21 02:18:50,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-21 02:18:50,699 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-21 02:18:50,700 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:18:50,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:18:50,701 INFO L85 PathProgramCache]: Analyzing trace with hash -938400178, now seen corresponding path program 1 times [2022-07-21 02:18:50,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:18:50,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2028861633] [2022-07-21 02:18:50,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:18:50,702 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:18:50,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:18:50,703 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-21 02:18:50,706 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-21 02:18:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:50,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 02:18:50,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:18:50,894 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-21 02:18:50,894 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:18:50,894 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:18:50,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2028861633] [2022-07-21 02:18:50,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2028861633] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:18:50,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:18:50,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 02:18:50,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457118580] [2022-07-21 02:18:50,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:18:50,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 02:18:50,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:18:50,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 02:18:50,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 02:18:50,906 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-21 02:18:50,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:18:50,930 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2022-07-21 02:18:50,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 02:18:50,931 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-21 02:18:50,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:18:50,935 INFO L225 Difference]: With dead ends: 52 [2022-07-21 02:18:50,935 INFO L226 Difference]: Without dead ends: 31 [2022-07-21 02:18:50,935 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-21 02:18:50,937 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-21 02:18:50,937 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-21 02:18:50,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-21 02:18:50,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-07-21 02:18:50,946 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-21 02:18:50,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-07-21 02:18:50,948 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 24 [2022-07-21 02:18:50,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:18:50,949 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-07-21 02:18:50,950 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-21 02:18:50,950 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-07-21 02:18:50,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-21 02:18:50,952 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:18:50,952 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-21 02:18:50,980 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-21 02:18:51,161 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-21 02:18:51,162 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:18:51,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:18:51,163 INFO L85 PathProgramCache]: Analyzing trace with hash 436872902, now seen corresponding path program 1 times [2022-07-21 02:18:51,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:18:51,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [989277485] [2022-07-21 02:18:51,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:18:51,164 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:18:51,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:18:51,167 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-21 02:18:51,168 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-21 02:18:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:51,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-21 02:18:51,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:18:51,508 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-21 02:18:51,576 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-21 02:18:51,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:51,684 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-21 02:18:51,733 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-21 02:18:51,749 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-21 02:18:51,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:18:51,866 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:18:51,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [989277485] [2022-07-21 02:18:51,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [989277485] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:18:51,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1926107641] [2022-07-21 02:18:51,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:18:51,867 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 02:18:51,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 02:18:51,881 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-21 02:18:51,900 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-21 02:18:52,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:52,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-21 02:18:52,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:18:52,320 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-21 02:18:52,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:52,395 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-21 02:18:52,449 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-21 02:18:52,453 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-21 02:18:52,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:18:52,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1926107641] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:18:52,522 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:18:52,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2022-07-21 02:18:52,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425203387] [2022-07-21 02:18:52,522 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:18:52,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-21 02:18:52,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:18:52,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-21 02:18:52,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=417, Unknown=9, NotChecked=0, Total=506 [2022-07-21 02:18:52,523 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 21 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 16 states have internal predecessors, (34), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 02:18:52,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:18:52,856 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-07-21 02:18:52,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 02:18:52,856 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 16 states have internal predecessors, (34), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 32 [2022-07-21 02:18:52,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:18:52,858 INFO L225 Difference]: With dead ends: 38 [2022-07-21 02:18:52,858 INFO L226 Difference]: Without dead ends: 30 [2022-07-21 02:18:52,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=575, Unknown=12, NotChecked=0, Total=702 [2022-07-21 02:18:52,859 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 02:18:52,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 133 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 122 Invalid, 0 Unknown, 29 Unchecked, 0.2s Time] [2022-07-21 02:18:52,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-21 02:18:52,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-07-21 02:18:52,862 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-21 02:18:52,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-07-21 02:18:52,863 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 32 [2022-07-21 02:18:52,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:18:52,863 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-07-21 02:18:52,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 16 states have internal predecessors, (34), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 02:18:52,864 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-07-21 02:18:52,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-21 02:18:52,865 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:18:52,865 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-21 02:18:52,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2022-07-21 02:18:53,078 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-21 02:18:53,268 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-21 02:18:53,269 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:18:53,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:18:53,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1205420011, now seen corresponding path program 1 times [2022-07-21 02:18:53,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:18:53,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305524774] [2022-07-21 02:18:53,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:18:53,270 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:18:53,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:18:53,272 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-21 02:18:53,273 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-21 02:18:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:53,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-21 02:18:53,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:18:53,496 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-21 02:18:53,695 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 02:18:53,695 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-21 02:18:53,760 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-21 02:18:53,843 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:18:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 40 [2022-07-21 02:18:53,849 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 10 treesize of output 9 [2022-07-21 02:18:53,978 INFO L356 Elim1Store]: treesize reduction 3, result has 81.3 percent of original size [2022-07-21 02:18:53,979 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 50 treesize of output 34 [2022-07-21 02:18:53,990 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-21 02:18:53,997 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-21 02:18:54,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:54,177 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 02:18:54,177 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 56 treesize of output 54 [2022-07-21 02:18:54,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:54,200 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 47 treesize of output 47 [2022-07-21 02:18:54,239 INFO L356 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-07-21 02:18:54,240 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-21 02:18:54,318 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-21 02:18:54,400 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-07-21 02:18:54,400 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-21 02:18:54,478 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-21 02:18:54,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:18:54,644 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:18:54,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1305524774] [2022-07-21 02:18:54,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1305524774] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:18:54,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1057995270] [2022-07-21 02:18:54,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:18:54,644 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 02:18:54,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 02:18:54,660 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-21 02:18:54,708 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-21 02:18:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:54,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-21 02:18:54,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:18:55,024 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-21 02:18:55,423 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 02:18:55,423 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-21 02:18:55,517 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-21 02:18:55,646 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:18:55,647 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-21 02:18:55,827 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 02:18:55,827 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 26 [2022-07-21 02:18:55,833 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-21 02:18:55,839 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-21 02:18:56,030 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-21 02:18:56,030 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 59 [2022-07-21 02:18:56,056 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 02:18:56,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 51 [2022-07-21 02:18:56,080 INFO L356 Elim1Store]: treesize reduction 8, result has 70.4 percent of original size [2022-07-21 02:18:56,081 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 30 treesize of output 32 [2022-07-21 02:18:56,101 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 33 treesize of output 25 [2022-07-21 02:18:56,160 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 76 treesize of output 66 [2022-07-21 02:18:56,507 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 51 treesize of output 35 [2022-07-21 02:18:56,625 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 02:18:56,625 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 26 [2022-07-21 02:18:56,672 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-21 02:18:56,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:18:56,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1057995270] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:18:56,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:18:56,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 40 [2022-07-21 02:18:56,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547544805] [2022-07-21 02:18:56,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:18:56,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-21 02:18:56,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:18:56,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-21 02:18:56,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1615, Unknown=6, NotChecked=0, Total=1806 [2022-07-21 02:18:56,801 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), 29 states have internal predecessors, (51), 6 states have call successors, (6), 6 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-21 02:18:57,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:18:57,573 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2022-07-21 02:18:57,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 02:18:57,574 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 29 states have internal predecessors, (51), 6 states have call successors, (6), 6 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-21 02:18:57,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:18:57,574 INFO L225 Difference]: With dead ends: 56 [2022-07-21 02:18:57,574 INFO L226 Difference]: Without dead ends: 47 [2022-07-21 02:18:57,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 923 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=279, Invalid=2365, Unknown=8, NotChecked=0, Total=2652 [2022-07-21 02:18:57,576 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 26 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 02:18:57,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 380 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 219 Invalid, 0 Unknown, 152 Unchecked, 0.3s Time] [2022-07-21 02:18:57,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-21 02:18:57,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2022-07-21 02:18:57,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-21 02:18:57,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-07-21 02:18:57,582 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 35 [2022-07-21 02:18:57,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:18:57,582 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-07-21 02:18:57,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 29 states have internal predecessors, (51), 6 states have call successors, (6), 6 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-21 02:18:57,582 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-07-21 02:18:57,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-21 02:18:57,583 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:18:57,583 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-21 02:18:57,604 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-21 02:18:57,798 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-21 02:18:57,984 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-21 02:18:57,984 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:18:57,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:18:57,985 INFO L85 PathProgramCache]: Analyzing trace with hash 790772624, now seen corresponding path program 1 times [2022-07-21 02:18:57,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:18:57,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [652290743] [2022-07-21 02:18:57,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:18:57,985 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:18:57,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:18:57,993 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-21 02:18:57,994 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-21 02:18:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:18:58,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 97 conjunts are in the unsatisfiable core [2022-07-21 02:18:58,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:18:58,244 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-21 02:18:58,260 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-21 02:18:58,315 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 02:18:58,315 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-21 02:18:58,382 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-21 02:18:58,442 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-21 02:18:58,442 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-21 02:18:58,502 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-21 02:18:58,632 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:18:58,632 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 37 treesize of output 36 [2022-07-21 02:18:58,809 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-21 02:18:58,810 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 72 treesize of output 27 [2022-07-21 02:18:58,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, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-07-21 02:18:58,915 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-21 02:18:59,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:59,033 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 02:18:59,034 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 78 treesize of output 68 [2022-07-21 02:18:59,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:59,039 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 61 treesize of output 59 [2022-07-21 02:18:59,092 INFO L356 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2022-07-21 02:18:59,092 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 40 treesize of output 44 [2022-07-21 02:18:59,872 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 37 treesize of output 39 [2022-07-21 02:18:59,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:59,914 INFO L356 Elim1Store]: treesize reduction 99, result has 10.0 percent of original size [2022-07-21 02:18:59,915 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 2 case distinctions, treesize of input 190 treesize of output 102 [2022-07-21 02:18:59,974 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-21 02:18:59,975 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 236 treesize of output 169 [2022-07-21 02:18:59,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:18:59,987 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 168 treesize of output 118 [2022-07-21 02:18:59,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:19:00,025 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-07-21 02:19:00,025 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 147 treesize of output 131 [2022-07-21 02:19:00,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:19:00,038 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 41 treesize of output 45 [2022-07-21 02:19:00,171 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-07-21 02:19:00,172 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 138 treesize of output 47 [2022-07-21 02:19:00,178 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-21 02:19:00,236 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-21 02:19:00,276 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-21 02:19:00,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:19:00,492 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_531 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_548 (_ BitVec 32)) (v_ArrVal_549 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_538 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_548)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_549) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_538) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_531) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_547) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-21 02:19:00,716 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_531 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_548 (_ BitVec 32)) (v_ArrVal_549 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_538 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_547 (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_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_548)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_549) .cse0 v_ArrVal_538) (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) .cse0 v_ArrVal_531) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) .cse0 v_ArrVal_547) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-07-21 02:19:00,947 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_531 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_548 (_ BitVec 32)) (v_ArrVal_549 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_538 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) .cse4))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_548)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_549) .cse0 v_ArrVal_538) (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)))) (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) .cse0 v_ArrVal_531) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)))) (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) .cse0 v_ArrVal_547) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-07-21 02:19:01,034 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_531 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_548 (_ BitVec 32)) (v_ArrVal_549 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_538 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) .cse4))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_548)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_549) .cse0 v_ArrVal_538) (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| .cse2)))) (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|))) .cse0 v_ArrVal_531) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| .cse4)))) (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|))) .cse0 v_ArrVal_547) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-07-21 02:19:01,297 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:19:01,297 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 171 treesize of output 177 [2022-07-21 02:19:01,422 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:19:01,422 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 1752 treesize of output 1625 [2022-07-21 02:19:01,468 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 1484 treesize of output 1220 [2022-07-21 02:19:01,520 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 1220 treesize of output 1088 [2022-07-21 02:19:03,577 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:19:03,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [652290743] [2022-07-21 02:19:03,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [652290743] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:19:03,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1965774077] [2022-07-21 02:19:03,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:19:03,577 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 02:19:03,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 02:19:03,578 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-21 02:19:03,579 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-21 02:19:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:19:03,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 80 conjunts are in the unsatisfiable core [2022-07-21 02:19:03,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:19:04,117 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-21 02:19:04,700 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-21 02:19:05,162 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 02:19:05,163 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-21 02:19:05,332 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-21 02:19:05,573 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:19:05,574 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 39 treesize of output 38 [2022-07-21 02:19:05,908 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 02:19:05,908 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 69 treesize of output 32 [2022-07-21 02:19:05,916 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 18 treesize of output 14 [2022-07-21 02:19:05,921 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-21 02:19:06,108 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-21 02:19:06,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:19:06,234 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 02:19:06,234 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 75 treesize of output 67 [2022-07-21 02:19:06,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:19:06,261 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-21 02:19:06,301 INFO L356 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-07-21 02:19:06,302 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 39 treesize of output 41 [2022-07-21 02:19:07,474 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 37 treesize of output 39 [2022-07-21 02:19:07,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:19:07,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:19:07,550 INFO L356 Elim1Store]: treesize reduction 88, result has 17.8 percent of original size [2022-07-21 02:19:07,551 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 5 case distinctions, treesize of input 142 treesize of output 116 [2022-07-21 02:19:07,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:19:07,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:19:07,602 INFO L356 Elim1Store]: treesize reduction 28, result has 33.3 percent of original size [2022-07-21 02:19:07,602 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 3 case distinctions, treesize of input 97 treesize of output 89 [2022-07-21 02:19:07,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2022-07-21 02:19:07,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 51 [2022-07-21 02:19:07,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:19:07,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:19:07,628 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 25 treesize of output 29 [2022-07-21 02:19:07,947 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 02:19:07,947 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 33 [2022-07-21 02:19:07,953 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-21 02:19:08,027 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-21 02:19:08,031 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-21 02:19:08,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:19:08,068 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_672 (_ BitVec 32)) (v_ArrVal_666 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_672)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_666) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_663) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_661) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_664) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_662) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_660) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_671) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_670) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32))))) is different from false [2022-07-21 02:19:08,194 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_672 (_ BitVec 32)) (v_ArrVal_666 (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_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_672)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_666) .cse0 v_ArrVal_663) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_661) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_664) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) .cse0 v_ArrVal_662) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_660) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_671) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) .cse0 v_ArrVal_670) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-07-21 02:19:08,285 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_672 (_ BitVec 32)) (v_ArrVal_666 (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_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_672)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_666) .cse0 v_ArrVal_663) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_661) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_664) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) .cse0 v_ArrVal_662) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_660) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_671) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) .cse0 v_ArrVal_670) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-07-21 02:19:08,316 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_672 (_ BitVec 32)) (v_ArrVal_666 (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_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_672)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_666) .cse0 v_ArrVal_663) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_661) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_664) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) .cse0 v_ArrVal_662) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_660) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_671) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)) .cse0 v_ArrVal_670) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-07-21 02:19:08,488 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:19:08,492 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 131 treesize of output 137 [2022-07-21 02:19:08,640 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:19: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 2 new quantified variables, introduced 1 case distinctions, treesize of input 614 treesize of output 617 [2022-07-21 02:19:08,678 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 516 treesize of output 424 [2022-07-21 02:19:08,702 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 234 treesize of output 188 [2022-07-21 02:19:18,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1965774077] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:19:18,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:19:18,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25] total 41 [2022-07-21 02:19:18,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771764609] [2022-07-21 02:19:18,995 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:19:18,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-21 02:19:18,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 02:19:18,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-21 02:19:18,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1919, Unknown=13, NotChecked=760, Total=2862 [2022-07-21 02:19:18,996 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 41 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 30 states have internal predecessors, (51), 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-21 02:19:24,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:19:24,592 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-07-21 02:19:24,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-21 02:19:24,593 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 30 states have internal predecessors, (51), 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 37 [2022-07-21 02:19:24,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:19:24,594 INFO L225 Difference]: With dead ends: 59 [2022-07-21 02:19:24,594 INFO L226 Difference]: Without dead ends: 57 [2022-07-21 02:19:24,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=259, Invalid=2840, Unknown=13, NotChecked=920, Total=4032 [2022-07-21 02:19:24,596 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 144 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 02:19:24,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 240 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 230 Invalid, 0 Unknown, 144 Unchecked, 0.8s Time] [2022-07-21 02:19:24,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-21 02:19:24,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2022-07-21 02:19:24,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 47 states have internal predecessors, (52), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 02:19:24,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2022-07-21 02:19:24,608 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 37 [2022-07-21 02:19:24,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:19:24,610 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2022-07-21 02:19:24,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 30 states have internal predecessors, (51), 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-21 02:19:24,610 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2022-07-21 02:19:24,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-21 02:19:24,615 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:19:24,615 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-21 02:19:24,620 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-21 02:19:24,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-21 02:19:25,024 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-21 02:19:25,025 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:19:25,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:19:25,025 INFO L85 PathProgramCache]: Analyzing trace with hash -718486453, now seen corresponding path program 2 times [2022-07-21 02:19:25,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 02:19:25,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [3217865] [2022-07-21 02:19:25,026 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 02:19:25,026 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 02:19:25,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 02:19:25,027 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-21 02:19:25,029 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-21 02:19:25,254 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 02:19:25,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 02:19:25,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-21 02:19:25,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:19:25,300 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-21 02:19:25,747 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 02:19:25,747 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-21 02:19:25,888 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-21 02:19:25,906 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-21 02:19:26,115 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-21 02:19:26,116 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-21 02:19:26,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-07-21 02:19:26,489 INFO L356 Elim1Store]: treesize reduction 32, result has 28.9 percent of original size [2022-07-21 02:19:26,489 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-21 02:19:26,508 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-21 02:19:26,508 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-21 02:19:26,516 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-21 02:19:26,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:19:26,920 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-21 02:19:26,921 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-21 02:19:26,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:19:26,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:19:26,973 INFO L356 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2022-07-21 02:19:26,974 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-21 02:19:27,034 INFO L356 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-07-21 02:19:27,035 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-21 02:19:27,765 INFO L356 Elim1Store]: treesize reduction 32, result has 28.9 percent of original size [2022-07-21 02:19:27,765 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-21 02:19:27,788 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-21 02:19:27,788 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-21 02:19:27,912 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-21 02:19:27,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:19:28,794 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 02:19:28,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [3217865] [2022-07-21 02:19:28,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [3217865] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:19:28,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1778416119] [2022-07-21 02:19:28,794 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 02:19:28,795 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 02:19:28,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 02:19:28,796 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-21 02:19:28,797 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-21 02:19:29,190 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 02:19:29,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 02:19:29,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 111 conjunts are in the unsatisfiable core [2022-07-21 02:19:29,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:19:29,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 02:19:30,263 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 02:19:30,264 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 17 treesize of output 24 [2022-07-21 02:19:30,443 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-21 02:19:30,478 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-21 02:19:30,757 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-21 02:19:30,757 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 61 treesize of output 43 [2022-07-21 02:19:30,765 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 33 treesize of output 33 [2022-07-21 02:19:31,765 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-21 02:19:36,222 INFO L356 Elim1Store]: treesize reduction 122, result has 19.7 percent of original size [2022-07-21 02:19:36,222 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 129 treesize of output 95 [2022-07-21 02:19:36,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:19:36,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:19:36,283 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-21 02:19:36,283 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 56 [2022-07-21 02:19:36,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:19:36,319 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 02:19:36,319 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 22 treesize of output 16 [2022-07-21 02:20:10,960 WARN L233 SmtUtils]: Spent 30.94s on a formula simplification. DAG size of input: 512 DAG size of output: 97 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-21 02:20:10,961 INFO L356 Elim1Store]: treesize reduction 3439, result has 5.8 percent of original size [2022-07-21 02:20:10,962 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-21 02:20:10,969 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-21 02:20:11,176 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-21 02:20:11,368 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-21 02:20:11,369 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_104| input size 432 context size 432 output size 432 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:764) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:725) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:643) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:335) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) 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:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) 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-21 02:20:11,372 INFO L158 Benchmark]: Toolchain (without parser) took 82364.39ms. Allocated memory was 62.9MB in the beginning and 136.3MB in the end (delta: 73.4MB). Free memory was 45.6MB in the beginning and 90.6MB in the end (delta: -45.0MB). Peak memory consumption was 84.9MB. Max. memory is 16.1GB. [2022-07-21 02:20:11,373 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 46.1MB. Free memory was 27.5MB in the beginning and 27.5MB in the end (delta: 36.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 02:20:11,373 INFO L158 Benchmark]: CACSL2BoogieTranslator took 450.53ms. Allocated memory is still 62.9MB. Free memory was 45.4MB in the beginning and 38.0MB in the end (delta: 7.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-21 02:20:11,373 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.93ms. Allocated memory is still 62.9MB. Free memory was 38.0MB in the beginning and 35.6MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 02:20:11,373 INFO L158 Benchmark]: Boogie Preprocessor took 50.94ms. Allocated memory is still 62.9MB. Free memory was 35.6MB in the beginning and 33.7MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-21 02:20:11,373 INFO L158 Benchmark]: RCFGBuilder took 458.91ms. Allocated memory is still 62.9MB. Free memory was 33.5MB in the beginning and 32.7MB in the end (delta: 742.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-21 02:20:11,373 INFO L158 Benchmark]: TraceAbstraction took 81339.99ms. Allocated memory was 62.9MB in the beginning and 136.3MB in the end (delta: 73.4MB). Free memory was 32.2MB in the beginning and 90.6MB in the end (delta: -58.4MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. [2022-07-21 02:20:11,374 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.17ms. Allocated memory is still 46.1MB. Free memory was 27.5MB in the beginning and 27.5MB in the end (delta: 36.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 450.53ms. Allocated memory is still 62.9MB. Free memory was 45.4MB in the beginning and 38.0MB in the end (delta: 7.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.93ms. Allocated memory is still 62.9MB. Free memory was 38.0MB in the beginning and 35.6MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.94ms. Allocated memory is still 62.9MB. Free memory was 35.6MB in the beginning and 33.7MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 458.91ms. Allocated memory is still 62.9MB. Free memory was 33.5MB in the beginning and 32.7MB in the end (delta: 742.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 81339.99ms. Allocated memory was 62.9MB in the beginning and 136.3MB in the end (delta: 73.4MB). Free memory was 32.2MB in the beginning and 90.6MB in the end (delta: -58.4MB). Peak memory consumption was 73.4MB. 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_104| input size 432 context size 432 output size 432 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_104| input size 432 context size 432 output size 432: 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-21 02:20:11,433 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_104| input size 432 context size 432 output size 432