./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2c_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2c_append_unequal.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 d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 08:55:03,335 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 08:55:03,337 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 08:55:03,368 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 08:55:03,368 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 08:55:03,371 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 08:55:03,372 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 08:55:03,374 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 08:55:03,375 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 08:55:03,378 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 08:55:03,379 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 08:55:03,380 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 08:55:03,380 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 08:55:03,382 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 08:55:03,383 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 08:55:03,386 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 08:55:03,386 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 08:55:03,387 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 08:55:03,388 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 08:55:03,392 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 08:55:03,393 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 08:55:03,394 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 08:55:03,395 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 08:55:03,396 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 08:55:03,401 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 08:55:03,401 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 08:55:03,401 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 08:55:03,403 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 08:55:03,403 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 08:55:03,404 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 08:55:03,404 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 08:55:03,404 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 08:55:03,406 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 08:55:03,406 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 08:55:03,407 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 08:55:03,407 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 08:55:03,408 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 08:55:03,408 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 08:55:03,408 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 08:55:03,409 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 08:55:03,409 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 08:55:03,410 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 08:55:03,435 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 08:55:03,436 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 08:55:03,436 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 08:55:03,436 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 08:55:03,437 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 08:55:03,437 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 08:55:03,437 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 08:55:03,438 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 08:55:03,438 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 08:55:03,438 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 08:55:03,438 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 08:55:03,439 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 08:55:03,439 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 08:55:03,439 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 08:55:03,439 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 08:55:03,439 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 08:55:03,439 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 08:55:03,439 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 08:55:03,439 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 08:55:03,440 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 08:55:03,440 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 08:55:03,440 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 08:55:03,440 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 08:55:03,440 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 08:55:03,440 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 08:55:03,440 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 08:55:03,441 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 08:55:03,442 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 08:55:03,442 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 08:55:03,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 08:55:03,442 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 08:55:03,442 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 08:55:03,442 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 08:55:03,443 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 08:55:03,443 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 -> d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 [2021-12-17 08:55:03,640 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 08:55:03,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 08:55:03,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 08:55:03,658 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 08:55:03,658 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 08:55:03,659 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2021-12-17 08:55:03,703 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39c50fd3a/ac1644ed54fd4b4eb33514996a3cec70/FLAG89fc95a02 [2021-12-17 08:55:04,089 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 08:55:04,090 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2021-12-17 08:55:04,097 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39c50fd3a/ac1644ed54fd4b4eb33514996a3cec70/FLAG89fc95a02 [2021-12-17 08:55:04,484 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39c50fd3a/ac1644ed54fd4b4eb33514996a3cec70 [2021-12-17 08:55:04,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 08:55:04,488 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 08:55:04,491 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 08:55:04,491 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 08:55:04,493 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 08:55:04,494 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 08:55:04" (1/1) ... [2021-12-17 08:55:04,495 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56c79cbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:55:04, skipping insertion in model container [2021-12-17 08:55:04,495 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 08:55:04" (1/1) ... [2021-12-17 08:55:04,500 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 08:55:04,534 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 08:55:04,755 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_unequal.i[24587,24600] [2021-12-17 08:55:04,757 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 08:55:04,764 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 08:55:04,790 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_unequal.i[24587,24600] [2021-12-17 08:55:04,791 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 08:55:04,808 INFO L208 MainTranslator]: Completed translation [2021-12-17 08:55:04,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:55:04 WrapperNode [2021-12-17 08:55:04,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 08:55:04,810 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 08:55:04,810 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 08:55:04,810 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 08:55:04,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:55:04" (1/1) ... [2021-12-17 08:55:04,828 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:55:04" (1/1) ... [2021-12-17 08:55:04,844 INFO L137 Inliner]: procedures = 127, calls = 46, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 158 [2021-12-17 08:55:04,845 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 08:55:04,846 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 08:55:04,846 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 08:55:04,846 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 08:55:04,851 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:55:04" (1/1) ... [2021-12-17 08:55:04,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:55:04" (1/1) ... [2021-12-17 08:55:04,855 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:55:04" (1/1) ... [2021-12-17 08:55:04,855 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:55:04" (1/1) ... [2021-12-17 08:55:04,861 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:55:04" (1/1) ... [2021-12-17 08:55:04,864 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:55:04" (1/1) ... [2021-12-17 08:55:04,865 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:55:04" (1/1) ... [2021-12-17 08:55:04,867 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 08:55:04,868 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 08:55:04,868 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 08:55:04,868 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 08:55:04,868 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:55:04" (1/1) ... [2021-12-17 08:55:04,885 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 08:55:04,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:55:04,907 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) [2021-12-17 08:55:04,927 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 [2021-12-17 08:55:04,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-17 08:55:04,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-17 08:55:04,936 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-17 08:55:04,936 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-17 08:55:04,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-17 08:55:04,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 08:55:04,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 08:55:04,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-17 08:55:04,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-17 08:55:04,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 08:55:04,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-17 08:55:04,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 08:55:04,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 08:55:04,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 08:55:05,006 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 08:55:05,008 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 08:55:05,215 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 08:55:05,220 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 08:55:05,220 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-17 08:55:05,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 08:55:05 BoogieIcfgContainer [2021-12-17 08:55:05,221 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 08:55:05,222 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 08:55:05,222 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 08:55:05,225 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 08:55:05,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 08:55:04" (1/3) ... [2021-12-17 08:55:05,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e3a9680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 08:55:05, skipping insertion in model container [2021-12-17 08:55:05,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:55:04" (2/3) ... [2021-12-17 08:55:05,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e3a9680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 08:55:05, skipping insertion in model container [2021-12-17 08:55:05,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 08:55:05" (3/3) ... [2021-12-17 08:55:05,227 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal.i [2021-12-17 08:55:05,234 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 08:55:05,234 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 08:55:05,285 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 08:55:05,290 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 08:55:05,291 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 08:55:05,306 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 34 states have internal predecessors, (50), 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) [2021-12-17 08:55:05,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-17 08:55:05,309 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:55:05,310 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:55:05,310 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:55:05,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:55:05,314 INFO L85 PathProgramCache]: Analyzing trace with hash -2119803949, now seen corresponding path program 1 times [2021-12-17 08:55:05,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:55:05,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377534127] [2021-12-17 08:55:05,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:55:05,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:55:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:05,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 08:55:05,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:05,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 08:55:05,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:05,505 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 08:55:05,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:55:05,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377534127] [2021-12-17 08:55:05,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377534127] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:55:05,506 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:55:05,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 08:55:05,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35110979] [2021-12-17 08:55:05,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:55:05,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 08:55:05,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:55:05,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 08:55:05,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 08:55:05,535 INFO L87 Difference]: Start difference. First operand has 39 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 34 states have internal predecessors, (50), 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.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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) [2021-12-17 08:55:05,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:55:05,596 INFO L93 Difference]: Finished difference Result 71 states and 101 transitions. [2021-12-17 08:55:05,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 08:55:05,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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 25 [2021-12-17 08:55:05,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:55:05,603 INFO L225 Difference]: With dead ends: 71 [2021-12-17 08:55:05,603 INFO L226 Difference]: Without dead ends: 31 [2021-12-17 08:55:05,606 INFO L932 BasicCegarLoop]: 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 [2021-12-17 08:55:05,610 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 08:55:05,610 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 08:55:05,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-17 08:55:05,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2021-12-17 08:55:05,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 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) [2021-12-17 08:55:05,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2021-12-17 08:55:05,636 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 25 [2021-12-17 08:55:05,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:55:05,637 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2021-12-17 08:55:05,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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) [2021-12-17 08:55:05,638 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2021-12-17 08:55:05,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-17 08:55:05,640 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:55:05,641 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:55:05,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 08:55:05,642 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:55:05,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:55:05,642 INFO L85 PathProgramCache]: Analyzing trace with hash -826043684, now seen corresponding path program 1 times [2021-12-17 08:55:05,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:55:05,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171991455] [2021-12-17 08:55:05,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:55:05,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:55:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:05,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 08:55:05,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:05,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 08:55:05,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:05,783 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 08:55:05,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:55:05,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171991455] [2021-12-17 08:55:05,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171991455] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:55:05,784 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:55:05,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 08:55:05,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652177571] [2021-12-17 08:55:05,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:55:05,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 08:55:05,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:55:05,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 08:55:05,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 08:55:05,786 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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) [2021-12-17 08:55:05,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:55:05,858 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2021-12-17 08:55:05,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 08:55:05,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 26 [2021-12-17 08:55:05,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:55:05,862 INFO L225 Difference]: With dead ends: 58 [2021-12-17 08:55:05,863 INFO L226 Difference]: Without dead ends: 34 [2021-12-17 08:55:05,863 INFO L932 BasicCegarLoop]: 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 [2021-12-17 08:55:05,864 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 08:55:05,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 86 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 08:55:05,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-17 08:55:05,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2021-12-17 08:55:05,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 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) [2021-12-17 08:55:05,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2021-12-17 08:55:05,875 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 26 [2021-12-17 08:55:05,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:55:05,876 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2021-12-17 08:55:05,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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) [2021-12-17 08:55:05,877 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2021-12-17 08:55:05,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-17 08:55:05,878 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:55:05,878 INFO L514 BasicCegarLoop]: 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] [2021-12-17 08:55:05,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 08:55:05,879 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:55:05,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:55:05,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1959720012, now seen corresponding path program 1 times [2021-12-17 08:55:05,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:55:05,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577398306] [2021-12-17 08:55:05,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:55:05,881 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:55:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:06,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 08:55:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:06,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 08:55:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:06,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 08:55:06,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:06,110 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 08:55:06,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:55:06,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577398306] [2021-12-17 08:55:06,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577398306] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:55:06,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189889167] [2021-12-17 08:55:06,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:55:06,111 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:55:06,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:55:06,113 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) [2021-12-17 08:55:06,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-17 08:55:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:06,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-17 08:55:06,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:55:06,533 INFO L388 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 17 treesize of output 9 [2021-12-17 08:55:06,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:06,609 INFO L388 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 [2021-12-17 08:55:06,639 INFO L388 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 [2021-12-17 08:55:06,662 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 08:55:06,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:55:06,748 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_316 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_9| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_9| v_ArrVal_316) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (<= (+ .cse0 1) 0) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_9|) (<= 1 .cse0)))) is different from false [2021-12-17 08:55:06,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189889167] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:55:06,749 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 08:55:06,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2021-12-17 08:55:06,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294204181] [2021-12-17 08:55:06,750 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 08:55:06,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-17 08:55:06,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:55:06,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-17 08:55:06,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=482, Unknown=1, NotChecked=44, Total=600 [2021-12-17 08:55:06,763 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 23 states, 21 states have (on average 2.0) internal successors, (42), 17 states have internal predecessors, (42), 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) [2021-12-17 08:55:06,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:55:06,962 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2021-12-17 08:55:06,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 08:55:06,963 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.0) internal successors, (42), 17 states have internal predecessors, (42), 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 34 [2021-12-17 08:55:06,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:55:06,964 INFO L225 Difference]: With dead ends: 44 [2021-12-17 08:55:06,964 INFO L226 Difference]: Without dead ends: 33 [2021-12-17 08:55:06,965 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=756, Unknown=1, NotChecked=56, Total=930 [2021-12-17 08:55:06,965 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 12 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 08:55:06,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 251 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 166 Invalid, 0 Unknown, 24 Unchecked, 0.1s Time] [2021-12-17 08:55:06,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-12-17 08:55:06,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2021-12-17 08:55:06,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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) [2021-12-17 08:55:06,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2021-12-17 08:55:06,970 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 34 [2021-12-17 08:55:06,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:55:06,970 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2021-12-17 08:55:06,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.0) internal successors, (42), 17 states have internal predecessors, (42), 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) [2021-12-17 08:55:06,971 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2021-12-17 08:55:06,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-17 08:55:06,971 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:55:06,971 INFO L514 BasicCegarLoop]: 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, 1, 1] [2021-12-17 08:55:06,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-17 08:55:07,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:55:07,184 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:55:07,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:55:07,184 INFO L85 PathProgramCache]: Analyzing trace with hash -158694653, now seen corresponding path program 1 times [2021-12-17 08:55:07,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:55:07,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658741426] [2021-12-17 08:55:07,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:55:07,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:55:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:07,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 08:55:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:07,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 08:55:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:07,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 08:55:07,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:07,572 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 08:55:07,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:55:07,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658741426] [2021-12-17 08:55:07,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658741426] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:55:07,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147286100] [2021-12-17 08:55:07,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:55:07,574 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:55:07,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:55:07,575 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) [2021-12-17 08:55:07,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-17 08:55:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:07,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 109 conjunts are in the unsatisfiable core [2021-12-17 08:55:07,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:55:07,703 INFO L388 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 [2021-12-17 08:55:07,731 INFO L388 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 [2021-12-17 08:55:07,796 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 08:55:07,797 INFO L388 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 1 case distinctions, treesize of input 12 treesize of output 14 [2021-12-17 08:55:07,876 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 08:55:07,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 08:55:07,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:07,962 INFO L354 Elim1Store]: treesize reduction 26, result has 27.8 percent of original size [2021-12-17 08:55:07,963 INFO L388 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 3 case distinctions, treesize of input 22 treesize of output 29 [2021-12-17 08:55:08,022 INFO L388 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 [2021-12-17 08:55:08,104 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 08:55:08,105 INFO L388 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 [2021-12-17 08:55:08,231 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 08:55:08,234 INFO L388 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 54 treesize of output 21 [2021-12-17 08:55:08,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:08,248 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 08:55:08,249 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2021-12-17 08:55:08,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:08,382 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 08:55:08,383 INFO L388 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 62 treesize of output 58 [2021-12-17 08:55:08,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:08,388 INFO L388 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 44 treesize of output 44 [2021-12-17 08:55:08,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:08,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:08,404 INFO L354 Elim1Store]: treesize reduction 28, result has 47.2 percent of original size [2021-12-17 08:55:08,404 INFO L388 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 37 treesize of output 37 [2021-12-17 08:55:08,755 INFO L354 Elim1Store]: treesize reduction 92, result has 17.1 percent of original size [2021-12-17 08:55:08,755 INFO L388 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 104 treesize of output 64 [2021-12-17 08:55:08,771 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-17 08:55:08,772 INFO L388 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 85 [2021-12-17 08:55:08,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:08,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:08,778 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 68 [2021-12-17 08:55:08,854 INFO L388 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 52 treesize of output 40 [2021-12-17 08:55:08,954 INFO L354 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2021-12-17 08:55:08,954 INFO L388 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 36 [2021-12-17 08:55:08,995 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 08:55:08,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:55:09,074 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_505 (Array Int Int))) (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_504))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_505) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2021-12-17 08:55:09,212 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_505 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse2))) (or (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse3 |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_504))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_505) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))) (not (= (select .cse3 |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) .cse2)))))) is different from false [2021-12-17 08:55:09,228 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_505 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse2))) (or (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse3 |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_504))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_505) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_503) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))) (not (= (select .cse3 |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) .cse2)))))) is different from false [2021-12-17 08:55:09,305 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_13| Int) (v_ArrVal_505 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int)) (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_13| v_ArrVal_514))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse0 (select .cse4 .cse1))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_13|))) (not (= (select .cse0 |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) .cse1)) (not (let ((.cse2 (store (store .cse4 .cse1 (store .cse0 |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_13|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_13| v_ArrVal_504))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse2 .cse3) (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_13| v_ArrVal_513) .cse1 v_ArrVal_505) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_13| v_ArrVal_503) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3)))) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_13|)))))) is different from false [2021-12-17 08:55:09,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147286100] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:55:09,307 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 08:55:09,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 25] total 41 [2021-12-17 08:55:09,307 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234234181] [2021-12-17 08:55:09,307 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 08:55:09,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-17 08:55:09,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:55:09,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-17 08:55:09,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1829, Unknown=5, NotChecked=356, Total=2352 [2021-12-17 08:55:09,309 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 41 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 33 states have internal predecessors, (57), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 08:55:09,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:55:09,822 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2021-12-17 08:55:09,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-17 08:55:09,822 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 33 states have internal predecessors, (57), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 37 [2021-12-17 08:55:09,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:55:09,823 INFO L225 Difference]: With dead ends: 71 [2021-12-17 08:55:09,823 INFO L226 Difference]: Without dead ends: 59 [2021-12-17 08:55:09,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 831 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=257, Invalid=2722, Unknown=7, NotChecked=436, Total=3422 [2021-12-17 08:55:09,825 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 32 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 08:55:09,825 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 426 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 401 Invalid, 0 Unknown, 106 Unchecked, 0.2s Time] [2021-12-17 08:55:09,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-12-17 08:55:09,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 45. [2021-12-17 08:55:09,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 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) [2021-12-17 08:55:09,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2021-12-17 08:55:09,831 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 37 [2021-12-17 08:55:09,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:55:09,831 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2021-12-17 08:55:09,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 33 states have internal predecessors, (57), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 08:55:09,832 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2021-12-17 08:55:09,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-17 08:55:09,832 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:55:09,833 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:55:09,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-17 08:55:10,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-17 08:55:10,034 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:55:10,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:55:10,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1887720382, now seen corresponding path program 1 times [2021-12-17 08:55:10,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:55:10,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735318524] [2021-12-17 08:55:10,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:55:10,034 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:55:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:10,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 08:55:10,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:10,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 08:55:10,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:10,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 08:55:10,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:10,769 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 08:55:10,770 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:55:10,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735318524] [2021-12-17 08:55:10,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735318524] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:55:10,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851492833] [2021-12-17 08:55:10,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:55:10,771 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:55:10,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:55:10,772 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) [2021-12-17 08:55:10,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-17 08:55:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:10,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 118 conjunts are in the unsatisfiable core [2021-12-17 08:55:10,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:55:10,898 INFO L388 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 [2021-12-17 08:55:10,934 INFO L388 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 [2021-12-17 08:55:11,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:11,038 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-17 08:55:11,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:11,181 INFO L388 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 [2021-12-17 08:55:11,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:11,290 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-12-17 08:55:11,290 INFO L388 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 [2021-12-17 08:55:11,369 INFO L388 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 [2021-12-17 08:55:11,464 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 08:55:11,464 INFO L388 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 35 treesize of output 34 [2021-12-17 08:55:11,655 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 08:55:11,655 INFO L388 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 70 treesize of output 25 [2021-12-17 08:55:11,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:11,663 INFO L388 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 [2021-12-17 08:55:11,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:11,832 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 08:55:11,832 INFO L388 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 [2021-12-17 08:55:11,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:11,836 INFO L388 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 [2021-12-17 08:55:11,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:11,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:11,849 INFO L354 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2021-12-17 08:55:11,849 INFO L388 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 [2021-12-17 08:55:12,396 INFO L354 Elim1Store]: treesize reduction 104, result has 15.4 percent of original size [2021-12-17 08:55:12,397 INFO L388 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 5 case distinctions, treesize of input 152 treesize of output 71 [2021-12-17 08:55:12,421 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-12-17 08:55:12,421 INFO L388 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 182 treesize of output 113 [2021-12-17 08:55:12,437 INFO L354 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-12-17 08:55:12,438 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 152 treesize of output 148 [2021-12-17 08:55:12,520 INFO L388 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 122 treesize of output 94 [2021-12-17 08:55:12,600 INFO L354 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2021-12-17 08:55:12,600 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 39 [2021-12-17 08:55:12,618 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 08:55:12,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:55:12,663 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 (Array Int Int))) (not (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_703))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_705) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_701) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2021-12-17 08:55:12,811 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse2))) (or (not (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse3 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_703))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_705) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_701) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (select .cse3 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10|))))))) is different from false [2021-12-17 08:55:12,831 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse4))) (or (not (= .cse0 (select .cse1 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10|))) (not (let ((.cse3 (store (store |c_#memory_$Pointer$.base| .cse4 (store .cse1 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_703))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse2 (select (select .cse3 .cse2) (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_705) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_701) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))))) is different from false [2021-12-17 08:55:12,845 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse4))) (or (not (= .cse0 (select .cse1 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10|))) (not (let ((.cse3 (store (store |c_#memory_$Pointer$.base| .cse4 (store .cse1 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_703))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse2 (select (select .cse3 .cse2) (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_705) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_701) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))))) is different from false [2021-12-17 08:55:12,927 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| Int) (v_ArrVal_713 (Array Int Int)) (v_ArrVal_712 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| Int)) (let ((.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| v_ArrVal_712))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| v_ArrVal_713))) (let ((.cse5 (select (select .cse6 .cse0) (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse1 (select .cse6 .cse5))) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17|))) (not (= .cse0 (select .cse1 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10|))) (not (let ((.cse3 (store (store .cse6 .cse5 (store .cse1 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_10| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| v_ArrVal_703))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse2 (select (select .cse3 .cse2) (select (select (store (store .cse4 .cse5 v_ArrVal_705) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| v_ArrVal_701) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))))) is different from false [2021-12-17 08:55:12,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851492833] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:55:12,929 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 08:55:12,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 46 [2021-12-17 08:55:12,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032379679] [2021-12-17 08:55:12,930 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 08:55:12,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-12-17 08:55:12,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:55:12,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-12-17 08:55:12,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2120, Unknown=6, NotChecked=480, Total=2756 [2021-12-17 08:55:12,934 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand has 46 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 37 states have internal predecessors, (60), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 08:55:14,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:55:14,190 INFO L93 Difference]: Finished difference Result 69 states and 87 transitions. [2021-12-17 08:55:14,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-17 08:55:14,190 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 37 states have internal predecessors, (60), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 39 [2021-12-17 08:55:14,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:55:14,191 INFO L225 Difference]: With dead ends: 69 [2021-12-17 08:55:14,191 INFO L226 Difference]: Without dead ends: 61 [2021-12-17 08:55:14,192 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 67 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=294, Invalid=3752, Unknown=6, NotChecked=640, Total=4692 [2021-12-17 08:55:14,193 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 32 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 08:55:14,194 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 507 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 573 Invalid, 0 Unknown, 141 Unchecked, 0.3s Time] [2021-12-17 08:55:14,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-12-17 08:55:14,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2021-12-17 08:55:14,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.183673469387755) internal successors, (58), 49 states have internal predecessors, (58), 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) [2021-12-17 08:55:14,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2021-12-17 08:55:14,204 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 39 [2021-12-17 08:55:14,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:55:14,206 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2021-12-17 08:55:14,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 37 states have internal predecessors, (60), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 08:55:14,206 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2021-12-17 08:55:14,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-17 08:55:14,212 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:55:14,212 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:55:14,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-17 08:55:14,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:55:14,432 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:55:14,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:55:14,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1669816953, now seen corresponding path program 1 times [2021-12-17 08:55:14,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:55:14,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339240270] [2021-12-17 08:55:14,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:55:14,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:55:14,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:15,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 08:55:15,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:15,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 08:55:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:15,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 08:55:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:15,314 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 08:55:15,314 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:55:15,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339240270] [2021-12-17 08:55:15,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339240270] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:55:15,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019059030] [2021-12-17 08:55:15,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:55:15,315 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:55:15,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:55:15,316 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) [2021-12-17 08:55:15,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-17 08:55:15,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:15,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 180 conjunts are in the unsatisfiable core [2021-12-17 08:55:15,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:55:15,551 INFO L388 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 [2021-12-17 08:55:15,717 INFO L388 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 [2021-12-17 08:55:15,807 INFO L388 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 [2021-12-17 08:55:15,891 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-17 08:55:15,891 INFO L388 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 [2021-12-17 08:55:15,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-12-17 08:55:15,982 INFO L388 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 [2021-12-17 08:55:16,096 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 08:55:16,097 INFO L388 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 45 treesize of output 42 [2021-12-17 08:55:16,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-17 08:55:16,290 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 08:55:16,290 INFO L388 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 68 treesize of output 31 [2021-12-17 08:55:16,295 INFO L388 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 [2021-12-17 08:55:16,299 INFO L388 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 [2021-12-17 08:55:16,303 INFO L388 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 [2021-12-17 08:55:16,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:16,509 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 08:55:16,510 INFO L388 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 66 [2021-12-17 08:55:16,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:16,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-17 08:55:16,528 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-17 08:55:16,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2021-12-17 08:55:16,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:16,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-17 08:55:17,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:17,193 INFO L354 Elim1Store]: treesize reduction 121, result has 11.7 percent of original size [2021-12-17 08:55:17,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 567 treesize of output 324 [2021-12-17 08:55:17,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:17,259 INFO L354 Elim1Store]: treesize reduction 184, result has 18.2 percent of original size [2021-12-17 08:55:17,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 10 new quantified variables, introduced 13 case distinctions, treesize of input 423 treesize of output 375 [2021-12-17 08:55:17,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:17,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:17,294 INFO L354 Elim1Store]: treesize reduction 103, result has 16.3 percent of original size [2021-12-17 08:55:17,294 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 658 treesize of output 436 [2021-12-17 08:55:17,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:17,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:17,332 INFO L354 Elim1Store]: treesize reduction 100, result has 17.4 percent of original size [2021-12-17 08:55:17,332 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 7 case distinctions, treesize of input 514 treesize of output 499 [2021-12-17 08:55:17,348 INFO L388 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 129 treesize of output 125 [2021-12-17 08:55:17,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:17,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:17,376 INFO L388 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 33 treesize of output 37 [2021-12-17 08:55:17,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 21 treesize of output 19 [2021-12-17 08:55:17,414 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2021-12-17 08:55:17,425 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2021-12-17 08:55:17,439 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 21 treesize of output 19 [2021-12-17 08:55:17,450 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 32 treesize of output 31 [2021-12-17 08:55:17,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:17,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:17,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:17,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:17,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:17,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 65 [2021-12-17 08:55:17,483 INFO L388 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 31 [2021-12-17 08:55:17,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:17,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:17,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:17,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:17,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:17,521 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 37 [2021-12-17 08:55:17,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:17,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:17,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:17,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:17,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:17,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 41 [2021-12-17 08:55:17,554 INFO L388 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 9 treesize of output 7 [2021-12-17 08:55:17,593 INFO L354 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-12-17 08:55:17,594 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 481 treesize of output 314 [2021-12-17 08:55:17,605 INFO L354 Elim1Store]: treesize reduction 45, result has 8.2 percent of original size [2021-12-17 08:55:17,606 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 398 treesize of output 293 [2021-12-17 08:55:17,611 INFO L388 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 31 [2021-12-17 08:55:17,614 INFO L388 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 9 treesize of output 7 [2021-12-17 08:55:17,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:17,653 INFO L354 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-12-17 08:55:17,653 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 282 treesize of output 230 [2021-12-17 08:55:18,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:18,128 INFO L354 Elim1Store]: treesize reduction 64, result has 1.5 percent of original size [2021-12-17 08:55:18,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 5 case distinctions, treesize of input 272 treesize of output 144 [2021-12-17 08:55:18,223 INFO L354 Elim1Store]: treesize reduction 57, result has 6.6 percent of original size [2021-12-17 08:55:18,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 143 treesize of output 56 [2021-12-17 08:55:18,266 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:55:18,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:56:09,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019059030] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:56:09,554 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 08:56:09,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2021-12-17 08:56:09,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6262715] [2021-12-17 08:56:09,555 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 08:56:09,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-12-17 08:56:09,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:56:09,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-12-17 08:56:09,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=3689, Unknown=11, NotChecked=0, Total=3906 [2021-12-17 08:56:09,556 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 50 states, 46 states have (on average 1.434782608695652) internal successors, (66), 41 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 08:56:11,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:56:11,797 INFO L93 Difference]: Finished difference Result 81 states and 102 transitions. [2021-12-17 08:56:11,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-17 08:56:11,798 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 46 states have (on average 1.434782608695652) internal successors, (66), 41 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 41 [2021-12-17 08:56:11,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:56:11,799 INFO L225 Difference]: With dead ends: 81 [2021-12-17 08:56:11,799 INFO L226 Difference]: Without dead ends: 73 [2021-12-17 08:56:11,800 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 54.0s TimeCoverageRelationStatistics Valid=413, Invalid=6056, Unknown=11, NotChecked=0, Total=6480 [2021-12-17 08:56:11,800 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 100 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-17 08:56:11,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 889 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1158 Invalid, 0 Unknown, 42 Unchecked, 0.6s Time] [2021-12-17 08:56:11,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-12-17 08:56:11,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 60. [2021-12-17 08:56:11,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 51 states have internal predecessors, (60), 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) [2021-12-17 08:56:11,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2021-12-17 08:56:11,812 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 41 [2021-12-17 08:56:11,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:56:11,813 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2021-12-17 08:56:11,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 46 states have (on average 1.434782608695652) internal successors, (66), 41 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 08:56:11,813 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2021-12-17 08:56:11,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-17 08:56:11,815 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:56:11,815 INFO L514 BasicCegarLoop]: 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, 1, 1] [2021-12-17 08:56:11,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-17 08:56:12,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:56:12,034 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:56:12,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:56:12,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1397547449, now seen corresponding path program 2 times [2021-12-17 08:56:12,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:56:12,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184744307] [2021-12-17 08:56:12,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:56:12,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:56:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:56:12,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 08:56:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:56:12,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 08:56:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:56:12,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-17 08:56:12,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:56:13,007 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 08:56:13,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:56:13,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184744307] [2021-12-17 08:56:13,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184744307] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:56:13,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80552424] [2021-12-17 08:56:13,008 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 08:56:13,008 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:56:13,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:56:13,009 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 08:56:13,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-17 08:56:13,151 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 08:56:13,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 08:56:13,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 171 conjunts are in the unsatisfiable core [2021-12-17 08:56:13,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:56:13,167 INFO L388 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 [2021-12-17 08:56:13,200 INFO L388 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 [2021-12-17 08:56:13,285 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 08:56:13,285 INFO L388 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 1 case distinctions, treesize of input 12 treesize of output 14 [2021-12-17 08:56:13,348 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 08:56:13,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 08:56:13,424 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: line 329521 column 46: unknown constant v_#valid_BEFORE_CALL_20 [2021-12-17 08:56:13,424 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-17 08:56:13,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2021-12-17 08:56:13,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053785862] [2021-12-17 08:56:13,424 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-17 08:56:13,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-17 08:56:13,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:56:13,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-17 08:56:13,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=910, Unknown=0, NotChecked=0, Total=992 [2021-12-17 08:56:13,425 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand has 26 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 22 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 08:56:13,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 08:56:13,426 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=82, Invalid=910, Unknown=0, NotChecked=0, Total=992 [2021-12-17 08:56:13,427 INFO L933 BasicCegarLoop]: 1 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, 1 SdHoareTripleChecker+Invalid, 1 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 [2021-12-17 08:56:13,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 08:56:13,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-17 08:56:13,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:56:13,628 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@65e61890 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:455) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:103) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) 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) [2021-12-17 08:56:13,631 INFO L158 Benchmark]: Toolchain (without parser) took 69143.59ms. Allocated memory was 127.9MB in the beginning and 283.1MB in the end (delta: 155.2MB). Free memory was 95.5MB in the beginning and 219.4MB in the end (delta: -123.9MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. [2021-12-17 08:56:13,632 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 88.1MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 08:56:13,632 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.01ms. Allocated memory is still 127.9MB. Free memory was 95.5MB in the beginning and 94.2MB in the end (delta: 1.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-17 08:56:13,632 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.56ms. Allocated memory is still 127.9MB. Free memory was 94.2MB in the beginning and 92.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 08:56:13,632 INFO L158 Benchmark]: Boogie Preprocessor took 21.60ms. Allocated memory is still 127.9MB. Free memory was 91.6MB in the beginning and 90.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 08:56:13,632 INFO L158 Benchmark]: RCFGBuilder took 353.77ms. Allocated memory is still 127.9MB. Free memory was 90.0MB in the beginning and 74.7MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-17 08:56:13,632 INFO L158 Benchmark]: TraceAbstraction took 68408.78ms. Allocated memory was 127.9MB in the beginning and 283.1MB in the end (delta: 155.2MB). Free memory was 74.7MB in the beginning and 219.4MB in the end (delta: -144.7MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2021-12-17 08:56:13,633 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 88.1MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 318.01ms. Allocated memory is still 127.9MB. Free memory was 95.5MB in the beginning and 94.2MB in the end (delta: 1.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.56ms. Allocated memory is still 127.9MB. Free memory was 94.2MB in the beginning and 92.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.60ms. Allocated memory is still 127.9MB. Free memory was 91.6MB in the beginning and 90.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 353.77ms. Allocated memory is still 127.9MB. Free memory was 90.0MB in the beginning and 74.7MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 68408.78ms. Allocated memory was 127.9MB in the beginning and 283.1MB in the end (delta: 155.2MB). Free memory was 74.7MB in the beginning and 219.4MB in the end (delta: -144.7MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@65e61890 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@65e61890: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-17 08:56:13,655 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_append_unequal.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 d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 08:56:15,306 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 08:56:15,308 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 08:56:15,341 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 08:56:15,341 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 08:56:15,345 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 08:56:15,346 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 08:56:15,350 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 08:56:15,352 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 08:56:15,357 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 08:56:15,357 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 08:56:15,358 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 08:56:15,359 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 08:56:15,361 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 08:56:15,362 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 08:56:15,365 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 08:56:15,366 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 08:56:15,366 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 08:56:15,368 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 08:56:15,371 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 08:56:15,374 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 08:56:15,375 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 08:56:15,376 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 08:56:15,376 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 08:56:15,378 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 08:56:15,379 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 08:56:15,380 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 08:56:15,381 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 08:56:15,381 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 08:56:15,382 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 08:56:15,382 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 08:56:15,383 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 08:56:15,384 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 08:56:15,384 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 08:56:15,385 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 08:56:15,385 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 08:56:15,386 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 08:56:15,386 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 08:56:15,386 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 08:56:15,387 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 08:56:15,388 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 08:56:15,389 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-17 08:56:15,415 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 08:56:15,416 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 08:56:15,416 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 08:56:15,417 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 08:56:15,417 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 08:56:15,417 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 08:56:15,418 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 08:56:15,418 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 08:56:15,419 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 08:56:15,419 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 08:56:15,419 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 08:56:15,420 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 08:56:15,420 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 08:56:15,420 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 08:56:15,420 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 08:56:15,420 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 08:56:15,420 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-17 08:56:15,420 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-17 08:56:15,421 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-17 08:56:15,421 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 08:56:15,421 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 08:56:15,421 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 08:56:15,421 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 08:56:15,421 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 08:56:15,421 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 08:56:15,422 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 08:56:15,422 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 08:56:15,422 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 08:56:15,422 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 08:56:15,422 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 08:56:15,422 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-17 08:56:15,422 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-17 08:56:15,423 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 08:56:15,423 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 08:56:15,423 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 08:56:15,423 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 08:56:15,423 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-17 08:56:15,423 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 -> d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 [2021-12-17 08:56:15,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 08:56:15,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 08:56:15,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 08:56:15,705 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 08:56:15,706 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 08:56:15,707 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2021-12-17 08:56:15,753 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b68696fa/fbad3bf1a0b54763af08d0f2771520b0/FLAG9b6d88665 [2021-12-17 08:56:16,133 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 08:56:16,136 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2021-12-17 08:56:16,152 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b68696fa/fbad3bf1a0b54763af08d0f2771520b0/FLAG9b6d88665 [2021-12-17 08:56:16,497 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b68696fa/fbad3bf1a0b54763af08d0f2771520b0 [2021-12-17 08:56:16,502 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 08:56:16,504 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 08:56:16,505 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 08:56:16,505 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 08:56:16,508 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 08:56:16,509 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 08:56:16" (1/1) ... [2021-12-17 08:56:16,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f8fa61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:56:16, skipping insertion in model container [2021-12-17 08:56:16,511 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 08:56:16" (1/1) ... [2021-12-17 08:56:16,515 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 08:56:16,550 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 08:56:16,813 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_unequal.i[24587,24600] [2021-12-17 08:56:16,818 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 08:56:16,830 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 08:56:16,866 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_unequal.i[24587,24600] [2021-12-17 08:56:16,867 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 08:56:16,889 INFO L208 MainTranslator]: Completed translation [2021-12-17 08:56:16,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:56:16 WrapperNode [2021-12-17 08:56:16,890 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 08:56:16,891 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 08:56:16,891 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 08:56:16,891 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 08:56:16,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:56:16" (1/1) ... [2021-12-17 08:56:16,924 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:56:16" (1/1) ... [2021-12-17 08:56:16,949 INFO L137 Inliner]: procedures = 130, calls = 46, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 159 [2021-12-17 08:56:16,950 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 08:56:16,950 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 08:56:16,950 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 08:56:16,950 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 08:56:16,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:56:16" (1/1) ... [2021-12-17 08:56:16,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:56:16" (1/1) ... [2021-12-17 08:56:16,970 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:56:16" (1/1) ... [2021-12-17 08:56:16,970 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:56:16" (1/1) ... [2021-12-17 08:56:16,980 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:56:16" (1/1) ... [2021-12-17 08:56:16,988 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:56:16" (1/1) ... [2021-12-17 08:56:16,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:56:16" (1/1) ... [2021-12-17 08:56:16,999 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 08:56:17,003 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 08:56:17,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 08:56:17,005 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 08:56:17,005 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:56:16" (1/1) ... [2021-12-17 08:56:17,010 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 08:56:17,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:56:17,037 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) [2021-12-17 08:56:17,055 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 [2021-12-17 08:56:17,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-17 08:56:17,067 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-17 08:56:17,067 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-17 08:56:17,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-17 08:56:17,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 08:56:17,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 08:56:17,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-17 08:56:17,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-17 08:56:17,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 08:56:17,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-17 08:56:17,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-17 08:56:17,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-17 08:56:17,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 08:56:17,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 08:56:17,176 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 08:56:17,177 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 08:56:17,435 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 08:56:17,439 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 08:56:17,440 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-17 08:56:17,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 08:56:17 BoogieIcfgContainer [2021-12-17 08:56:17,441 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 08:56:17,442 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 08:56:17,442 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 08:56:17,445 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 08:56:17,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 08:56:16" (1/3) ... [2021-12-17 08:56:17,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39921575 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 08:56:17, skipping insertion in model container [2021-12-17 08:56:17,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:56:16" (2/3) ... [2021-12-17 08:56:17,446 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39921575 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 08:56:17, skipping insertion in model container [2021-12-17 08:56:17,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 08:56:17" (3/3) ... [2021-12-17 08:56:17,447 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal.i [2021-12-17 08:56:17,451 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 08:56:17,452 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 08:56:17,495 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 08:56:17,504 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 08:56:17,504 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 08:56:17,516 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 34 states have internal predecessors, (50), 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) [2021-12-17 08:56:17,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-17 08:56:17,520 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:56:17,520 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:56:17,521 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:56:17,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:56:17,525 INFO L85 PathProgramCache]: Analyzing trace with hash -2119803949, now seen corresponding path program 1 times [2021-12-17 08:56:17,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 08:56:17,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1724666571] [2021-12-17 08:56:17,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:56:17,537 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 08:56:17,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 08:56:17,539 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) [2021-12-17 08:56:17,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-17 08:56:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:56:17,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-17 08:56:17,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:56:17,758 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 08:56:17,758 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 08:56:17,759 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 08:56:17,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1724666571] [2021-12-17 08:56:17,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1724666571] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:56:17,760 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:56:17,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 08:56:17,768 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806236002] [2021-12-17 08:56:17,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:56:17,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 08:56:17,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 08:56:17,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 08:56:17,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 08:56:17,793 INFO L87 Difference]: Start difference. First operand has 39 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 34 states have internal predecessors, (50), 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 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 08:56:17,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:56:17,806 INFO L93 Difference]: Finished difference Result 71 states and 101 transitions. [2021-12-17 08:56:17,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 08:56:17,809 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2021-12-17 08:56:17,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:56:17,814 INFO L225 Difference]: With dead ends: 71 [2021-12-17 08:56:17,814 INFO L226 Difference]: Without dead ends: 31 [2021-12-17 08:56:17,816 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 08:56:17,818 INFO L933 BasicCegarLoop]: 50 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, 50 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 [2021-12-17 08:56:17,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 08:56:17,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-17 08:56:17,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2021-12-17 08:56:17,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 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) [2021-12-17 08:56:17,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2021-12-17 08:56:17,844 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 25 [2021-12-17 08:56:17,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:56:17,845 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2021-12-17 08:56:17,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 08:56:17,846 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2021-12-17 08:56:17,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-17 08:56:17,847 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:56:17,847 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:56:17,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-17 08:56:18,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 08:56:18,057 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:56:18,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:56:18,058 INFO L85 PathProgramCache]: Analyzing trace with hash -826043684, now seen corresponding path program 1 times [2021-12-17 08:56:18,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 08:56:18,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1454289628] [2021-12-17 08:56:18,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:56:18,059 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 08:56:18,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 08:56:18,060 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) [2021-12-17 08:56:18,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-17 08:56:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:56:18,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-17 08:56:18,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:56:18,218 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:56:18,219 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 08:56:18,219 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 08:56:18,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1454289628] [2021-12-17 08:56:18,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1454289628] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:56:18,219 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:56:18,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 08:56:18,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109381964] [2021-12-17 08:56:18,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:56:18,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 08:56:18,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 08:56:18,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 08:56:18,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 08:56:18,222 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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) [2021-12-17 08:56:18,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:56:18,238 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2021-12-17 08:56:18,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 08:56:18,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 26 [2021-12-17 08:56:18,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:56:18,239 INFO L225 Difference]: With dead ends: 58 [2021-12-17 08:56:18,239 INFO L226 Difference]: Without dead ends: 34 [2021-12-17 08:56:18,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 08:56:18,240 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 71 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 [2021-12-17 08:56:18,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 71 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 08:56:18,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-17 08:56:18,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2021-12-17 08:56:18,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 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) [2021-12-17 08:56:18,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2021-12-17 08:56:18,246 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 26 [2021-12-17 08:56:18,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:56:18,246 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2021-12-17 08:56:18,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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) [2021-12-17 08:56:18,246 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2021-12-17 08:56:18,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-17 08:56:18,247 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:56:18,247 INFO L514 BasicCegarLoop]: 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] [2021-12-17 08:56:18,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-17 08:56:18,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 08:56:18,461 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:56:18,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:56:18,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1959720012, now seen corresponding path program 1 times [2021-12-17 08:56:18,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 08:56:18,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1426599765] [2021-12-17 08:56:18,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:56:18,462 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 08:56:18,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 08:56:18,464 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) [2021-12-17 08:56:18,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-17 08:56:18,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:56:18,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-17 08:56:18,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:56:18,868 INFO L388 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 [2021-12-17 08:56:18,944 INFO L388 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 [2021-12-17 08:56:19,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:19,119 INFO L388 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 [2021-12-17 08:56:19,165 INFO L388 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 [2021-12-17 08:56:19,195 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 08:56:19,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:56:19,318 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 08:56:19,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1426599765] [2021-12-17 08:56:19,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1426599765] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:56:19,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [113983120] [2021-12-17 08:56:19,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:56:19,319 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-17 08:56:19,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-17 08:56:19,331 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) [2021-12-17 08:56:19,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2021-12-17 08:56:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:56:19,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-17 08:56:19,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:56:19,836 INFO L388 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 [2021-12-17 08:56:19,963 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-17 08:56:19,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2021-12-17 08:56:19,971 INFO L388 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 6 treesize of output 4 [2021-12-17 08:56:20,060 INFO L388 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 [2021-12-17 08:56:20,070 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 08:56:20,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:56:20,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [113983120] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:56:20,173 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 08:56:20,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2021-12-17 08:56:20,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992486976] [2021-12-17 08:56:20,173 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 08:56:20,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-17 08:56:20,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 08:56:20,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-17 08:56:20,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=448, Unknown=20, NotChecked=0, Total=552 [2021-12-17 08:56:20,175 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 22 states, 20 states have (on average 1.9) internal successors, (38), 17 states have internal predecessors, (38), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-17 08:56:20,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:56:20,457 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2021-12-17 08:56:20,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 08:56:20,458 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 1.9) internal successors, (38), 17 states have internal predecessors, (38), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 34 [2021-12-17 08:56:20,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:56:20,459 INFO L225 Difference]: With dead ends: 44 [2021-12-17 08:56:20,459 INFO L226 Difference]: Without dead ends: 33 [2021-12-17 08:56:20,460 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=614, Unknown=22, NotChecked=0, Total=756 [2021-12-17 08:56:20,461 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 17 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 08:56:20,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 196 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 104 Invalid, 0 Unknown, 30 Unchecked, 0.2s Time] [2021-12-17 08:56:20,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-12-17 08:56:20,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2021-12-17 08:56:20,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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) [2021-12-17 08:56:20,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2021-12-17 08:56:20,465 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 34 [2021-12-17 08:56:20,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:56:20,466 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2021-12-17 08:56:20,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 1.9) internal successors, (38), 17 states have internal predecessors, (38), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-17 08:56:20,466 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2021-12-17 08:56:20,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-17 08:56:20,467 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:56:20,467 INFO L514 BasicCegarLoop]: 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, 1, 1] [2021-12-17 08:56:20,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2021-12-17 08:56:20,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-17 08:56:20,880 WARN L452 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 [2021-12-17 08:56:20,881 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:56:20,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:56:20,882 INFO L85 PathProgramCache]: Analyzing trace with hash -158694653, now seen corresponding path program 1 times [2021-12-17 08:56:20,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 08:56:20,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [814499877] [2021-12-17 08:56:20,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:56:20,883 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 08:56:20,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 08:56:20,885 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) [2021-12-17 08:56:20,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-17 08:56:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:56:21,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 46 conjunts are in the unsatisfiable core [2021-12-17 08:56:21,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:56:21,172 INFO L388 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 [2021-12-17 08:56:21,452 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 08:56:21,453 INFO L388 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 [2021-12-17 08:56:21,505 INFO L388 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 [2021-12-17 08:56:21,594 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 08:56:21,594 INFO L388 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 42 treesize of output 41 [2021-12-17 08:56:21,600 INFO L388 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 [2021-12-17 08:56:21,725 INFO L354 Elim1Store]: treesize reduction 3, result has 81.3 percent of original size [2021-12-17 08:56:21,726 INFO L388 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 54 treesize of output 38 [2021-12-17 08:56:21,732 INFO L388 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 [2021-12-17 08:56:21,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-17 08:56:21,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:21,936 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 08:56:21,937 INFO L388 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 60 treesize of output 58 [2021-12-17 08:56:21,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:21,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 48 [2021-12-17 08:56:21,972 INFO L354 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2021-12-17 08:56:21,972 INFO L388 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 [2021-12-17 08:56:22,128 INFO L388 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 [2021-12-17 08:56:22,226 INFO L354 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2021-12-17 08:56:22,227 INFO L388 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 [2021-12-17 08:56:22,309 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:56:22,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:56:22,484 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 08:56:22,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [814499877] [2021-12-17 08:56:22,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [814499877] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:56:22,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1442389293] [2021-12-17 08:56:22,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:56:22,485 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-17 08:56:22,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-17 08:56:22,486 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) [2021-12-17 08:56:22,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2021-12-17 08:56:22,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:56:22,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 49 conjunts are in the unsatisfiable core [2021-12-17 08:56:22,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:56:23,242 INFO L388 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 [2021-12-17 08:56:25,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:25,488 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2021-12-17 08:56:26,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:26,159 INFO L354 Elim1Store]: treesize reduction 96, result has 13.5 percent of original size [2021-12-17 08:56:26,160 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 98 treesize of output 70 [2021-12-17 08:56:26,249 INFO L354 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2021-12-17 08:56:26,250 INFO L388 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 138 treesize of output 115 [2021-12-17 08:56:26,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:26,300 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-12-17 08:56:26,300 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 115 [2021-12-17 08:56:26,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:26,333 INFO L354 Elim1Store]: treesize reduction 9, result has 57.1 percent of original size [2021-12-17 08:56:26,333 INFO L388 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 129 treesize of output 118 [2021-12-17 08:56:26,341 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2021-12-17 08:56:26,378 INFO L388 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 14 treesize of output 13 [2021-12-17 08:56:26,413 INFO L354 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2021-12-17 08:56:26,413 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 52 [2021-12-17 08:56:26,426 INFO L388 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 9 treesize of output 3 [2021-12-17 08:56:26,498 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-17 08:56:26,498 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 37 [2021-12-17 08:56:26,827 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 08:56:26,827 INFO L388 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 130 treesize of output 61 [2021-12-17 08:56:26,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:26,835 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 35 [2021-12-17 08:56:26,943 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 08:56:26,943 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 08:56:26,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1442389293] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:56:26,943 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 08:56:26,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [21] total 41 [2021-12-17 08:56:26,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101061491] [2021-12-17 08:56:26,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:56:26,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-17 08:56:26,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 08:56:26,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-17 08:56:26,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1688, Unknown=15, NotChecked=0, Total=1892 [2021-12-17 08:56:26,945 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 21 states, 20 states have (on average 1.55) internal successors, (31), 18 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-17 08:56:29,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:56:29,371 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2021-12-17 08:56:29,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-17 08:56:29,371 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 18 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2021-12-17 08:56:29,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:56:29,372 INFO L225 Difference]: With dead ends: 52 [2021-12-17 08:56:29,372 INFO L226 Difference]: Without dead ends: 44 [2021-12-17 08:56:29,373 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=225, Invalid=2012, Unknown=19, NotChecked=0, Total=2256 [2021-12-17 08:56:29,374 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 13 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 08:56:29,374 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 224 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 103 Invalid, 0 Unknown, 103 Unchecked, 0.2s Time] [2021-12-17 08:56:29,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-12-17 08:56:29,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2021-12-17 08:56:29,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 38 states have internal predecessors, (44), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-17 08:56:29,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2021-12-17 08:56:29,379 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 37 [2021-12-17 08:56:29,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:56:29,383 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2021-12-17 08:56:29,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 18 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-17 08:56:29,384 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2021-12-17 08:56:29,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-17 08:56:29,385 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:56:29,385 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:56:29,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2021-12-17 08:56:29,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-12-17 08:56:29,795 WARN L452 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 [2021-12-17 08:56:29,795 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:56:29,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:56:29,796 INFO L85 PathProgramCache]: Analyzing trace with hash -2134977410, now seen corresponding path program 1 times [2021-12-17 08:56:29,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 08:56:29,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [31559449] [2021-12-17 08:56:29,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:56:29,797 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 08:56:29,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 08:56:29,798 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) [2021-12-17 08:56:29,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-17 08:56:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:56:30,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 45 conjunts are in the unsatisfiable core [2021-12-17 08:56:30,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:56:30,027 INFO L388 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 [2021-12-17 08:56:30,210 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 08:56:30,210 INFO L388 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 [2021-12-17 08:56:30,253 INFO L388 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 [2021-12-17 08:56:30,318 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 08:56:30,318 INFO L388 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 42 treesize of output 41 [2021-12-17 08:56:30,323 INFO L388 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 [2021-12-17 08:56:30,411 INFO L354 Elim1Store]: treesize reduction 3, result has 81.3 percent of original size [2021-12-17 08:56:30,412 INFO L388 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 54 treesize of output 38 [2021-12-17 08:56:30,417 INFO L388 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 [2021-12-17 08:56:30,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-17 08:56:30,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:30,612 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 08:56:30,613 INFO L388 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 60 treesize of output 58 [2021-12-17 08:56:30,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:30,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 48 [2021-12-17 08:56:30,645 INFO L354 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2021-12-17 08:56:30,646 INFO L388 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 [2021-12-17 08:56:30,762 INFO L388 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 [2021-12-17 08:56:30,855 INFO L354 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2021-12-17 08:56:30,856 INFO L388 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 [2021-12-17 08:56:30,934 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 08:56:30,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:56:31,121 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 08:56:31,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [31559449] [2021-12-17 08:56:31,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [31559449] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:56:31,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [233597212] [2021-12-17 08:56:31,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:56:31,122 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-17 08:56:31,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-17 08:56:31,123 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) [2021-12-17 08:56:31,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2021-12-17 08:56:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:56:31,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-17 08:56:31,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:56:31,475 INFO L388 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 [2021-12-17 08:56:31,826 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 08:56:31,826 INFO L388 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 [2021-12-17 08:56:31,935 INFO L388 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 [2021-12-17 08:56:32,057 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 08:56:32,057 INFO L388 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 [2021-12-17 08:56:32,295 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 08:56:32,295 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 28 [2021-12-17 08:56:32,301 INFO L388 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 [2021-12-17 08:56:32,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-17 08:56:32,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:32,580 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 08:56:32,581 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 55 [2021-12-17 08:56:32,601 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-17 08:56:32,602 INFO L388 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 [2021-12-17 08:56:32,651 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-17 08:56:32,652 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-17 08:56:32,658 INFO L388 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 [2021-12-17 08:56:33,105 INFO L354 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2021-12-17 08:56:33,105 INFO L388 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 31 [2021-12-17 08:56:33,218 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 08:56:33,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:56:33,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [233597212] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:56:33,431 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 08:56:33,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 37 [2021-12-17 08:56:33,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282681002] [2021-12-17 08:56:33,431 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 08:56:33,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-12-17 08:56:33,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 08:56:33,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-12-17 08:56:33,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1389, Unknown=13, NotChecked=0, Total=1560 [2021-12-17 08:56:33,433 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 37 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 28 states have internal predecessors, (51), 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) [2021-12-17 08:56:33,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:56:33,887 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2021-12-17 08:56:33,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-17 08:56:33,889 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 28 states have internal predecessors, (51), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 39 [2021-12-17 08:56:33,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:56:33,891 INFO L225 Difference]: With dead ends: 73 [2021-12-17 08:56:33,891 INFO L226 Difference]: Without dead ends: 59 [2021-12-17 08:56:33,907 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=197, Invalid=1681, Unknown=14, NotChecked=0, Total=1892 [2021-12-17 08:56:33,910 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 13 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 08:56:33,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 234 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 135 Invalid, 0 Unknown, 83 Unchecked, 0.2s Time] [2021-12-17 08:56:33,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-12-17 08:56:33,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-12-17 08:56:33,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 49 states have (on average 1.163265306122449) internal successors, (57), 50 states have internal predecessors, (57), 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) [2021-12-17 08:56:33,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2021-12-17 08:56:33,927 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 39 [2021-12-17 08:56:33,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:56:33,928 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2021-12-17 08:56:33,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 28 states have internal predecessors, (51), 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) [2021-12-17 08:56:33,929 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2021-12-17 08:56:33,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-17 08:56:33,935 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:56:33,935 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:56:33,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2021-12-17 08:56:34,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-17 08:56:34,349 WARN L452 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 [2021-12-17 08:56:34,349 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:56:34,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:56:34,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1887720382, now seen corresponding path program 1 times [2021-12-17 08:56:34,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 08:56:34,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1546583993] [2021-12-17 08:56:34,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:56:34,352 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 08:56:34,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 08:56:34,353 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) [2021-12-17 08:56:34,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-17 08:56:34,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:56:34,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 86 conjunts are in the unsatisfiable core [2021-12-17 08:56:34,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:56:34,608 INFO L388 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 [2021-12-17 08:56:34,621 INFO L388 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 [2021-12-17 08:56:34,730 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 08:56:34,730 INFO L388 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 [2021-12-17 08:56:34,815 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-17 08:56:34,913 INFO L354 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2021-12-17 08:56:34,914 INFO L388 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 29 treesize of output 46 [2021-12-17 08:56:35,015 INFO L388 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 [2021-12-17 08:56:35,027 INFO L388 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 [2021-12-17 08:56:35,113 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 08:56:35,115 INFO L388 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 50 treesize of output 47 [2021-12-17 08:56:35,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-17 08:56:35,278 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 08:56:35,278 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 40 [2021-12-17 08:56:35,285 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 08:56:35,290 INFO L388 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 28 treesize of output 22 [2021-12-17 08:56:35,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:35,444 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 08:56:35,444 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 71 [2021-12-17 08:56:35,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:35,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:35,453 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2021-12-17 08:56:35,480 INFO L354 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2021-12-17 08:56:35,480 INFO L388 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 45 treesize of output 49 [2021-12-17 08:56:36,301 INFO L354 Elim1Store]: treesize reduction 119, result has 15.6 percent of original size [2021-12-17 08:56:36,301 INFO L388 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 148 treesize of output 82 [2021-12-17 08:56:36,351 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-12-17 08:56:36,351 INFO L388 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 207 treesize of output 130 [2021-12-17 08:56:36,385 INFO L354 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2021-12-17 08:56:36,385 INFO L388 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 184 treesize of output 148 [2021-12-17 08:56:36,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:36,397 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2021-12-17 08:56:36,545 INFO L388 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 26 treesize of output 10 [2021-12-17 08:56:36,642 INFO L354 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2021-12-17 08:56:36,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 36 [2021-12-17 08:56:36,759 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 08:56:36,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:56:36,867 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_append_~last~1#1.offset| (_ BitVec 32)) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_657 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_664))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_657) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2021-12-17 08:56:38,562 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 08:56:38,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1546583993] [2021-12-17 08:56:38,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1546583993] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:56:38,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [928723645] [2021-12-17 08:56:38,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:56:38,563 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-17 08:56:38,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-17 08:56:38,565 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) [2021-12-17 08:56:38,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2021-12-17 08:56:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:56:38,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 72 conjunts are in the unsatisfiable core [2021-12-17 08:56:38,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:56:39,034 INFO L388 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 [2021-12-17 08:56:39,454 INFO L388 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 [2021-12-17 08:56:39,806 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 08:56:39,806 INFO L388 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 [2021-12-17 08:56:39,958 INFO L388 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 [2021-12-17 08:56:39,969 INFO L388 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 [2021-12-17 08:56:40,180 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 08:56:40,181 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 46 [2021-12-17 08:56:40,186 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-17 08:56:40,524 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-17 08:56:40,524 INFO L388 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 68 treesize of output 39 [2021-12-17 08:56:40,530 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 08:56:40,537 INFO L388 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 [2021-12-17 08:56:40,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:40,718 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 08:56:40,718 INFO L388 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 74 treesize of output 64 [2021-12-17 08:56:40,745 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-17 08:56:40,746 INFO L388 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 [2021-12-17 08:56:40,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:40,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:40,762 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2021-12-17 08:56:42,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:42,058 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-12-17 08:56:42,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 105 treesize of output 88 [2021-12-17 08:56:42,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:42,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:42,106 INFO L354 Elim1Store]: treesize reduction 54, result has 27.0 percent of original size [2021-12-17 08:56:42,106 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 66 [2021-12-17 08:56:42,426 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 08:56:42,426 INFO L388 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 46 treesize of output 26 [2021-12-17 08:56:42,601 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-17 08:56:42,601 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 29 [2021-12-17 08:56:42,850 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:56:42,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:56:42,890 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_754 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_755 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_756 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_757 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_757) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_756))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_755) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_754) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2021-12-17 08:56:44,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [928723645] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:56:44,675 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 08:56:44,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26] total 45 [2021-12-17 08:56:44,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486666102] [2021-12-17 08:56:44,676 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 08:56:44,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-17 08:56:44,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 08:56:44,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-17 08:56:44,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=2949, Unknown=23, NotChecked=222, Total=3422 [2021-12-17 08:56:44,677 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand has 45 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 34 states have internal predecessors, (55), 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) [2021-12-17 08:56:46,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:56:46,681 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2021-12-17 08:56:46,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-17 08:56:46,683 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 34 states have internal predecessors, (55), 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 39 [2021-12-17 08:56:46,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:56:46,684 INFO L225 Difference]: With dead ends: 78 [2021-12-17 08:56:46,684 INFO L226 Difference]: Without dead ends: 70 [2021-12-17 08:56:46,685 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1366 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=334, Invalid=4479, Unknown=25, NotChecked=274, Total=5112 [2021-12-17 08:56:46,685 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 13 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 08:56:46,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 567 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 162 Invalid, 0 Unknown, 149 Unchecked, 0.3s Time] [2021-12-17 08:56:46,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-12-17 08:56:46,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2021-12-17 08:56:46,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 53 states have (on average 1.150943396226415) internal successors, (61), 54 states have internal predecessors, (61), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 08:56:46,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2021-12-17 08:56:46,692 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 39 [2021-12-17 08:56:46,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:56:46,692 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2021-12-17 08:56:46,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 34 states have internal predecessors, (55), 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) [2021-12-17 08:56:46,692 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2021-12-17 08:56:46,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-17 08:56:46,693 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:56:46,693 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:56:46,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2021-12-17 08:56:46,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-17 08:56:47,093 WARN L452 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 [2021-12-17 08:56:47,094 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:56:47,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:56:47,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1669816953, now seen corresponding path program 1 times [2021-12-17 08:56:47,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 08:56:47,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1468383605] [2021-12-17 08:56:47,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:56:47,095 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 08:56:47,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 08:56:47,096 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 08:56:47,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-17 08:56:47,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:56:47,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 91 conjunts are in the unsatisfiable core [2021-12-17 08:56:47,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:56:47,382 INFO L388 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 [2021-12-17 08:56:47,398 INFO L388 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 [2021-12-17 08:56:47,490 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 08:56:47,490 INFO L388 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 [2021-12-17 08:56:47,595 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-17 08:56:47,661 INFO L388 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 [2021-12-17 08:56:47,763 INFO L354 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2021-12-17 08:56:47,764 INFO L388 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 29 treesize of output 46 [2021-12-17 08:56:47,852 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-12-17 08:56:47,891 INFO L388 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 [2021-12-17 08:56:48,013 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 08:56:48,014 INFO L388 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 60 treesize of output 55 [2021-12-17 08:56:48,020 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-12-17 08:56:48,029 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-17 08:56:48,212 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 08:56:48,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 40 [2021-12-17 08:56:48,219 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-17 08:56:48,226 INFO L388 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 28 treesize of output 22 [2021-12-17 08:56:48,232 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-17 08:56:48,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:48,452 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 08:56:48,452 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 71 [2021-12-17 08:56:48,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:48,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-17 08:56:48,487 INFO L354 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2021-12-17 08:56:48,487 INFO L388 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 45 treesize of output 49 [2021-12-17 08:56:48,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-17 08:56:49,303 INFO L354 Elim1Store]: treesize reduction 119, result has 15.6 percent of original size [2021-12-17 08:56:49,304 INFO L388 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 165 treesize of output 91 [2021-12-17 08:56:49,352 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-12-17 08:56:49,353 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 244 treesize of output 147 [2021-12-17 08:56:49,378 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-17 08:56:49,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 210 treesize of output 163 [2021-12-17 08:56:49,391 INFO L388 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 41 treesize of output 45 [2021-12-17 08:56:49,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:49,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2021-12-17 08:56:49,537 INFO L354 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2021-12-17 08:56:49,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 40 [2021-12-17 08:56:49,543 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 08:56:49,672 INFO L388 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 [2021-12-17 08:56:49,709 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 08:56:49,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:56:49,875 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_append_~last~1#1.offset| (_ BitVec 32)) (v_ArrVal_850 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_859 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_854 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_855 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_850) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_855) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_854) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32))))) is different from false [2021-12-17 08:56:49,943 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_850 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_19| (_ BitVec 32)) (v_ArrVal_859 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_854 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_855 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_850) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_855) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_19| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_19| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_854) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))))) is different from false [2021-12-17 08:56:49,994 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_850 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_19| (_ BitVec 32)) (v_ArrVal_859 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_854 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_855 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_850) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_855) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_19| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_19| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_854) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))))) is different from false [2021-12-17 08:56:50,029 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_850 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_19| (_ BitVec 32)) (v_ArrVal_859 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_854 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_855 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_850) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_855) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_19| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_19| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_854) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))))) is different from false [2021-12-17 08:56:50,422 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 08:56:50,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1468383605] [2021-12-17 08:56:50,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1468383605] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:56:50,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1322679416] [2021-12-17 08:56:50,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:56:50,423 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-17 08:56:50,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-17 08:56:50,424 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-17 08:56:50,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2021-12-17 08:56:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:56:50,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 86 conjunts are in the unsatisfiable core [2021-12-17 08:56:50,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:56:50,948 INFO L388 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 [2021-12-17 08:56:51,340 INFO L388 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 [2021-12-17 08:56:51,657 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 08:56:51,657 INFO L388 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 [2021-12-17 08:56:51,805 INFO L388 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 [2021-12-17 08:56:51,817 INFO L388 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 [2021-12-17 08:56:52,008 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 08:56:52,009 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 46 [2021-12-17 08:56:52,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-17 08:56:52,351 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-17 08:56:52,351 INFO L388 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 68 treesize of output 39 [2021-12-17 08:56:52,356 INFO L388 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 [2021-12-17 08:56:52,363 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 08:56:56,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:56,773 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-17 08:56:56,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 63 [2021-12-17 08:56:56,797 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-17 08:56:56,798 INFO L388 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 [2021-12-17 08:56:56,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:56,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:56,812 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2021-12-17 08:56:58,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:58,858 INFO L354 Elim1Store]: treesize reduction 195, result has 14.5 percent of original size [2021-12-17 08:56:58,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 13 case distinctions, treesize of input 172 treesize of output 100 [2021-12-17 08:56:58,913 INFO L354 Elim1Store]: treesize reduction 90, result has 15.1 percent of original size [2021-12-17 08:56:58,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 284 treesize of output 173 [2021-12-17 08:56:58,965 INFO L354 Elim1Store]: treesize reduction 114, result has 14.9 percent of original size [2021-12-17 08:56:58,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 214 treesize of output 179 [2021-12-17 08:56:59,554 INFO L354 Elim1Store]: treesize reduction 34, result has 8.1 percent of original size [2021-12-17 08:56:59,554 INFO L388 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 175 treesize of output 97 [2021-12-17 08:56:59,813 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-12-17 08:56:59,814 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 39 [2021-12-17 08:57:00,217 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:57:00,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:57:00,790 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_960 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_961 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_963 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_963))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_960) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_961))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))) .cse1))))) is different from false [2021-12-17 08:57:09,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1322679416] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:57:09,316 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 08:57:09,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 29] total 51 [2021-12-17 08:57:09,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603435868] [2021-12-17 08:57:09,316 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 08:57:09,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2021-12-17 08:57:09,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 08:57:09,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-12-17 08:57:09,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=4061, Unknown=22, NotChecked=660, Total=4970 [2021-12-17 08:57:09,318 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand has 51 states, 47 states have (on average 1.425531914893617) internal successors, (67), 40 states have internal predecessors, (67), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 08:57:18,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:57:18,878 INFO L93 Difference]: Finished difference Result 84 states and 99 transitions. [2021-12-17 08:57:18,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-17 08:57:18,878 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 47 states have (on average 1.425531914893617) internal successors, (67), 40 states have internal predecessors, (67), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 41 [2021-12-17 08:57:18,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:57:18,879 INFO L225 Difference]: With dead ends: 84 [2021-12-17 08:57:18,879 INFO L226 Difference]: Without dead ends: 76 [2021-12-17 08:57:18,881 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 91 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1555 ImplicationChecksByTransitivity, 23.7s TimeCoverageRelationStatistics Valid=401, Invalid=7253, Unknown=22, NotChecked=880, Total=8556 [2021-12-17 08:57:18,881 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 15 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 317 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 08:57:18,881 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 444 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 217 Invalid, 0 Unknown, 317 Unchecked, 0.3s Time] [2021-12-17 08:57:18,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-17 08:57:18,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2021-12-17 08:57:18,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 66 states have internal predecessors, (75), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 08:57:18,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2021-12-17 08:57:18,887 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 41 [2021-12-17 08:57:18,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:57:18,887 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2021-12-17 08:57:18,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 47 states have (on average 1.425531914893617) internal successors, (67), 40 states have internal predecessors, (67), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 08:57:18,888 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2021-12-17 08:57:18,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-17 08:57:18,888 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:57:18,888 INFO L514 BasicCegarLoop]: 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, 1, 1] [2021-12-17 08:57:18,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Ended with exit code 0 [2021-12-17 08:57:19,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-17 08:57:19,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 08:57:19,302 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:57:19,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:57:19,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1397547449, now seen corresponding path program 2 times [2021-12-17 08:57:19,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 08:57:19,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [173362746] [2021-12-17 08:57:19,303 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 08:57:19,303 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 08:57:19,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 08:57:19,305 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 08:57:19,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-17 08:57:19,590 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 08:57:19,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 08:57:19,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 73 conjunts are in the unsatisfiable core [2021-12-17 08:57:19,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:57:19,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:57:19,633 INFO L354 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-17 08:57:19,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 33 [2021-12-17 08:57:19,659 INFO L388 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 21 treesize of output 17 [2021-12-17 08:57:19,831 INFO L354 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2021-12-17 08:57:19,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 49 [2021-12-17 08:57:20,000 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-12-17 08:57:20,304 INFO L354 Elim1Store]: treesize reduction 45, result has 45.1 percent of original size [2021-12-17 08:57:20,304 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 65 [2021-12-17 08:57:20,434 INFO L388 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 [2021-12-17 08:57:20,454 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 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 [2021-12-17 08:57:20,616 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-12-17 08:57:20,617 INFO L388 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 1 case distinctions, treesize of input 99 treesize of output 65 [2021-12-17 08:57:20,621 INFO L388 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2021-12-17 08:57:20,916 INFO L354 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2021-12-17 08:57:20,917 INFO L388 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 159 treesize of output 81 [2021-12-17 08:57:20,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:57:20,933 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 08:57:20,933 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 10 [2021-12-17 08:57:20,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2021-12-17 08:57:21,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:57:21,312 INFO L354 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2021-12-17 08:57:21,313 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 165 treesize of output 123 [2021-12-17 08:57:21,358 INFO L354 Elim1Store]: treesize reduction 16, result has 64.4 percent of original size [2021-12-17 08:57:21,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 61 [2021-12-17 08:57:21,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:57:21,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:57:21,385 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 08:57:21,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 66 [2021-12-17 08:57:22,915 INFO L354 Elim1Store]: treesize reduction 108, result has 12.9 percent of original size [2021-12-17 08:57:22,915 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 219 treesize of output 113 [2021-12-17 08:57:22,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:57:22,980 INFO L354 Elim1Store]: treesize reduction 34, result has 17.1 percent of original size [2021-12-17 08:57:22,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 28 [2021-12-17 08:57:23,285 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:57:23,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:57:24,931 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 08:57:24,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [173362746] [2021-12-17 08:57:24,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [173362746] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:57:24,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1251836220] [2021-12-17 08:57:24,931 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 08:57:24,931 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-17 08:57:24,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-17 08:57:24,946 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-17 08:57:24,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2021-12-17 08:57:25,373 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 08:57:25,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 08:57:25,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 106 conjunts are in the unsatisfiable core [2021-12-17 08:57:25,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:57:25,514 INFO L388 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 [2021-12-17 08:57:26,038 INFO L388 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 [2021-12-17 08:57:26,212 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 08:57:26,212 INFO L388 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 [2021-12-17 08:57:26,388 INFO L388 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 [2021-12-17 08:57:26,403 INFO L388 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 [2021-12-17 08:57:26,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-12-17 08:57:26,606 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-17 08:57:26,607 INFO L388 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 [2021-12-17 08:57:26,612 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-17 08:57:26,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-17 08:57:26,938 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-12-17 08:57:26,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 48 [2021-12-17 08:57:26,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:57:26,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 08:57:26,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-17 08:57:26,961 INFO L388 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 [2021-12-17 08:57:29,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:57:29,394 INFO L354 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2021-12-17 08:57:29,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 108 treesize of output 83 [2021-12-17 08:57:29,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:57:29,411 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-17 08:57:29,438 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-17 08:57:29,439 INFO L388 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 [2021-12-17 08:57:29,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:57:29,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:57:29,457 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2021-12-17 08:57:31,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:57:31,972 INFO L354 Elim1Store]: treesize reduction 371, result has 9.5 percent of original size [2021-12-17 08:57:31,972 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 14 new quantified variables, introduced 26 case distinctions, treesize of input 351 treesize of output 162 [2021-12-17 08:57:31,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:57:32,019 INFO L354 Elim1Store]: treesize reduction 68, result has 13.9 percent of original size [2021-12-17 08:57:32,020 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 180 treesize of output 144 [2021-12-17 08:57:32,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:57:32,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:57:32,089 INFO L354 Elim1Store]: treesize reduction 117, result has 27.3 percent of original size [2021-12-17 08:57:32,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 117 treesize of output 115 [2021-12-17 08:57:32,098 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2021-12-17 08:57:32,107 INFO L388 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 28 [2021-12-17 08:57:32,114 INFO L388 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 [2021-12-17 08:57:32,502 INFO L354 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2021-12-17 08:57:32,503 INFO L388 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 1 case distinctions, treesize of input 42 treesize of output 26 [2021-12-17 08:57:32,807 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-12-17 08:57:32,808 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 38 [2021-12-17 08:57:33,198 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:57:33,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:57:33,800 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1151 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1152 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1155 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1156 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1157 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1154 (_ BitVec 32))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_1154)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1155))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1152) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1157) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1151) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1156) .cse0) (bvadd .cse1 (_ bv4 32)))) (not (= (select (select .cse2 .cse0) .cse1) .cse0)))))) is different from false [2021-12-17 08:57:42,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1251836220] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:57:42,194 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 08:57:42,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 29] total 50 [2021-12-17 08:57:42,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616562076] [2021-12-17 08:57:42,194 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 08:57:42,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-12-17 08:57:42,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 08:57:42,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-12-17 08:57:42,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=4270, Unknown=28, NotChecked=132, Total=4692 [2021-12-17 08:57:42,196 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand has 50 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 39 states have internal predecessors, (67), 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) [2021-12-17 08:57:57,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:57:57,189 INFO L93 Difference]: Finished difference Result 95 states and 109 transitions. [2021-12-17 08:57:57,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-17 08:57:57,190 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 39 states have internal predecessors, (67), 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 41 [2021-12-17 08:57:57,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:57:57,191 INFO L225 Difference]: With dead ends: 95 [2021-12-17 08:57:57,191 INFO L226 Difference]: Without dead ends: 81 [2021-12-17 08:57:57,193 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2034 ImplicationChecksByTransitivity, 30.6s TimeCoverageRelationStatistics Valid=491, Invalid=7668, Unknown=35, NotChecked=178, Total=8372 [2021-12-17 08:57:57,193 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 15 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 331 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 08:57:57,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 648 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 169 Invalid, 0 Unknown, 331 Unchecked, 0.4s Time] [2021-12-17 08:57:57,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-12-17 08:57:57,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2021-12-17 08:57:57,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 69 states have (on average 1.1304347826086956) internal successors, (78), 70 states have internal predecessors, (78), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 08:57:57,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2021-12-17 08:57:57,203 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 41 [2021-12-17 08:57:57,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:57:57,204 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2021-12-17 08:57:57,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 39 states have internal predecessors, (67), 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) [2021-12-17 08:57:57,204 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2021-12-17 08:57:57,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-17 08:57:57,205 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:57:57,205 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:57:57,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2021-12-17 08:57:57,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2021-12-17 08:57:57,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 08:57:57,618 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:57:57,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:57:57,618 INFO L85 PathProgramCache]: Analyzing trace with hash -508012196, now seen corresponding path program 1 times [2021-12-17 08:57:57,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 08:57:57,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1926173272] [2021-12-17 08:57:57,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:57:57,619 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 08:57:57,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 08:57:57,622 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 08:57:57,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-17 08:57:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:57:57,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-17 08:57:57,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:57:58,375 INFO L354 Elim1Store]: treesize reduction 40, result has 52.9 percent of original size [2021-12-17 08:57:58,376 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 145 treesize of output 118 [2021-12-17 08:57:58,381 INFO L354 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2021-12-17 08:57:58,381 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 119 treesize of output 61 [2021-12-17 08:57:58,419 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-17 08:57:58,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:57:58,790 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-17 08:57:58,790 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 08:57:58,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1926173272] [2021-12-17 08:57:58,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1926173272] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 08:57:58,790 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 08:57:58,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-12-17 08:57:58,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846581046] [2021-12-17 08:57:58,790 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 08:57:58,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-17 08:57:58,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 08:57:58,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-17 08:57:58,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2021-12-17 08:57:58,791 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-17 08:57:59,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:57:59,325 INFO L93 Difference]: Finished difference Result 117 states and 134 transitions. [2021-12-17 08:57:59,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-17 08:57:59,326 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2021-12-17 08:57:59,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:57:59,327 INFO L225 Difference]: With dead ends: 117 [2021-12-17 08:57:59,327 INFO L226 Difference]: Without dead ends: 112 [2021-12-17 08:57:59,327 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2021-12-17 08:57:59,327 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 15 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 08:57:59,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 190 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 29 Unchecked, 0.1s Time] [2021-12-17 08:57:59,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-12-17 08:57:59,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 102. [2021-12-17 08:57:59,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 90 states have (on average 1.2) internal successors, (108), 91 states have internal predecessors, (108), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 08:57:59,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 120 transitions. [2021-12-17 08:57:59,335 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 120 transitions. Word has length 46 [2021-12-17 08:57:59,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:57:59,336 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 120 transitions. [2021-12-17 08:57:59,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-17 08:57:59,336 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 120 transitions. [2021-12-17 08:57:59,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-17 08:57:59,336 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:57:59,337 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:57:59,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-17 08:57:59,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 08:57:59,547 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:57:59,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:57:59,547 INFO L85 PathProgramCache]: Analyzing trace with hash -507967494, now seen corresponding path program 1 times [2021-12-17 08:57:59,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 08:57:59,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2019500136] [2021-12-17 08:57:59,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:57:59,548 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 08:57:59,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 08:57:59,549 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 08:57:59,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-17 08:57:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:57:59,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 112 conjunts are in the unsatisfiable core [2021-12-17 08:57:59,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:57:59,916 INFO L388 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 [2021-12-17 08:57:59,933 INFO L388 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 [2021-12-17 08:58:00,006 INFO L388 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 [2021-12-17 08:58:00,115 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 08:58:00,116 INFO L388 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 [2021-12-17 08:58:00,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-17 08:58:00,252 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-17 08:58:00,434 INFO L354 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2021-12-17 08:58:00,434 INFO L388 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 29 treesize of output 46 [2021-12-17 08:58:00,467 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-17 08:58:00,574 INFO L388 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 [2021-12-17 08:58:00,588 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-17 08:58:00,601 INFO L388 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 [2021-12-17 08:58:00,729 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 08:58:00,729 INFO L388 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 84 treesize of output 75 [2021-12-17 08:58:00,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2021-12-17 08:58:00,740 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-17 08:58:00,944 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 08:58:00,945 INFO L388 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 92 treesize of output 47 [2021-12-17 08:58:00,957 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 08:58:00,963 INFO L388 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 28 treesize of output 22 [2021-12-17 08:58:00,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-17 08:58:01,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:58:01,212 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 08:58:01,213 INFO L388 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 98 treesize of output 80 [2021-12-17 08:58:01,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:58:01,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-17 08:58:01,257 INFO L354 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2021-12-17 08:58:01,257 INFO L388 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 45 treesize of output 49 [2021-12-17 08:58:01,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2021-12-17 08:58:02,451 INFO L354 Elim1Store]: treesize reduction 119, result has 15.6 percent of original size [2021-12-17 08:58:02,451 INFO L388 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 237 treesize of output 130 [2021-12-17 08:58:02,524 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-12-17 08:58:02,524 INFO L388 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 376 treesize of output 251 [2021-12-17 08:58:02,590 INFO L354 Elim1Store]: treesize reduction 112, result has 16.4 percent of original size [2021-12-17 08:58:02,591 INFO L388 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 7 new quantified variables, introduced 4 case distinctions, treesize of input 341 treesize of output 214 [2021-12-17 08:58:02,629 INFO L354 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2021-12-17 08:58:02,629 INFO L388 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 273 treesize of output 223 [2021-12-17 08:58:02,637 INFO L388 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 90 treesize of output 80 [2021-12-17 08:58:02,647 INFO L388 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 50 treesize of output 52 [2021-12-17 08:58:03,839 INFO L354 Elim1Store]: treesize reduction 41, result has 8.9 percent of original size [2021-12-17 08:58:03,839 INFO L388 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 65 [2021-12-17 08:58:03,854 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-17 08:58:03,854 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2021-12-17 08:58:03,992 INFO L388 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 [2021-12-17 08:58:04,047 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-17 08:58:04,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:58:04,391 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1331 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1343 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_1341 (_ BitVec 32)) (v_ArrVal_1339 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1343)) (.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1331))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_1341)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1339) (select (select .cse0 .cse1) .cse2)) (bvadd (select (select .cse3 .cse1) .cse2) (_ bv4 32))))))) is different from false [2021-12-17 08:58:11,448 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 08:58:11,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2019500136] [2021-12-17 08:58:11,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2019500136] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:58:11,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [980607877] [2021-12-17 08:58:11,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:58:11,449 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-17 08:58:11,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-17 08:58:11,450 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-17 08:58:11,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2021-12-17 08:58:11,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:58:11,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 99 conjunts are in the unsatisfiable core [2021-12-17 08:58:11,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:58:12,209 INFO L388 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 [2021-12-17 08:58:12,372 INFO L388 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 [2021-12-17 08:58:12,965 INFO L388 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 [2021-12-17 08:58:12,968 INFO L388 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 [2021-12-17 08:58:13,517 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 08:58:13,517 INFO L388 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 [2021-12-17 08:58:13,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-17 08:58:13,776 INFO L388 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 [2021-12-17 08:58:13,793 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-17 08:58:13,804 INFO L388 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 [2021-12-17 08:58:14,107 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 08:58:14,107 INFO L388 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 79 treesize of output 70 [2021-12-17 08:58:14,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2021-12-17 08:58:14,118 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-17 08:58:14,633 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-17 08:58:14,633 INFO L388 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 83 treesize of output 46 [2021-12-17 08:58:14,642 INFO L388 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 [2021-12-17 08:58:14,649 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 08:58:14,654 INFO L388 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 [2021-12-17 08:58:14,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:58:14,957 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 08:58:14,957 INFO L388 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 89 treesize of output 73 [2021-12-17 08:58:14,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:58:14,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-17 08:58:14,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:58:14,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:58:14,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:58:14,981 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2021-12-17 08:58:15,005 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-17 08:58:15,006 INFO L388 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 [2021-12-17 08:58:16,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:58:16,921 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-12-17 08:58:16,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 170 treesize of output 133 [2021-12-17 08:58:16,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:58:16,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:58:16,984 INFO L354 Elim1Store]: treesize reduction 54, result has 27.0 percent of original size [2021-12-17 08:58:16,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 104 [2021-12-17 08:58:16,992 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 08:58:16,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:58:16,995 INFO L388 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 66 treesize of output 56 [2021-12-17 08:58:17,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-17 08:58:21,020 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-17 08:58:21,020 INFO L388 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 54 [2021-12-17 08:58:21,037 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-17 08:58:21,038 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2021-12-17 08:58:21,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 08:58:21,336 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 08:58:21,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:58:21,388 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1445 (_ BitVec 32)) (v_ArrVal_1450 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1451 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1449 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1448 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1446) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1448)) (.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1451) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1449))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_1445)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1450) (select (select .cse0 .cse1) .cse2)) (bvadd (select (select .cse3 .cse1) .cse2) (_ bv4 32))))))) is different from false [2021-12-17 08:58:28,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [980607877] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:58:28,711 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 08:58:28,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 50 [2021-12-17 08:58:28,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121934020] [2021-12-17 08:58:28,711 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 08:58:28,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-12-17 08:58:28,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 08:58:28,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-12-17 08:58:28,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=3767, Unknown=36, NotChecked=250, Total=4290 [2021-12-17 08:58:28,713 INFO L87 Difference]: Start difference. First operand 102 states and 120 transitions. Second operand has 50 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 38 states have internal predecessors, (70), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 08:58:34,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:58:34,902 INFO L93 Difference]: Finished difference Result 113 states and 132 transitions. [2021-12-17 08:58:34,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-17 08:58:34,903 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 38 states have internal predecessors, (70), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2021-12-17 08:58:34,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:58:34,903 INFO L225 Difference]: With dead ends: 113 [2021-12-17 08:58:34,903 INFO L226 Difference]: Without dead ends: 111 [2021-12-17 08:58:34,905 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 76 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1187 ImplicationChecksByTransitivity, 26.6s TimeCoverageRelationStatistics Valid=320, Invalid=5352, Unknown=36, NotChecked=298, Total=6006 [2021-12-17 08:58:34,905 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 22 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 306 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 08:58:34,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 668 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 270 Invalid, 0 Unknown, 306 Unchecked, 0.4s Time] [2021-12-17 08:58:34,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-17 08:58:34,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2021-12-17 08:58:34,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 94 states have (on average 1.202127659574468) internal successors, (113), 95 states have internal predecessors, (113), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 08:58:34,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 125 transitions. [2021-12-17 08:58:34,913 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 125 transitions. Word has length 46 [2021-12-17 08:58:34,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:58:34,913 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 125 transitions. [2021-12-17 08:58:34,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 38 states have internal predecessors, (70), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 08:58:34,914 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 125 transitions. [2021-12-17 08:58:34,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-17 08:58:34,914 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:58:34,914 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:58:34,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-17 08:58:35,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2021-12-17 08:58:35,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-17 08:58:35,331 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:58:35,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:58:35,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1491699034, now seen corresponding path program 2 times [2021-12-17 08:58:35,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 08:58:35,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [321356187] [2021-12-17 08:58:35,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 08:58:35,332 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 08:58:35,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 08:58:35,333 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 08:58:35,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-17 08:58:35,525 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 08:58:35,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 08:58:35,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-17 08:58:35,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:58:35,605 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-17 08:58:35,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:58:35,685 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-12-17 08:58:35,685 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 08:58:35,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [321356187] [2021-12-17 08:58:35,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [321356187] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 08:58:35,685 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 08:58:35,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-12-17 08:58:35,685 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307408624] [2021-12-17 08:58:35,685 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 08:58:35,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 08:58:35,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 08:58:35,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 08:58:35,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-17 08:58:35,686 INFO L87 Difference]: Start difference. First operand 106 states and 125 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-17 08:58:35,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:58:35,714 INFO L93 Difference]: Finished difference Result 114 states and 135 transitions. [2021-12-17 08:58:35,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 08:58:35,715 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 47 [2021-12-17 08:58:35,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:58:35,715 INFO L225 Difference]: With dead ends: 114 [2021-12-17 08:58:35,715 INFO L226 Difference]: Without dead ends: 62 [2021-12-17 08:58:35,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-17 08:58:35,716 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 69 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 08:58:35,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 74 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 08:58:35,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-12-17 08:58:35,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-12-17 08:58:35,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 55 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 08:58:35,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2021-12-17 08:58:35,724 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 47 [2021-12-17 08:58:35,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:58:35,724 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2021-12-17 08:58:35,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-17 08:58:35,724 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2021-12-17 08:58:35,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-17 08:58:35,725 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:58:35,725 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:58:35,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-17 08:58:35,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 08:58:35,926 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:58:35,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:58:35,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1689040362, now seen corresponding path program 1 times [2021-12-17 08:58:35,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 08:58:35,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [600090201] [2021-12-17 08:58:35,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:58:35,926 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 08:58:35,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 08:58:35,927 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 08:58:35,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-17 08:58:36,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:58:36,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 107 conjunts are in the unsatisfiable core [2021-12-17 08:58:36,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:58:36,335 INFO L388 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 [2021-12-17 08:58:36,352 INFO L388 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 [2021-12-17 08:58:36,490 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 08:58:36,491 INFO L388 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 [2021-12-17 08:58:36,594 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-17 08:58:36,734 INFO L354 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2021-12-17 08:58:36,734 INFO L388 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 29 treesize of output 46 [2021-12-17 08:58:36,821 INFO L388 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 [2021-12-17 08:58:36,836 INFO L388 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 [2021-12-17 08:58:36,976 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 08:58:36,976 INFO L388 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 50 treesize of output 47 [2021-12-17 08:58:36,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-17 08:58:37,244 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 08:58:37,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 40 [2021-12-17 08:58:37,251 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 08:58:37,256 INFO L388 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 28 treesize of output 22 [2021-12-17 08:58:37,360 INFO L388 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 [2021-12-17 08:58:37,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:58:37,476 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 08:58:37,476 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 71 [2021-12-17 08:58:37,512 INFO L354 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2021-12-17 08:58:37,513 INFO L388 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 45 treesize of output 49 [2021-12-17 08:58:37,521 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2021-12-17 08:58:38,744 INFO L354 Elim1Store]: treesize reduction 123, result has 12.8 percent of original size [2021-12-17 08:58:38,744 INFO L388 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 213 treesize of output 114 [2021-12-17 08:58:38,827 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-12-17 08:58:38,828 INFO L388 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 351 treesize of output 230 [2021-12-17 08:58:38,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:58:38,858 INFO L388 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 102 treesize of output 51 [2021-12-17 08:58:38,868 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 08:58:38,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 212 treesize of output 154 [2021-12-17 08:58:38,927 INFO L354 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2021-12-17 08:58:38,927 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 179 treesize of output 154 [2021-12-17 08:58:38,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 58 [2021-12-17 08:58:41,120 INFO L354 Elim1Store]: treesize reduction 113, result has 8.9 percent of original size [2021-12-17 08:58:41,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 227 treesize of output 100 [2021-12-17 08:58:41,145 INFO L354 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2021-12-17 08:58:41,146 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 28 [2021-12-17 08:58:41,242 INFO L388 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 [2021-12-17 08:58:41,295 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-17 08:58:41,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:58:41,768 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1639 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1635 (_ BitVec 32)) (v_ArrVal_1642 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1634 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1639)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1634))) (let ((.cse5 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select .cse1 .cse5) .cse6)) (.cse3 (select (select .cse4 .cse5) .cse6))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1642))) (store .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_1635))) (select (select .cse1 .cse2) .cse3)) (bvadd (select (select .cse4 .cse2) .cse3) (_ bv4 32)))))))) is different from false [2021-12-17 08:58:46,171 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:58:46,172 INFO L388 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 1 case distinctions, treesize of input 1257 treesize of output 1250 [2021-12-17 08:58:46,245 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:58:46,245 INFO L388 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 13216 treesize of output 12626 [2021-12-17 08:58:46,283 INFO L388 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 14404 treesize of output 12036 [2021-12-17 08:58:49,947 INFO L388 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 2993 treesize of output 2401 [2021-12-17 08:59:02,459 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:59:02,460 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4781 treesize of output 4193 [2021-12-17 08:59:10,668 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 08:59:10,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [600090201] [2021-12-17 08:59:10,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [600090201] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:59:10,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1064666377] [2021-12-17 08:59:10,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:59:10,668 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-17 08:59:10,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-17 08:59:10,670 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-17 08:59:10,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2021-12-17 08:59:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:59:11,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 99 conjunts are in the unsatisfiable core [2021-12-17 08:59:11,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:59:11,452 INFO L388 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 [2021-12-17 08:59:12,140 INFO L388 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 [2021-12-17 08:59:12,673 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 08:59:12,674 INFO L388 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 [2021-12-17 08:59:12,895 INFO L388 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 [2021-12-17 08:59:12,909 INFO L388 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 [2021-12-17 08:59:13,164 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 08:59:13,164 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 46 [2021-12-17 08:59:13,169 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-17 08:59:13,665 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-17 08:59:13,665 INFO L388 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 68 treesize of output 39 [2021-12-17 08:59:13,673 INFO L388 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 [2021-12-17 08:59:13,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 08:59:13,881 INFO L388 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 [2021-12-17 08:59:13,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:59:13,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:59:13,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:59:13,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2021-12-17 08:59:14,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:59:14,016 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 08:59:14,016 INFO L388 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 74 treesize of output 64 [2021-12-17 08:59:14,042 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-17 08:59:14,042 INFO L388 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 [2021-12-17 08:59:16,135 INFO L354 Elim1Store]: treesize reduction 111, result has 14.0 percent of original size [2021-12-17 08:59:16,136 INFO L388 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 204 treesize of output 109 [2021-12-17 08:59:16,228 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-12-17 08:59:16,228 INFO L388 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 342 treesize of output 223 [2021-12-17 08:59:16,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:59:16,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 51 [2021-12-17 08:59:16,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:59:16,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:59:16,250 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 08:59:16,250 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 212 treesize of output 154 [2021-12-17 08:59:16,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:59:16,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:59:16,301 INFO L354 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2021-12-17 08:59:16,301 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 203 treesize of output 166 [2021-12-17 08:59:16,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 66 [2021-12-17 08:59:17,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:59:17,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:59:17,599 INFO L354 Elim1Store]: treesize reduction 110, result has 6.0 percent of original size [2021-12-17 08:59:17,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 241 treesize of output 132 [2021-12-17 08:59:18,127 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-12-17 08:59:18,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 39 [2021-12-17 08:59:18,538 INFO L388 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 [2021-12-17 08:59:18,542 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 08:59:18,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:59:19,158 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1743 (_ BitVec 32)) (v_ArrVal_1740 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1746 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1740)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1746))) (let ((.cse5 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select .cse1 .cse5) .cse6)) (.cse3 (select (select .cse4 .cse5) .cse6))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1739))) (store .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_1743))) (select (select .cse1 .cse2) .cse3)) (bvadd (select (select .cse4 .cse2) .cse3) (_ bv4 32)))))))) is different from false [2021-12-17 08:59:19,854 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:59:19,855 INFO L388 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 1 case distinctions, treesize of input 1257 treesize of output 1250 [2021-12-17 08:59:19,912 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:59:19,912 INFO L388 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 13216 treesize of output 12626 [2021-12-17 08:59:19,946 INFO L388 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 14404 treesize of output 12036 [2021-12-17 08:59:22,946 INFO L388 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 595 treesize of output 3 [2021-12-17 08:59:23,630 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:59:23,630 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 5380 treesize of output 6578 [2021-12-17 09:00:00,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1064666377] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:00:00,597 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:00:00,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 30] total 50 [2021-12-17 09:00:00,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965543549] [2021-12-17 09:00:00,597 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:00:00,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-12-17 09:00:00,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:00:00,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-12-17 09:00:00,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=3682, Unknown=14, NotChecked=246, Total=4160 [2021-12-17 09:00:00,599 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 50 states, 46 states have (on average 1.608695652173913) internal successors, (74), 39 states have internal predecessors, (74), 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) [2021-12-17 09:00:04,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:00:04,347 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2021-12-17 09:00:04,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-12-17 09:00:04,348 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 46 states have (on average 1.608695652173913) internal successors, (74), 39 states have internal predecessors, (74), 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 49 [2021-12-17 09:00:04,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:00:04,348 INFO L225 Difference]: With dead ends: 78 [2021-12-17 09:00:04,348 INFO L226 Difference]: Without dead ends: 76 [2021-12-17 09:00:04,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 78 SyntacticMatches, 7 SemanticMatches, 75 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1536 ImplicationChecksByTransitivity, 24.0s TimeCoverageRelationStatistics Valid=317, Invalid=5227, Unknown=14, NotChecked=294, Total=5852 [2021-12-17 09:00:04,350 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 228 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 09:00:04,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 282 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 167 Invalid, 0 Unknown, 228 Unchecked, 0.3s Time] [2021-12-17 09:00:04,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-17 09:00:04,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2021-12-17 09:00:04,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 66 states have (on average 1.1666666666666667) internal successors, (77), 66 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 09:00:04,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2021-12-17 09:00:04,358 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 49 [2021-12-17 09:00:04,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:00:04,358 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2021-12-17 09:00:04,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 46 states have (on average 1.608695652173913) internal successors, (74), 39 states have internal predecessors, (74), 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) [2021-12-17 09:00:04,358 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2021-12-17 09:00:04,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-17 09:00:04,358 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:00:04,358 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:00:04,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Ended with exit code 0 [2021-12-17 09:00:04,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2021-12-17 09:00:04,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-17 09:00:04,759 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:00:04,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:00:04,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1688995660, now seen corresponding path program 2 times [2021-12-17 09:00:04,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:00:04,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [932861879] [2021-12-17 09:00:04,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 09:00:04,760 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:00:04,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:00:04,761 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 09:00:04,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-17 09:00:05,035 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 09:00:05,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:00:05,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-17 09:00:05,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:00:05,375 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:00:05,375 INFO L388 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 125 treesize of output 98 [2021-12-17 09:00:05,410 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 09:00:05,410 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 85 [2021-12-17 09:00:05,467 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-17 09:00:05,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:00:05,716 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-17 09:00:05,716 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:00:05,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [932861879] [2021-12-17 09:00:05,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [932861879] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:00:05,717 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:00:05,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-12-17 09:00:05,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050614279] [2021-12-17 09:00:05,717 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:00:05,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 09:00:05,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:00:05,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 09:00:05,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-12-17 09:00:05,718 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-17 09:00:05,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:00:05,923 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2021-12-17 09:00:05,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 09:00:05,923 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2021-12-17 09:00:05,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:00:05,924 INFO L225 Difference]: With dead ends: 81 [2021-12-17 09:00:05,924 INFO L226 Difference]: Without dead ends: 73 [2021-12-17 09:00:05,924 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-12-17 09:00:05,925 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 09:00:05,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 158 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 26 Unchecked, 0.2s Time] [2021-12-17 09:00:05,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-12-17 09:00:05,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2021-12-17 09:00:05,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 64 states have (on average 1.140625) internal successors, (73), 64 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 09:00:05,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2021-12-17 09:00:05,932 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 49 [2021-12-17 09:00:05,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:00:05,932 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2021-12-17 09:00:05,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-17 09:00:05,933 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2021-12-17 09:00:05,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-17 09:00:05,933 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:00:05,933 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:00:05,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-12-17 09:00:06,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 09:00:06,144 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:00:06,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:00:06,145 INFO L85 PathProgramCache]: Analyzing trace with hash -820642385, now seen corresponding path program 1 times [2021-12-17 09:00:06,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:00:06,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1255953627] [2021-12-17 09:00:06,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:00:06,145 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:00:06,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:00:06,147 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 09:00:06,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-12-17 09:00:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:00:06,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 09:00:06,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:00:06,427 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-17 09:00:06,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:00:06,529 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-17 09:00:06,529 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:00:06,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1255953627] [2021-12-17 09:00:06,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1255953627] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:00:06,529 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:00:06,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-12-17 09:00:06,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047348739] [2021-12-17 09:00:06,530 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:00:06,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 09:00:06,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:00:06,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 09:00:06,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-17 09:00:06,531 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-17 09:00:06,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:00:06,604 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2021-12-17 09:00:06,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 09:00:06,605 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2021-12-17 09:00:06,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:00:06,605 INFO L225 Difference]: With dead ends: 90 [2021-12-17 09:00:06,606 INFO L226 Difference]: Without dead ends: 79 [2021-12-17 09:00:06,606 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-17 09:00:06,607 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 44 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 09:00:06,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 338 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 09:00:06,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-12-17 09:00:06,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2021-12-17 09:00:06,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 56 states have (on average 1.125) internal successors, (63), 56 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 09:00:06,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2021-12-17 09:00:06,614 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 50 [2021-12-17 09:00:06,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:00:06,615 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2021-12-17 09:00:06,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-17 09:00:06,615 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2021-12-17 09:00:06,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-17 09:00:06,615 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:00:06,615 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:00:06,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2021-12-17 09:00:06,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 09:00:06,820 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:00:06,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:00:06,821 INFO L85 PathProgramCache]: Analyzing trace with hash 728504751, now seen corresponding path program 3 times [2021-12-17 09:00:06,821 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 09:00:06,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1473301885] [2021-12-17 09:00:06,821 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 09:00:06,821 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 09:00:06,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 09:00:06,822 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 09:00:06,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-12-17 09:00:07,634 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-17 09:00:07,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:00:07,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 120 conjunts are in the unsatisfiable core [2021-12-17 09:00:07,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:00:07,671 INFO L388 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 [2021-12-17 09:00:07,693 INFO L388 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 [2021-12-17 09:00:07,825 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 09:00:07,825 INFO L388 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 [2021-12-17 09:00:07,941 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-17 09:00:08,061 INFO L354 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2021-12-17 09:00:08,061 INFO L388 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 29 treesize of output 46 [2021-12-17 09:00:08,165 INFO L388 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 [2021-12-17 09:00:08,172 INFO L388 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 [2021-12-17 09:00:08,308 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 09:00:08,309 INFO L388 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 50 treesize of output 47 [2021-12-17 09:00:08,314 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-17 09:00:08,514 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-17 09:00:08,515 INFO L388 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 40 [2021-12-17 09:00:08,522 INFO L388 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 28 treesize of output 22 [2021-12-17 09:00:08,527 INFO L388 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 15 treesize of output 7 [2021-12-17 09:00:12,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:00:12,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:00:12,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:00:12,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:00:12,784 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 41 [2021-12-17 09:00:12,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:00:12,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:00:12,809 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-17 09:00:12,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 66 [2021-12-17 09:00:12,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:00:12,847 INFO L354 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2021-12-17 09:00:12,848 INFO L388 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 45 treesize of output 49 [2021-12-17 09:00:14,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:00:14,830 INFO L354 Elim1Store]: treesize reduction 117, result has 14.6 percent of original size [2021-12-17 09:00:14,830 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 642 treesize of output 379 [2021-12-17 09:00:14,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:00:15,065 INFO L354 Elim1Store]: treesize reduction 184, result has 18.2 percent of original size [2021-12-17 09:00:15,065 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 10 new quantified variables, introduced 13 case distinctions, treesize of input 500 treesize of output 436 [2021-12-17 09:00:15,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:00:15,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:00:15,209 INFO L354 Elim1Store]: treesize reduction 315, result has 16.4 percent of original size [2021-12-17 09:00:15,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 657 treesize of output 365 [2021-12-17 09:00:15,240 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 21 treesize of output 19 [2021-12-17 09:00:15,255 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2021-12-17 09:00:15,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 54 treesize of output 39 [2021-12-17 09:00:15,314 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-12-17 09:00:15,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:00:15,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:00:15,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:00:15,509 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 41 [2021-12-17 09:00:15,524 INFO L388 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 9 treesize of output 7 [2021-12-17 09:00:15,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:00:15,551 INFO L354 Elim1Store]: treesize reduction 98, result has 3.0 percent of original size [2021-12-17 09:00:15,552 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 8 case distinctions, treesize of input 551 treesize of output 306 [2021-12-17 09:00:15,606 INFO L354 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-12-17 09:00:15,606 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 336 treesize of output 215 [2021-12-17 09:00:15,618 INFO L354 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-12-17 09:00:15,619 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 269 treesize of output 154 [2021-12-17 09:00:15,630 INFO L388 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 25 treesize of output 23 [2021-12-17 09:00:15,643 INFO L388 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 25 treesize of output 23 [2021-12-17 09:00:17,262 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-17 09:00:17,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:01:29,919 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 09:01:29,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1473301885] [2021-12-17 09:01:29,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1473301885] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:01:29,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1804392504] [2021-12-17 09:01:29,920 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 09:01:29,920 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-17 09:01:29,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-17 09:01:29,922 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-17 09:01:29,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2021-12-17 09:01:30,776 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-17 09:01:30,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:01:30,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 109 conjunts are in the unsatisfiable core [2021-12-17 09:01:30,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:01:31,359 INFO L388 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 [2021-12-17 09:01:32,973 INFO L388 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 [2021-12-17 09:01:33,985 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 09:01:33,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2021-12-17 09:01:34,433 INFO L388 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 [2021-12-17 09:01:34,451 INFO L388 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 [2021-12-17 09:01:34,953 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 09:01:34,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 46 [2021-12-17 09:01:34,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-17 09:01:35,830 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-17 09:01:35,830 INFO L388 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 76 treesize of output 43 [2021-12-17 09:01:35,837 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-17 09:01:35,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 09:01:41,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:01:41,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:01:41,177 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-17 09:01:41,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 69 [2021-12-17 09:01:41,212 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-17 09:01:41,213 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 37 [2021-12-17 09:01:41,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:01:41,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:01:41,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2021-12-17 09:01:44,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:01:45,220 INFO L354 Elim1Store]: treesize reduction 117, result has 14.6 percent of original size [2021-12-17 09:01:45,221 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 520 treesize of output 285 [2021-12-17 09:01:45,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:01:45,509 INFO L354 Elim1Store]: treesize reduction 192, result has 17.6 percent of original size [2021-12-17 09:01:45,509 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 10 new quantified variables, introduced 13 case distinctions, treesize of input 378 treesize of output 342 [2021-12-17 09:01:45,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:01:45,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:01:45,651 INFO L354 Elim1Store]: treesize reduction 103, result has 16.3 percent of original size [2021-12-17 09:01:45,651 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 648 treesize of output 424 [2021-12-17 09:01:45,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:01:45,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:01:45,763 INFO L354 Elim1Store]: treesize reduction 104, result has 16.8 percent of original size [2021-12-17 09:01:45,764 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 7 case distinctions, treesize of input 504 treesize of output 487 [2021-12-17 09:01:45,784 INFO L388 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 21 treesize of output 17 [2021-12-17 09:01:45,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 21 treesize of output 19 [2021-12-17 09:01:45,837 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 150 treesize of output 132 [2021-12-17 09:01:45,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 114 treesize of output 110 [2021-12-17 09:01:45,912 INFO L388 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 32 treesize of output 31 [2021-12-17 09:01:45,928 INFO L388 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 77 treesize of output 73 [2021-12-17 09:01:45,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 75 [2021-12-17 09:01:45,981 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 107 [2021-12-17 09:01:46,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:01:46,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:01:46,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:01:46,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 41 [2021-12-17 09:01:46,059 INFO L388 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 9 treesize of output 7 [2021-12-17 09:01:46,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:01:46,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:01:46,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:01:46,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 69 [2021-12-17 09:01:46,114 INFO L388 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 37 treesize of output 35 [2021-12-17 09:01:46,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:01:46,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:01:46,239 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 311 treesize of output 241 [2021-12-17 09:01:46,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:01:46,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:01:46,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:01:46,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:01:46,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:01:46,299 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 41 [2021-12-17 09:01:46,307 INFO L388 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 9 treesize of output 7 [2021-12-17 09:01:46,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:01:46,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:01:46,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:01:46,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:01:46,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 09:01:46,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 69 [2021-12-17 09:01:46,337 INFO L388 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 37 treesize of output 35 [2021-12-17 09:01:46,371 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-12-17 09:01:46,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 244 treesize of output 152 [2021-12-17 09:01:50,801 INFO L354 Elim1Store]: treesize reduction 80, result has 16.7 percent of original size [2021-12-17 09:01:50,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 220 treesize of output 95 [2021-12-17 09:01:51,519 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 09:01:51,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:03:39,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1804392504] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:03:39,762 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 09:03:39,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 31] total 55 [2021-12-17 09:03:39,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215321399] [2021-12-17 09:03:39,762 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 09:03:39,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2021-12-17 09:03:39,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 09:03:39,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-12-17 09:03:39,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=6295, Unknown=88, NotChecked=0, Total=6806 [2021-12-17 09:03:39,764 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 55 states, 51 states have (on average 1.392156862745098) internal successors, (71), 44 states have internal predecessors, (71), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 09:03:50,390 WARN L227 SmtUtils]: Spent 8.10s on a formula simplification. DAG size of input: 49 DAG size of output: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 09:04:01,970 WARN L227 SmtUtils]: Spent 8.12s on a formula simplification. DAG size of input: 53 DAG size of output: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 09:04:09,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:04:09,606 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2021-12-17 09:04:09,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-17 09:04:09,606 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 51 states have (on average 1.392156862745098) internal successors, (71), 44 states have internal predecessors, (71), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 51 [2021-12-17 09:04:09,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:04:09,606 INFO L225 Difference]: With dead ends: 63 [2021-12-17 09:04:09,606 INFO L226 Difference]: Without dead ends: 0 [2021-12-17 09:04:09,607 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3125 ImplicationChecksByTransitivity, 176.3s TimeCoverageRelationStatistics Valid=623, Invalid=9387, Unknown=90, NotChecked=0, Total=10100 [2021-12-17 09:04:09,608 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 10 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 151 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 09:04:09,608 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 166 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 142 Invalid, 0 Unknown, 151 Unchecked, 0.3s Time] [2021-12-17 09:04:09,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-17 09:04:09,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-17 09:04:09,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:04:09,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-17 09:04:09,608 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2021-12-17 09:04:09,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:04:09,608 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-17 09:04:09,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 51 states have (on average 1.392156862745098) internal successors, (71), 44 states have internal predecessors, (71), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 09:04:09,609 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-17 09:04:09,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-17 09:04:09,611 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 09:04:09,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2021-12-17 09:04:09,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-12-17 09:04:10,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 09:04:10,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-17 09:04:29,687 WARN L227 SmtUtils]: Spent 18.99s on a formula simplification. DAG size of input: 239 DAG size of output: 151 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2021-12-17 09:04:34,257 INFO L858 garLoopResultBuilder]: For program point L613-4(lines 613 615) no Hoare annotation was computed. [2021-12-17 09:04:34,257 INFO L858 garLoopResultBuilder]: For program point L639(lines 639 641) no Hoare annotation was computed. [2021-12-17 09:04:34,258 INFO L858 garLoopResultBuilder]: For program point L606(lines 606 619) no Hoare annotation was computed. [2021-12-17 09:04:34,258 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-17 09:04:34,258 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-17 09:04:34,258 INFO L861 garLoopResultBuilder]: At program point L598-2(lines 598 602) the Hoare annotation is: true [2021-12-17 09:04:34,258 INFO L858 garLoopResultBuilder]: For program point L598-3(lines 598 602) no Hoare annotation was computed. [2021-12-17 09:04:34,258 INFO L854 garLoopResultBuilder]: At program point L607(line 607) the Hoare annotation is: (let ((.cse4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse7 (_ bv0 32))) (.cse5 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_#res#1.base|) (_ bv0 32))) (.cse2 (select (select |#memory_$Pointer$.base| .cse1) (_ bv0 32))) (.cse3 (select (select |#memory_$Pointer$.base| .cse4) (_ bv0 32))) (.cse6 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (not (= (_ bv2 32) .cse0)) (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32)) (not (= .cse0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1|) (bvult .cse0 |#StackHeapBarrier|) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (_ bv1 1))) (not (= .cse0 (_ bv1 32))) (= (select (select |#memory_int| .cse1) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1|) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_#res#1.base|)) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (_ bv1 1))) (not (= (_ bv2 32) |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.base| .cse2) (_ bv0 32)) .cse1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= (_ bv0 32) .cse3)) (= |ULTIMATE.start_sll_circular_append_~data#1| |ULTIMATE.start_main_~uneq~0#1|) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| (_ bv2 32))))) (_ bv1 1))) (not (= |ULTIMATE.start_sll_circular_create_#res#1.base| (_ bv1 32))) (= |ULTIMATE.start_main_~uneq~0#1| (_ bv5 32)) (= |ULTIMATE.start_main_~len~0#1| (_ bv2 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_sll_circular_create_~len#1| (_ bv1 32)) (not (= (_ bv0 32) |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (not (= (_ bv0 32) |ULTIMATE.start_sll_circular_create_#res#1.base|)) (not (= (_ bv0 32) |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (not (= (_ bv2 32) |ULTIMATE.start_sll_circular_create_#res#1.base|)) (not (= (_ bv0 32) .cse0)) (not (= (_ bv2 32) |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (not (= (_ bv2 32) .cse3)) (= (select (select |#memory_$Pointer$.offset| .cse1) (_ bv0 32)) (_ bv0 32)) (bvult |ULTIMATE.start_sll_circular_create_~last~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| (_ bv0 32)) (not (= (_ bv2 32) .cse4)) (= (_ bv0 32) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_#res#1.base|) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1|) (not (= .cse3 .cse4)) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| (_ bv1 32))))) (_ bv1 1))) (not (= .cse3 (_ bv1 32))) (= (select (select |#memory_$Pointer$.offset| .cse0) .cse5) (_ bv0 32)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| .cse2))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| .cse1)) (_ bv1 1))) (bvult .cse2 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_append_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= (_ bv0 32) .cse1)) (= .cse5 (_ bv0 32)) (= (select (select |#memory_int| .cse0) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1|) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select (select |#memory_$Pointer$.base| .cse0) .cse5) |ULTIMATE.start_sll_circular_create_#res#1.base|) (= .cse6 (_ bv0 32)) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse4 (_ bv1 32))) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (_ bv1 32))) (= (_ bv0 32) |ULTIMATE.start_sll_circular_append_~head#1.offset|) (bvult |ULTIMATE.start_sll_circular_create_#res#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (_ bv1 32))) (bvult |ULTIMATE.start_sll_circular_create_~head~0#1.base| |#StackHeapBarrier|) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| (select .cse7 |ULTIMATE.start_sll_circular_create_#res#1.offset|)))) (_ bv1 1))) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1|) (= (select (select |#memory_int| .cse2) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1|) (bvult .cse1 |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| .cse3) (select (select |#memory_$Pointer$.offset| .cse4) (_ bv0 32))) (_ bv0 32)) (= .cse6 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))) [2021-12-17 09:04:34,258 INFO L858 garLoopResultBuilder]: For program point L607-1(line 607) no Hoare annotation was computed. [2021-12-17 09:04:34,258 INFO L858 garLoopResultBuilder]: For program point L632(lines 632 638) no Hoare annotation was computed. [2021-12-17 09:04:34,258 INFO L858 garLoopResultBuilder]: For program point L632-2(lines 620 650) no Hoare annotation was computed. [2021-12-17 09:04:34,258 INFO L858 garLoopResultBuilder]: For program point L632-3(lines 632 638) no Hoare annotation was computed. [2021-12-17 09:04:34,258 INFO L861 garLoopResultBuilder]: At program point L649(lines 620 650) the Hoare annotation is: true [2021-12-17 09:04:34,258 INFO L858 garLoopResultBuilder]: For program point L608(lines 608 618) no Hoare annotation was computed. [2021-12-17 09:04:34,258 INFO L858 garLoopResultBuilder]: For program point L633(lines 633 635) no Hoare annotation was computed. [2021-12-17 09:04:34,258 INFO L854 garLoopResultBuilder]: At program point L584(line 584) the Hoare annotation is: (and (= |ULTIMATE.start_sll_circular_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (_ bv1 1))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult (_ bv0 32) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~len~0#1| (_ bv2 32)) (= (_ bv0 1) (bvadd (select |#valid| (_ bv2 32)) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| (_ bv1 32)) (_ bv1 1))) (= |ULTIMATE.start_sll_circular_create_~len#1| (_ bv2 32)) (= (_ bv0 32) |ULTIMATE.start_main_~#s~0#1.offset|)) [2021-12-17 09:04:34,258 INFO L858 garLoopResultBuilder]: For program point L584-1(line 584) no Hoare annotation was computed. [2021-12-17 09:04:34,259 INFO L854 garLoopResultBuilder]: At program point L593(lines 583 594) the Hoare annotation is: (let ((.cse2 (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|))) (let ((.cse1 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_#res#1.base|) (_ bv0 32))) (.cse0 (select .cse2 (_ bv0 32)))) (and (not (= (_ bv2 32) .cse0)) (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32)) (not (= .cse0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) (bvult |ULTIMATE.start_sll_circular_create_~last~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| (_ bv0 32)) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1|) (bvult .cse0 |#StackHeapBarrier|) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))) (_ bv1 1))) (= (_ bv0 32) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_#res#1.base|) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1|) (= (_ bv0 32) |ULTIMATE.start_main_~#s~0#1.offset|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| (_ bv1 32))))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (_ bv1 1))) (not (= .cse0 (_ bv1 32))) (= (select (select |#memory_$Pointer$.offset| .cse0) .cse1) (_ bv0 32)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_#res#1.base|)) (_ bv1 1))) (not (= (_ bv2 32) |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (_ bv1 1))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= .cse1 (_ bv0 32)) (= (select (select |#memory_int| .cse0) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1|) (= (select (select |#memory_$Pointer$.base| .cse0) .cse1) |ULTIMATE.start_sll_circular_create_#res#1.base|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| (_ bv2 32))))) (_ bv1 1))) (not (= |ULTIMATE.start_sll_circular_create_#res#1.base| (_ bv1 32))) (= |ULTIMATE.start_main_~len~0#1| (_ bv2 32)) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (_ bv1 32))) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_sll_circular_create_~len#1| (_ bv1 32)) (not (= (_ bv0 32) |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (not (= (_ bv0 32) |ULTIMATE.start_sll_circular_create_#res#1.base|)) (not (= (_ bv0 32) |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (not (= (_ bv2 32) |ULTIMATE.start_sll_circular_create_#res#1.base|)) (not (= (_ bv2 32) |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (not (= (_ bv0 32) .cse0)) (bvult |ULTIMATE.start_sll_circular_create_#res#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (_ bv1 32))) (bvult |ULTIMATE.start_sll_circular_create_~head~0#1.base| |#StackHeapBarrier|) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| (select .cse2 |ULTIMATE.start_sll_circular_create_#res#1.offset|)))) (_ bv1 1))) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))) [2021-12-17 09:04:34,259 INFO L858 garLoopResultBuilder]: For program point L643(lines 643 645) no Hoare annotation was computed. [2021-12-17 09:04:34,259 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-17 09:04:34,259 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 648) no Hoare annotation was computed. [2021-12-17 09:04:34,259 INFO L854 garLoopResultBuilder]: At program point L586-2(lines 586 591) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32))) (.cse4 (bvneg (bvneg (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))) (.cse7 (= (_ bv0 32) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse6 (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse8 (= (_ bv0 32) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (bvneg (bvneg (select |#valid| (_ bv1 32))))) (.cse10 (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (_ bv1 1)))) (.cse11 (not (= (_ bv2 32) |ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (.cse1 (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (bvneg (bvneg (select |#valid| (_ bv2 32))))) (.cse3 (= |ULTIMATE.start_main_~len~0#1| (_ bv2 32))) (.cse9 (not (= (_ bv0 32) |ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (.cse12 (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (_ bv1 32)))) (.cse13 (bvult |ULTIMATE.start_sll_circular_create_~head~0#1.base| |#StackHeapBarrier|)) (.cse14 (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1|))) (or (and (= (_ bv0 1) (bvadd .cse0 (_ bv1 1))) .cse1 .cse2 .cse3 (= (_ bv0 1) (bvadd .cse4 (_ bv1 1))) (= (_ bv0 1) (bvadd .cse5 (_ bv1 1))) .cse6 (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse7 .cse8 .cse9 .cse10 (= |ULTIMATE.start_sll_circular_create_~data#1| |ULTIMATE.start_main_~data~0#1|) .cse11 .cse12 .cse13 (= |ULTIMATE.start_sll_circular_create_~len#1| (_ bv2 32)) .cse14) (and .cse2 (bvult |ULTIMATE.start_sll_circular_create_~last~0#1.base| |#StackHeapBarrier|) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1|) (= (_ bv0 1) (bvadd (bvneg .cse4) (_ bv1 1))) .cse7 (not .cse6) .cse8 (= (_ bv0 1) (bvadd (bvneg .cse5) (_ bv1 1))) .cse10 (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (_ bv1 1))) .cse11 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) .cse1 (= (_ bv0 1) (bvadd (bvneg .cse0) (_ bv1 1))) .cse3 (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (_ bv1 32))) (= |ULTIMATE.start_sll_circular_create_~len#1| (_ bv1 32)) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| (_ bv0 32)) .cse9 (not (= (_ bv0 32) |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (not (= (_ bv2 32) |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) .cse12 .cse13 .cse14 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |ULTIMATE.start_sll_circular_create_~last~0#1.offset|)))) [2021-12-17 09:04:34,259 INFO L858 garLoopResultBuilder]: For program point L586-3(lines 586 591) no Hoare annotation was computed. [2021-12-17 09:04:34,259 INFO L854 garLoopResultBuilder]: At program point L644(lines 620 650) the Hoare annotation is: false [2021-12-17 09:04:34,259 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-17 09:04:34,259 INFO L858 garLoopResultBuilder]: For program point L595(lines 595 605) no Hoare annotation was computed. [2021-12-17 09:04:34,259 INFO L854 garLoopResultBuilder]: At program point L587(line 587) the Hoare annotation is: (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| (_ bv2 32)))) (_ bv1 1))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~len~0#1| (_ bv2 32)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| (_ bv1 32)))) (_ bv1 1))) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (_ bv0 32) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (_ bv0 32) |ULTIMATE.start_main_~#s~0#1.offset|) (not (= (_ bv0 32) |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (_ bv1 1))) (= |ULTIMATE.start_sll_circular_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (not (= (_ bv2 32) |ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (_ bv1 32))) (bvult |ULTIMATE.start_sll_circular_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_~len#1| (_ bv2 32)) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1|)) [2021-12-17 09:04:34,259 INFO L858 garLoopResultBuilder]: For program point L587-1(line 587) no Hoare annotation was computed. [2021-12-17 09:04:34,259 INFO L858 garLoopResultBuilder]: For program point L629-1(lines 629 631) no Hoare annotation was computed. [2021-12-17 09:04:34,259 INFO L858 garLoopResultBuilder]: For program point L596(lines 596 604) no Hoare annotation was computed. [2021-12-17 09:04:34,260 INFO L854 garLoopResultBuilder]: At program point L629-3(lines 629 631) the Hoare annotation is: (let ((.cse21 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse52 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse48 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| .cse21) .cse52)) (select (select |#memory_$Pointer$.offset| .cse21) .cse52)))) (let ((.cse0 (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32))) (.cse5 (= |ULTIMATE.start_main_~uneq~0#1| (_ bv5 32))) (.cse6 (= |ULTIMATE.start_main_~len~0#1| (_ bv2 32))) (.cse7 (= |ULTIMATE.start_main_~ptr~0#1.offset| .cse52)) (.cse27 (= |ULTIMATE.start_main_~ptr~0#1.base| .cse21)) (.cse8 (= (select (select |#memory_$Pointer$.offset| .cse48) (_ bv0 32)) .cse52)) (.cse9 (exists ((|#StackHeapBarrier| (_ BitVec 32))) (let ((.cse51 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse49 (select |#memory_$Pointer$.base| .cse51))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult (select .cse49 (_ bv0 32)) |#StackHeapBarrier|) (bvult (let ((.cse50 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (select (select |#memory_$Pointer$.base| (select .cse49 .cse50)) (select (select |#memory_$Pointer$.offset| .cse51) .cse50))) |#StackHeapBarrier|)))))) (.cse10 (= |ULTIMATE.start_sll_circular_create_~len#1| (_ bv1 32))) (.cse11 (= (_ bv0 32) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse18 (= (select (select |#memory_$Pointer$.base| .cse48) (_ bv0 32)) .cse21)) (.cse19 (= |ULTIMATE.start_main_~count~0#1| (_ bv0 32))) (.cse20 (not (= (_ bv0 32) .cse21))) (.cse22 (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1|))) (or (and .cse0 (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (_ BitVec 32))) (let ((.cse4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32)))) (let ((.cse3 (select |#memory_$Pointer$.base| .cse4))) (let ((.cse1 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32))) (.cse2 (select .cse3 (_ bv0 32)))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 (_ bv0 32)) (bvult |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~ptr~0#1.offset| .cse1) (= (select (select |#memory_int| .cse2) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1|) (not (= (select .cse3 .cse1) .cse4)) (not (= .cse4 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (= |ULTIMATE.start_main_~last~2#1.offset| .cse1) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse4) (not (= .cse2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (bvult .cse2 |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| .cse4) (_ bv0 32)) (_ bv0 32)) (= |ULTIMATE.start_main_~last~2#1.base| .cse4)))))) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32))) (let ((.cse12 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32)))) (let ((.cse17 (select |#memory_$Pointer$.offset| .cse12)) (.cse14 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32)))) (let ((.cse15 (select (select |#memory_$Pointer$.base| .cse12) (_ bv0 32))) (.cse16 (select .cse17 .cse14))) (let ((.cse13 (select (select |#memory_$Pointer$.base| .cse15) .cse16))) (and (not (= .cse12 .cse13)) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult .cse13 |#StackHeapBarrier|) (= .cse14 (_ bv0 32)) (= |ULTIMATE.start_main_~ptr~0#1.offset| .cse14) (= (select (select |#memory_$Pointer$.offset| .cse15) .cse16) (_ bv0 32)) (= |ULTIMATE.start_main_~last~2#1.offset| .cse14) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse12) (= (select (select |#memory_int| .cse13) (_ bv4 32)) |ULTIMATE.start_main_~uneq~0#1|) (bvult .cse15 |#StackHeapBarrier|) (not (= .cse15 .cse13)) (= (select .cse17 (_ bv0 32)) (_ bv0 32)) (= |ULTIMATE.start_main_~last~2#1.base| .cse12))))))) .cse18 .cse19 .cse20 (= |ULTIMATE.start_main_~last~2#1.base| .cse21) .cse22) (and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (_ BitVec 32))) (let ((.cse23 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32)))) (let ((.cse26 (select |#memory_$Pointer$.base| .cse23))) (let ((.cse24 (select .cse26 (_ bv0 32))) (.cse25 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32)))) (and (= |ULTIMATE.start_main_~ptr~0#1.base| .cse23) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse24 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (= .cse25 (_ bv0 32)) (bvult |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~ptr~0#1.offset| .cse25) (bvult .cse24 |#StackHeapBarrier|) (= (select (select |#memory_int| .cse24) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1|) (not (= (select .cse26 .cse25) .cse23)) (= (select (select |#memory_$Pointer$.offset| .cse23) (_ bv0 32)) (_ bv0 32)) (not (= .cse23 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|))))))) .cse0 .cse5 .cse6 .cse7 .cse27 (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32))) (let ((.cse28 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32)))) (let ((.cse34 (select |#memory_$Pointer$.offset| .cse28)) (.cse31 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32))) (.cse30 (select |#memory_$Pointer$.base| .cse28))) (let ((.cse32 (select .cse30 (_ bv0 32))) (.cse33 (select .cse34 .cse31))) (let ((.cse29 (select (select |#memory_$Pointer$.base| .cse32) .cse33))) (and (not (= .cse28 .cse29)) (= |ULTIMATE.start_main_~last~2#1.base| (select .cse30 .cse31)) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult .cse29 |#StackHeapBarrier|) (= .cse31 (_ bv0 32)) (= |ULTIMATE.start_main_~ptr~0#1.offset| .cse31) (= (select (select |#memory_$Pointer$.offset| .cse32) .cse33) (_ bv0 32)) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse28) (= (select (select |#memory_int| .cse29) (_ bv4 32)) |ULTIMATE.start_main_~uneq~0#1|) (bvult .cse32 |#StackHeapBarrier|) (not (= .cse32 .cse29)) (= (select .cse34 (_ bv0 32)) (_ bv0 32)) (= |ULTIMATE.start_main_~last~2#1.offset| .cse33))))))) .cse8 .cse10 .cse11 .cse18 .cse19 (exists ((|#StackHeapBarrier| (_ BitVec 32))) (let ((.cse35 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (_ bv0 32)))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult .cse35 |#StackHeapBarrier|) (bvult (select (select |#memory_$Pointer$.base| .cse35) |ULTIMATE.start_main_~last~2#1.offset|) |#StackHeapBarrier|)))) .cse20 .cse22) (and .cse0 (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32))) (let ((.cse36 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32)))) (let ((.cse38 (select (select |#memory_$Pointer$.base| .cse36) (_ bv0 32)))) (let ((.cse37 (select (select |#memory_$Pointer$.base| .cse38) (_ bv0 32)))) (and (not (= .cse36 .cse37)) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse36) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_int| .cse37) (_ bv4 32)) |ULTIMATE.start_main_~uneq~0#1|) (bvult .cse37 |#StackHeapBarrier|) (bvult .cse38 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~last~2#1.base| .cse37) (not (= .cse38 .cse37))))))) (exists ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (|#StackHeapBarrier| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32))) (let ((.cse41 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse42 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse40 (select (select |#memory_$Pointer$.base| .cse41) .cse42)) (.cse43 (select (select |#memory_$Pointer$.offset| .cse41) (_ bv0 32)))) (let ((.cse39 (select (select |#memory_$Pointer$.base| .cse40) .cse43))) (and (not (= .cse39 .cse40)) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_int| .cse40) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1|) (not (= |ULTIMATE.start_main_~#s~0#1.base| .cse41)) (not (= |ULTIMATE.start_main_~#s~0#1.base| .cse40)) (= |ULTIMATE.start_main_~ptr~0#1.offset| .cse42) (= .cse42 (_ bv0 32)) (not (= .cse41 .cse39)) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse41) (bvult .cse39 |#StackHeapBarrier|) (= .cse43 (_ bv0 32))))))) .cse5 .cse6 .cse7 .cse27 .cse8 .cse9 .cse10 .cse11 (= |ULTIMATE.start_main_~last~2#1.offset| (_ bv0 32)) .cse18 .cse19 (exists ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#s~0#1.base| (_ BitVec 32))) (let ((.cse45 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse44 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse46 (select (select |#memory_$Pointer$.base| .cse45) .cse44)) (.cse47 (select (select |#memory_$Pointer$.offset| .cse45) .cse44))) (and (= |ULTIMATE.start_main_~ptr~0#1.offset| .cse44) (= |ULTIMATE.start_main_~ptr~0#1.base| .cse45) (= |ULTIMATE.start_main_~last~2#1.offset| (select (select |#memory_$Pointer$.offset| .cse46) .cse47)) (= |ULTIMATE.start_main_~last~2#1.base| (select (select |#memory_$Pointer$.base| .cse46) .cse47)))))) .cse20 .cse22))))) [2021-12-17 09:04:34,260 INFO L858 garLoopResultBuilder]: For program point L613-1(lines 613 615) no Hoare annotation was computed. [2021-12-17 09:04:34,260 INFO L854 garLoopResultBuilder]: At program point L613-3(lines 613 615) the Hoare annotation is: (let ((.cse28 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse34 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse29 (select |#memory_$Pointer$.base| .cse28))) (let ((.cse7 (select |#memory_$Pointer$.offset| .cse28)) (.cse30 (select .cse29 (_ bv0 32))) (.cse35 (select (select |#memory_$Pointer$.base| .cse34) (_ bv0 32)))) (let ((.cse0 (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| |#StackHeapBarrier|) (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |#StackHeapBarrier|)))) (.cse1 (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32))) (.cse2 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (_ bv0 32)) (_ bv0 32))) (.cse4 (not (= (_ bv2 32) .cse34))) (.cse5 (= (_ bv0 32) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (not (= .cse35 (_ bv1 32)))) (.cse8 (= (select (select |#memory_int| .cse28) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1|)) (.cse9 (= (select (select |#memory_$Pointer$.base| .cse30) (_ bv0 32)) .cse28)) (.cse10 (= |ULTIMATE.start_sll_circular_append_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse11 (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ bv0 32))) (.cse12 (not (= (_ bv0 32) .cse28))) (.cse13 (not (= (_ bv0 32) .cse35))) (.cse14 (= |ULTIMATE.start_main_~uneq~0#1| (_ bv5 32))) (.cse15 (= |ULTIMATE.start_main_~len~0#1| (_ bv2 32))) (.cse16 (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse17 (not (= .cse34 (_ bv1 32)))) (.cse18 (= |ULTIMATE.start_sll_circular_create_~len#1| (_ bv1 32))) (.cse22 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (_ bv0 32)) (_ bv0 32))) (.cse23 (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (bvadd |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ bv4 32))) |ULTIMATE.start_main_~uneq~0#1|)) (.cse24 (not (= (_ bv2 32) .cse35))) (.cse25 (= (select (select |#memory_int| .cse30) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1|)) (.cse26 (= (select (select |#memory_$Pointer$.offset| .cse35) (select (select |#memory_$Pointer$.offset| .cse34) (_ bv0 32))) (_ bv0 32))) (.cse27 (= (select .cse7 (_ bv0 32)) (_ bv0 32)))) (or (let ((.cse3 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse21 (select .cse29 .cse3))) (and .cse0 .cse1 .cse2 (= .cse3 (_ bv0 32)) .cse4 .cse5 .cse6 (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select .cse7 .cse3)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (exists ((|#StackHeapBarrier| (_ BitVec 32)) (v_arrayElimIndex_66 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (let ((.cse20 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse19 (select (select |#memory_$Pointer$.base| .cse20) (_ bv0 32)))) (and (bvult .cse19 |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_append_~head#1.base|) (not (= .cse19 |node_create_~temp~0#1.base|)) (not (= (_ bv0 32) v_arrayElimIndex_66)) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (not (= v_arrayElimIndex_66 (_ bv1 32))) (not (= (_ bv2 32) v_arrayElimIndex_66)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |node_create_~temp~0#1.base| (_ bv1 32))) (bvult v_arrayElimIndex_66 |#StackHeapBarrier|) (not (= |node_create_~temp~0#1.base| .cse20)) (not (= (_ bv2 32) |node_create_~temp~0#1.base|)))))) (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse21) .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 (not (= .cse21 .cse28))))) (let ((.cse31 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 (not (= .cse30 .cse28)) .cse9 .cse10 .cse11 (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse31) .cse12 .cse13 (exists ((|#StackHeapBarrier| (_ BitVec 32)) (v_arrayElimIndex_66 (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (let ((.cse33 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse32 (select (select |#memory_$Pointer$.base| .cse33) (_ bv0 32)))) (and (bvult .cse32 |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_sll_circular_append_~head#1.base|) (not (= .cse32 |node_create_~temp~0#1.base|)) (not (= (_ bv0 32) v_arrayElimIndex_66)) (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (not (= v_arrayElimIndex_66 (_ bv1 32))) (not (= (_ bv2 32) v_arrayElimIndex_66)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |node_create_~temp~0#1.base| (_ bv1 32))) (bvult v_arrayElimIndex_66 |#StackHeapBarrier|) (not (= (_ bv2 32) |node_create_~temp~0#1.base|)) (not (= |node_create_~temp~0#1.base| .cse33)))))) .cse14 .cse15 .cse16 (= .cse31 (_ bv0 32)) .cse17 .cse18 (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse34) .cse22 .cse23 (not (= (_ bv0 32) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) .cse24 .cse25 .cse26 .cse27))))))) [2021-12-17 09:04:34,260 INFO L858 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2021-12-17 09:04:34,260 INFO L858 garLoopResultBuilder]: For program point L576-1(lines 576 578) no Hoare annotation was computed. [2021-12-17 09:04:34,260 INFO L861 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2021-12-17 09:04:34,260 INFO L854 garLoopResultBuilder]: At program point node_createENTRY(lines 574 582) the Hoare annotation is: (or (not (= (_ bv0 1) (bvadd (select |old(#valid)| (_ bv2 32)) (_ bv1 1)))) (= (_ bv0 32) (bvadd |#StackHeapBarrier| (_ bv1 32))) (not (= (_ bv0 1) (bvadd (select |old(#valid)| (_ bv1 32)) (_ bv1 1)))) (= (_ bv0 32) |#StackHeapBarrier|) (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_int| |old(#memory_int)|) (= |#valid| |old(#valid)|))) [2021-12-17 09:04:34,260 INFO L858 garLoopResultBuilder]: For program point node_createFINAL(lines 574 582) no Hoare annotation was computed. [2021-12-17 09:04:34,260 INFO L858 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2021-12-17 09:04:34,263 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:04:34,264 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 09:04:34,272 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (bvneg (_ BitVec 1) (_ BitVec 1)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:211) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) 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) [2021-12-17 09:04:34,275 INFO L158 Benchmark]: Toolchain (without parser) took 497771.57ms. Allocated memory was 67.1MB in the beginning and 119.5MB in the end (delta: 52.4MB). Free memory was 47.7MB in the beginning and 39.7MB in the end (delta: 8.0MB). Peak memory consumption was 78.6MB. Max. memory is 16.1GB. [2021-12-17 09:04:34,275 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 67.1MB. Free memory was 49.9MB in the beginning and 49.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 09:04:34,275 INFO L158 Benchmark]: CACSL2BoogieTranslator took 385.23ms. Allocated memory is still 67.1MB. Free memory was 47.5MB in the beginning and 42.8MB in the end (delta: 4.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-17 09:04:34,276 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.81ms. Allocated memory is still 67.1MB. Free memory was 42.8MB in the beginning and 40.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 09:04:34,276 INFO L158 Benchmark]: Boogie Preprocessor took 52.69ms. Allocated memory is still 67.1MB. Free memory was 40.4MB in the beginning and 38.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 09:04:34,279 INFO L158 Benchmark]: RCFGBuilder took 437.84ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 38.3MB in the beginning and 56.1MB in the end (delta: -17.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-17 09:04:34,279 INFO L158 Benchmark]: TraceAbstraction took 496832.46ms. Allocated memory was 81.8MB in the beginning and 119.5MB in the end (delta: 37.7MB). Free memory was 55.8MB in the beginning and 39.7MB in the end (delta: 16.1MB). Peak memory consumption was 72.7MB. Max. memory is 16.1GB. [2021-12-17 09:04:34,280 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.16ms. Allocated memory is still 67.1MB. Free memory was 49.9MB in the beginning and 49.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 385.23ms. Allocated memory is still 67.1MB. Free memory was 47.5MB in the beginning and 42.8MB in the end (delta: 4.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.81ms. Allocated memory is still 67.1MB. Free memory was 42.8MB in the beginning and 40.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.69ms. Allocated memory is still 67.1MB. Free memory was 40.4MB in the beginning and 38.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 437.84ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 38.3MB in the beginning and 56.1MB in the end (delta: -17.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 496832.46ms. Allocated memory was 81.8MB in the beginning and 119.5MB in the end (delta: 37.7MB). Free memory was 55.8MB in the beginning and 39.7MB in the end (delta: 16.1MB). Peak memory consumption was 72.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 648]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 496.8s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 70.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 24.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 270 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 267 mSDsluCounter, 4310 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1753 IncrementalHoareTripleChecker+Unchecked, 3870 mSDsCounter, 143 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1674 IncrementalHoareTripleChecker+Invalid, 3570 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 143 mSolverCounterUnsat, 440 mSDtfsCounter, 1674 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1596 GetRequests, 913 SyntacticMatches, 27 SemanticMatches, 656 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 12321 ImplicationChecksByTransitivity, 298.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=10, InterpolantAutomatonStates: 245, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 45 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 26 PreInvPairs, 38 NumberOfFragments, 3328 HoareAnnotationTreeSize, 26 FomulaSimplifications, 74 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 2257 FormulaSimplificationTreeSizeReductionInter, 24.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 4.9s SatisfiabilityAnalysisTime, 389.2s InterpolantComputationTime, 997 NumberOfCodeBlocks, 997 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1161 ConstructedInterpolants, 320 QuantifiedInterpolants, 39840 SizeOfPredicates, 494 NumberOfNonLiveVariables, 5998 ConjunctsInSsa, 1455 ConjunctsInUnsatCore, 28 InterpolantComputations, 3 PerfectInterpolantSequences, 369/648 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 620]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 598]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 620]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 1) (_ BitVec 1)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (bvneg (_ BitVec 1) (_ BitVec 1)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:211) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-17 09:04:34,448 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: UnsupportedOperationException: translation of (bvneg (_ BitVec 1) (_ BitVec 1)) not yet implemented, please contact Matthias