./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2n_prepend_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/dll2n_prepend_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 a0a808cbaf75e35690b91e29e30a5a3e0888859a17f932e1ee324e5b23ddf983 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 08:53:54,659 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 08:53:54,660 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 08:53:54,682 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 08:53:54,682 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 08:53:54,683 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 08:53:54,684 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 08:53:54,685 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 08:53:54,700 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 08:53:54,703 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 08:53:54,704 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 08:53:54,705 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 08:53:54,705 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 08:53:54,707 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 08:53:54,709 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 08:53:54,712 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 08:53:54,713 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 08:53:54,713 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 08:53:54,717 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 08:53:54,719 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 08:53:54,721 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 08:53:54,722 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 08:53:54,723 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 08:53:54,723 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 08:53:54,736 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 08:53:54,736 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 08:53:54,736 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 08:53:54,737 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 08:53:54,737 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 08:53:54,737 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 08:53:54,738 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 08:53:54,738 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 08:53:54,738 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 08:53:54,739 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 08:53:54,740 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 08:53:54,741 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 08:53:54,741 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 08:53:54,742 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 08:53:54,742 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 08:53:54,742 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 08:53:54,743 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 08:53:54,743 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:53:54,760 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 08:53:54,763 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 08:53:54,764 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 08:53:54,764 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 08:53:54,764 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 08:53:54,764 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 08:53:54,765 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 08:53:54,765 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 08:53:54,765 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 08:53:54,765 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 08:53:54,766 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 08:53:54,766 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 08:53:54,766 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 08:53:54,766 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 08:53:54,766 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 08:53:54,767 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 08:53:54,767 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 08:53:54,767 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 08:53:54,767 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 08:53:54,767 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 08:53:54,767 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 08:53:54,767 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 08:53:54,767 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 08:53:54,768 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 08:53:54,768 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 08:53:54,768 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 08:53:54,768 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 08:53:54,769 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 08:53:54,769 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 08:53:54,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 08:53:54,769 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 08:53:54,769 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 08:53:54,770 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 08:53:54,770 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 08:53:54,770 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 -> a0a808cbaf75e35690b91e29e30a5a3e0888859a17f932e1ee324e5b23ddf983 [2021-12-17 08:53:54,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 08:53:54,956 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 08:53:54,957 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 08:53:54,958 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 08:53:54,959 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 08:53:54,959 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i [2021-12-17 08:53:54,999 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c39152d1/9cd897b8f4334e73bb1f691b2559984c/FLAGa7463f54e [2021-12-17 08:53:55,416 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 08:53:55,421 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i [2021-12-17 08:53:55,436 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c39152d1/9cd897b8f4334e73bb1f691b2559984c/FLAGa7463f54e [2021-12-17 08:53:55,449 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c39152d1/9cd897b8f4334e73bb1f691b2559984c [2021-12-17 08:53:55,450 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 08:53:55,451 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 08:53:55,452 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 08:53:55,452 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 08:53:55,455 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 08:53:55,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 08:53:55" (1/1) ... [2021-12-17 08:53:55,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cfd65d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:53:55, skipping insertion in model container [2021-12-17 08:53:55,457 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 08:53:55" (1/1) ... [2021-12-17 08:53:55,461 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 08:53:55,491 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 08:53:55,659 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/dll2n_prepend_unequal.i[24450,24463] [2021-12-17 08:53:55,664 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 08:53:55,671 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 08:53:55,715 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/dll2n_prepend_unequal.i[24450,24463] [2021-12-17 08:53:55,715 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 08:53:55,736 INFO L208 MainTranslator]: Completed translation [2021-12-17 08:53:55,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:53:55 WrapperNode [2021-12-17 08:53:55,737 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 08:53:55,738 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 08:53:55,738 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 08:53:55,738 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 08:53:55,744 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:53:55" (1/1) ... [2021-12-17 08:53:55,756 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:53:55" (1/1) ... [2021-12-17 08:53:55,784 INFO L137 Inliner]: procedures = 127, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 123 [2021-12-17 08:53:55,785 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 08:53:55,786 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 08:53:55,787 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 08:53:55,787 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 08:53:55,792 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:53:55" (1/1) ... [2021-12-17 08:53:55,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:53:55" (1/1) ... [2021-12-17 08:53:55,806 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:53:55" (1/1) ... [2021-12-17 08:53:55,806 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:53:55" (1/1) ... [2021-12-17 08:53:55,813 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:53:55" (1/1) ... [2021-12-17 08:53:55,820 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:53:55" (1/1) ... [2021-12-17 08:53:55,822 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:53:55" (1/1) ... [2021-12-17 08:53:55,823 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 08:53:55,824 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 08:53:55,824 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 08:53:55,824 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 08:53:55,834 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:53:55" (1/1) ... [2021-12-17 08:53:55,839 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 08:53:55,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:53:55,861 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:53:55,874 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:53:55,902 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-12-17 08:53:55,902 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-12-17 08:53:55,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-17 08:53:55,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-17 08:53:55,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-17 08:53:55,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 08:53:55,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 08:53:55,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-17 08:53:55,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-17 08:53:55,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 08:53:55,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-17 08:53:55,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 08:53:55,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 08:53:55,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 08:53:55,987 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 08:53:56,000 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 08:53:56,049 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-12-17 08:53:56,197 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 08:53:56,202 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 08:53:56,204 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-17 08:53:56,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 08:53:56 BoogieIcfgContainer [2021-12-17 08:53:56,205 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 08:53:56,206 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 08:53:56,207 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 08:53:56,209 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 08:53:56,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 08:53:55" (1/3) ... [2021-12-17 08:53:56,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aa85fa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 08:53:56, skipping insertion in model container [2021-12-17 08:53:56,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:53:55" (2/3) ... [2021-12-17 08:53:56,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aa85fa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 08:53:56, skipping insertion in model container [2021-12-17 08:53:56,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 08:53:56" (3/3) ... [2021-12-17 08:53:56,211 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_unequal.i [2021-12-17 08:53:56,217 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 08:53:56,217 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 08:53:56,245 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 08:53:56,250 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:53:56,250 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 08:53:56,262 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 28 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:53:56,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-17 08:53:56,265 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:53:56,265 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:53:56,266 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:53:56,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:53:56,270 INFO L85 PathProgramCache]: Analyzing trace with hash -670387442, now seen corresponding path program 1 times [2021-12-17 08:53:56,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:53:56,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266903722] [2021-12-17 08:53:56,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:53:56,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:53:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:56,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:53:56,428 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:53:56,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266903722] [2021-12-17 08:53:56,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266903722] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:53:56,430 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:53:56,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 08:53:56,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673268469] [2021-12-17 08:53:56,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:53:56,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 08:53:56,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:53:56,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 08:53:56,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 08:53:56,461 INFO L87 Difference]: Start difference. First operand has 30 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 28 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 08:53:56,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:53:56,479 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2021-12-17 08:53:56,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 08:53:56,481 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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) Word has length 13 [2021-12-17 08:53:56,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:53:56,486 INFO L225 Difference]: With dead ends: 52 [2021-12-17 08:53:56,486 INFO L226 Difference]: Without dead ends: 21 [2021-12-17 08:53:56,489 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 08:53:56,492 INFO L933 BasicCegarLoop]: 38 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, 38 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:53:56,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 08:53:56,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-12-17 08:53:56,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-12-17 08:53:56,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 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 08:53:56,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2021-12-17 08:53:56,524 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 13 [2021-12-17 08:53:56,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:53:56,525 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2021-12-17 08:53:56,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 08:53:56,526 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2021-12-17 08:53:56,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-17 08:53:56,527 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:53:56,527 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:53:56,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 08:53:56,528 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:53:56,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:53:56,531 INFO L85 PathProgramCache]: Analyzing trace with hash -888049989, now seen corresponding path program 1 times [2021-12-17 08:53:56,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:53:56,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166296396] [2021-12-17 08:53:56,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:53:56,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:53:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:56,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:53:56,616 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:53:56,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166296396] [2021-12-17 08:53:56,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166296396] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:53:56,617 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:53:56,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 08:53:56,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865345574] [2021-12-17 08:53:56,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:53:56,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 08:53:56,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:53:56,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 08:53:56,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 08:53:56,619 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 08:53:56,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:53:56,635 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2021-12-17 08:53:56,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 08:53:56,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) Word has length 13 [2021-12-17 08:53:56,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:53:56,637 INFO L225 Difference]: With dead ends: 40 [2021-12-17 08:53:56,637 INFO L226 Difference]: Without dead ends: 26 [2021-12-17 08:53:56,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 08:53:56,642 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 5 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 46 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:53:56,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 46 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 08:53:56,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-12-17 08:53:56,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2021-12-17 08:53:56,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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 08:53:56,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2021-12-17 08:53:56,651 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 13 [2021-12-17 08:53:56,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:53:56,652 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2021-12-17 08:53:56,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 08:53:56,652 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2021-12-17 08:53:56,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-17 08:53:56,653 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:53:56,653 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:53:56,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 08:53:56,653 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:53:56,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:53:56,654 INFO L85 PathProgramCache]: Analyzing trace with hash -116753941, now seen corresponding path program 1 times [2021-12-17 08:53:56,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:53:56,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945909911] [2021-12-17 08:53:56,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:53:56,655 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:53:56,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:56,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:53:56,726 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:53:56,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945909911] [2021-12-17 08:53:56,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945909911] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:53:56,726 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:53:56,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 08:53:56,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232581734] [2021-12-17 08:53:56,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:53:56,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 08:53:56,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:53:56,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 08:53:56,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 08:53:56,728 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 08:53:56,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:53:56,746 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2021-12-17 08:53:56,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 08:53:56,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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) Word has length 18 [2021-12-17 08:53:56,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:53:56,748 INFO L225 Difference]: With dead ends: 45 [2021-12-17 08:53:56,748 INFO L226 Difference]: Without dead ends: 26 [2021-12-17 08:53:56,749 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 08:53:56,754 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 08:53:56,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 44 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 08:53:56,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-12-17 08:53:56,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2021-12-17 08:53:56,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 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 08:53:56,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2021-12-17 08:53:56,763 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 18 [2021-12-17 08:53:56,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:53:56,763 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2021-12-17 08:53:56,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 08:53:56,764 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2021-12-17 08:53:56,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-17 08:53:56,764 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:53:56,764 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:53:56,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-17 08:53:56,765 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:53:56,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:53:56,766 INFO L85 PathProgramCache]: Analyzing trace with hash -703559955, now seen corresponding path program 1 times [2021-12-17 08:53:56,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:53:56,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811308703] [2021-12-17 08:53:56,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:53:56,766 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:53:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:56,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:53:56,825 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:53:56,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811308703] [2021-12-17 08:53:56,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811308703] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:53:56,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668233930] [2021-12-17 08:53:56,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:53:56,827 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:53:56,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:53:56,838 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:53:56,839 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:53:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:56,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-17 08:53:56,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:53:57,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:53:57,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:53:57,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:53:57,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668233930] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 08:53:57,082 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 08:53:57,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-12-17 08:53:57,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144810381] [2021-12-17 08:53:57,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 08:53:57,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 08:53:57,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:53:57,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 08:53:57,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-17 08:53:57,084 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 08:53:57,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:53:57,098 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2021-12-17 08:53:57,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 08:53:57,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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) Word has length 18 [2021-12-17 08:53:57,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:53:57,099 INFO L225 Difference]: With dead ends: 41 [2021-12-17 08:53:57,099 INFO L226 Difference]: Without dead ends: 27 [2021-12-17 08:53:57,100 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-17 08:53:57,100 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 08:53:57,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 64 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 08:53:57,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-17 08:53:57,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-12-17 08:53:57,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 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 08:53:57,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2021-12-17 08:53:57,120 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 18 [2021-12-17 08:53:57,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:53:57,120 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2021-12-17 08:53:57,120 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 08:53:57,120 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2021-12-17 08:53:57,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-17 08:53:57,121 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:53:57,121 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:53:57,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-17 08:53:57,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:53:57,336 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:53:57,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:53:57,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1057796345, now seen corresponding path program 1 times [2021-12-17 08:53:57,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:53:57,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624155928] [2021-12-17 08:53:57,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:53:57,337 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:53:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:57,664 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 08:53:57,665 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:53:57,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624155928] [2021-12-17 08:53:57,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624155928] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:53:57,665 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:53:57,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-17 08:53:57,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086861562] [2021-12-17 08:53:57,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:53:57,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-17 08:53:57,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:53:57,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-17 08:53:57,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-12-17 08:53:57,669 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 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 08:53:57,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:53:57,961 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2021-12-17 08:53:57,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 08:53:57,970 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 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) Word has length 23 [2021-12-17 08:53:57,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:53:57,970 INFO L225 Difference]: With dead ends: 30 [2021-12-17 08:53:57,970 INFO L226 Difference]: Without dead ends: 28 [2021-12-17 08:53:57,971 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2021-12-17 08:53:57,971 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 54 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 08:53:57,971 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 46 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 08:53:57,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-12-17 08:53:57,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2021-12-17 08:53:57,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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 08:53:57,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-12-17 08:53:57,974 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2021-12-17 08:53:57,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:53:57,974 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-12-17 08:53:57,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 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 08:53:57,974 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-12-17 08:53:57,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-17 08:53:57,975 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:53:57,975 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:53:57,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-17 08:53:57,975 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:53:57,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:53:57,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1364928246, now seen corresponding path program 1 times [2021-12-17 08:53:57,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:53:57,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612831871] [2021-12-17 08:53:57,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:53:57,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:53:58,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:58,229 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 08:53:58,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:53:58,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612831871] [2021-12-17 08:53:58,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612831871] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:53:58,230 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:53:58,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-17 08:53:58,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147642858] [2021-12-17 08:53:58,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:53:58,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-17 08:53:58,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:53:58,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-17 08:53:58,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2021-12-17 08:53:58,232 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 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 08:53:58,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:53:58,641 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2021-12-17 08:53:58,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 08:53:58,642 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 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) Word has length 25 [2021-12-17 08:53:58,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:53:58,642 INFO L225 Difference]: With dead ends: 42 [2021-12-17 08:53:58,642 INFO L226 Difference]: Without dead ends: 39 [2021-12-17 08:53:58,643 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2021-12-17 08:53:58,644 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 93 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 08:53:58,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 75 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 08:53:58,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-12-17 08:53:58,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2021-12-17 08:53:58,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 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 08:53:58,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2021-12-17 08:53:58,649 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 25 [2021-12-17 08:53:58,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:53:58,649 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2021-12-17 08:53:58,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 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 08:53:58,649 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2021-12-17 08:53:58,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-17 08:53:58,650 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:53:58,650 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:53:58,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-17 08:53:58,651 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:53:58,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:53:58,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1364926572, now seen corresponding path program 1 times [2021-12-17 08:53:58,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:53:58,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995400443] [2021-12-17 08:53:58,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:53:58,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:53:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:59,137 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:53:59,137 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:53:59,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995400443] [2021-12-17 08:53:59,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995400443] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:53:59,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974229361] [2021-12-17 08:53:59,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:53:59,137 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:53:59,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:53:59,156 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:53:59,184 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:53:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:59,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 102 conjunts are in the unsatisfiable core [2021-12-17 08:53:59,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:53:59,312 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:53:59,372 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 08:53:59,372 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:53:59,532 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-12-17 08:53:59,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-12-17 08:53:59,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:59,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:59,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:59,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2021-12-17 08:53:59,723 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 14 treesize of output 16 [2021-12-17 08:53:59,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:59,921 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-17 08:53:59,921 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 20 treesize of output 18 [2021-12-17 08:54:00,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:54:00,059 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 34 treesize of output 32 [2021-12-17 08:54:00,065 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:54:00,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:54:00,079 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 14 treesize of output 16 [2021-12-17 08:54:00,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:54:00,150 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 32 [2021-12-17 08:54:00,182 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:54:00,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:54:00,208 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2021-12-17 08:54:00,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:54:00,296 INFO L354 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2021-12-17 08:54:00,297 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 80 [2021-12-17 08:54:00,303 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 08:54:00,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:54:00,304 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 37 treesize of output 32 [2021-12-17 08:54:00,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:54:00,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:54:00,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:54:00,311 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 27 treesize of output 32 [2021-12-17 08:54:00,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:54:00,356 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-12-17 08:54:00,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:54:00,363 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 39 [2021-12-17 08:54:00,367 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 28 treesize of output 30 [2021-12-17 08:54:00,490 INFO L354 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2021-12-17 08:54:00,490 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 122 treesize of output 53 [2021-12-17 08:54:00,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:54:00,495 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 12 [2021-12-17 08:54:00,528 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:54:00,550 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:54:00,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:54:00,640 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_566 (Array Int Int))) (= (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|))) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|)))) (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|) 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_566) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2021-12-17 08:54:00,665 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_562 Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_ArrVal_566 (Array Int Int))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse4 (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_563))) (store .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|)))) (.cse1 (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_561))) (store .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|) 8) v_ArrVal_562)) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_566) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2021-12-17 08:54:00,743 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_556 (Array Int Int)) (v_ArrVal_562 Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (|v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_7| Int)) (= (let ((.cse10 (+ |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_7| 4))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base|) .cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base|) .cse10 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|)))) (.cse1 (select (select .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse6 (let ((.cse9 (store .cse2 .cse1 v_ArrVal_563))) (store .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_7|)))) (.cse3 (let ((.cse7 (store .cse8 .cse1 v_ArrVal_561))) (store .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_#res#1.base|))))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_556))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|) 8) v_ArrVal_562))) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_566) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2021-12-17 08:54:00,828 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_556 (Array Int Int)) (v_ArrVal_562 Int) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_553 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (|v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_7| Int)) (= (let ((.cse10 (+ |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_7| 4))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_552 .cse10 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_552) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_553 .cse10 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|)))) (.cse1 (select (select .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse6 (let ((.cse9 (store .cse2 .cse1 v_ArrVal_563))) (store .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_7|)))) (.cse3 (let ((.cse7 (store .cse8 .cse1 v_ArrVal_561))) (store .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_556))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|) 8) v_ArrVal_562))) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_566) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2021-12-17 08:54:00,896 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 23780 treesize of output 22778 [2021-12-17 08:54:01,100 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 2036722 treesize of output 1975120 [2021-12-17 08:54:03,240 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:54:03,245 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 2162816 treesize of output 2038284 [2021-12-17 08:54:07,489 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 2714734 treesize of output 2669550 [2021-12-17 08:54:10,467 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 3258444 treesize of output 3072548 [2021-12-17 08:54:15,087 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:54:15,092 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 3422538 treesize of output 3270706 [2021-12-17 08:54:24,821 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 3926020 treesize of output 3799332 [2021-12-17 08:54:30,405 WARN L227 SmtUtils]: Spent 5.58s on a formula simplification that was a NOOP. DAG size: 4373 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 08:54:30,742 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 4306084 treesize of output 4182180 [2021-12-17 08:54:37,124 WARN L227 SmtUtils]: Spent 6.38s on a formula simplification that was a NOOP. DAG size: 4357 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 08:55:07,816 WARN L227 SmtUtils]: Spent 23.69s on a formula simplification. DAG size of input: 4346 DAG size of output: 4346 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 08:55:21,349 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-17 08:55:21,350 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-17 08:55:21,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2021-12-17 08:55:21,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318776644] [2021-12-17 08:55:21,350 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-17 08:55:21,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-17 08:55:21,351 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:55:21,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-17 08:55:21,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1160, Unknown=4, NotChecked=284, Total=1560 [2021-12-17 08:55:21,352 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 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 08:55:22,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:55:22,210 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2021-12-17 08:55:22,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-17 08:55:22,211 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 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) Word has length 25 [2021-12-17 08:55:22,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:55:22,212 INFO L225 Difference]: With dead ends: 42 [2021-12-17 08:55:22,212 INFO L226 Difference]: Without dead ends: 40 [2021-12-17 08:55:22,213 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=255, Invalid=2207, Unknown=4, NotChecked=396, Total=2862 [2021-12-17 08:55:22,214 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 94 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 08:55:22,214 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 60 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 08:55:22,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-12-17 08:55:22,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2021-12-17 08:55:22,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 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 08:55:22,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2021-12-17 08:55:22,218 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 25 [2021-12-17 08:55:22,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:55:22,218 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2021-12-17 08:55:22,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 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 08:55:22,218 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2021-12-17 08:55:22,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-17 08:55:22,219 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:55:22,219 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:22,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-17 08:55:22,435 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,SelfDestructingSolverStorable6 [2021-12-17 08:55:22,436 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:55:22,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:55:22,436 INFO L85 PathProgramCache]: Analyzing trace with hash 410079116, now seen corresponding path program 1 times [2021-12-17 08:55:22,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:55:22,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319473328] [2021-12-17 08:55:22,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:55:22,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:55:22,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:22,550 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 08:55:22,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:55:22,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319473328] [2021-12-17 08:55:22,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319473328] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:55:22,551 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:55:22,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-17 08:55:22,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117243223] [2021-12-17 08:55:22,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:55:22,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 08:55:22,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:55:22,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 08:55:22,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-17 08:55:22,552 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 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 08:55:22,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:55:22,696 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2021-12-17 08:55:22,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 08:55:22,699 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 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) Word has length 25 [2021-12-17 08:55:22,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:55:22,700 INFO L225 Difference]: With dead ends: 54 [2021-12-17 08:55:22,700 INFO L226 Difference]: Without dead ends: 29 [2021-12-17 08:55:22,700 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-12-17 08:55:22,701 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 08:55:22,701 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 40 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 08:55:22,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-17 08:55:22,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-12-17 08:55:22,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 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 08:55:22,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2021-12-17 08:55:22,706 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 25 [2021-12-17 08:55:22,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:55:22,707 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2021-12-17 08:55:22,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 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 08:55:22,708 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2021-12-17 08:55:22,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-17 08:55:22,708 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:55:22,708 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, 1] [2021-12-17 08:55:22,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-17 08:55:22,709 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:55:22,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:55:22,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1729377051, now seen corresponding path program 1 times [2021-12-17 08:55:22,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:55:22,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149469847] [2021-12-17 08:55:22,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:55:22,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:55:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:23,172 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:55:23,172 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:55:23,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149469847] [2021-12-17 08:55:23,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149469847] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:55:23,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299325944] [2021-12-17 08:55:23,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:55:23,173 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:55:23,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:55:23,174 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:23,174 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:23,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:23,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 88 conjunts are in the unsatisfiable core [2021-12-17 08:55:23,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:55:23,289 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:23,340 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 08:55:23,341 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 1 case distinctions, treesize of input 12 treesize of output 14 [2021-12-17 08:55:23,452 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-12-17 08:55:23,453 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 5 case distinctions, treesize of input 22 treesize of output 33 [2021-12-17 08:55:23,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:23,531 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2021-12-17 08:55:23,600 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 08:55:23,600 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 44 treesize of output 43 [2021-12-17 08:55:23,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:23,788 INFO L354 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2021-12-17 08:55:23,788 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 3 case distinctions, treesize of input 33 treesize of output 33 [2021-12-17 08:55:23,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:23,872 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:55:23,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:23,886 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 08:55:23,886 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 63 treesize of output 53 [2021-12-17 08:55:23,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:23,959 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-12-17 08:55:23,959 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 47 [2021-12-17 08:55:23,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:23,979 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2021-12-17 08:55:24,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:24,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:24,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:24,060 INFO L354 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2021-12-17 08:55:24,061 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 117 treesize of output 72 [2021-12-17 08:55:24,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:24,068 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 31 treesize of output 34 [2021-12-17 08:55:24,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:24,147 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-12-17 08:55:24,147 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 50 [2021-12-17 08:55:24,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:24,153 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2021-12-17 08:55:24,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:24,274 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 176 treesize of output 125 [2021-12-17 08:55:24,339 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-12-17 08:55:24,340 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 35 [2021-12-17 08:55:24,357 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:55:24,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:55:24,501 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_806 Int) (v_ArrVal_807 (Array Int Int))) (not (= 0 (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse3 (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_807))) (store .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|)))) (.cse0 (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|) 8) v_ArrVal_806)))) (store .cse4 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (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|) 4))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))))))) is different from false [2021-12-17 08:55:24,529 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_806 Int) (v_ArrVal_807 (Array Int Int)) (|v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_9| Int)) (not (= 0 (let ((.cse9 (+ |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_9| 4))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base|) .cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base|) .cse9 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|)))) (.cse6 (select (select .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse3 (let ((.cse8 (store .cse7 .cse6 v_ArrVal_807))) (store .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_9|)))) (.cse0 (let ((.cse4 (store .cse5 .cse6 (store (select .cse5 .cse6) (+ (select (select .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|) 8) v_ArrVal_806)))) (store .cse4 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_#res#1.base|))))) (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|) 4))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))))))))) is different from false [2021-12-17 08:55:24,573 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_801 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_806 Int) (v_ArrVal_807 (Array Int Int)) (|v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_9| Int)) (not (= 0 (let ((.cse9 (+ |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_9| 4))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_801 .cse9 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_801) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_800 .cse9 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|)))) (.cse6 (select (select .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse3 (let ((.cse8 (store .cse7 .cse6 v_ArrVal_807))) (store .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_9|)))) (.cse0 (let ((.cse4 (store .cse5 .cse6 (store (select .cse5 .cse6) (+ (select (select .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|) 8) v_ArrVal_806)))) (store .cse4 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (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|) 4))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))))))))) is different from false [2021-12-17 08:55:24,607 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 42697 treesize of output 42015 [2021-12-17 08:55:24,639 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:55:24,639 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 46595 treesize of output 45835 [2021-12-17 08:55:24,669 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 64100 treesize of output 63412 [2021-12-17 08:55:24,692 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 74772 treesize of output 74516 [2021-12-17 08:55:25,209 INFO L354 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2021-12-17 08:55:25,209 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 2 case distinctions, treesize of input 279 treesize of output 183 [2021-12-17 08:55:25,319 INFO L354 Elim1Store]: treesize reduction 218, result has 35.7 percent of original size [2021-12-17 08:55:25,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 723 treesize of output 753 [2021-12-17 08:55:30,641 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:55:30,641 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 244 treesize of output 296 [2021-12-17 08:55:55,639 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:55:55,640 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 23 treesize of output 35 [2021-12-17 08:55:55,752 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:55:55,753 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 23 treesize of output 35 [2021-12-17 08:55:55,887 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:55:55,887 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 23 treesize of output 35 Killed by 15