./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2n_prepend_equal.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_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 46bbe683d8965e9a855fbd780578b958a816bbdd25bc1fa0d6151e1b826f8669 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-15 23:56:40,766 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 23:56:40,768 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 23:56:40,840 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 23:56:40,840 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 23:56:40,841 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 23:56:40,842 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 23:56:40,843 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 23:56:40,847 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 23:56:40,847 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 23:56:40,848 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 23:56:40,851 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 23:56:40,851 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 23:56:40,852 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 23:56:40,853 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 23:56:40,855 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 23:56:40,856 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 23:56:40,859 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 23:56:40,860 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 23:56:40,861 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 23:56:40,865 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 23:56:40,869 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 23:56:40,869 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 23:56:40,870 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 23:56:40,874 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 23:56:40,879 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 23:56:40,879 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 23:56:40,880 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 23:56:40,880 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 23:56:40,881 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 23:56:40,881 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 23:56:40,881 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 23:56:40,882 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 23:56:40,882 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 23:56:40,883 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 23:56:40,883 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 23:56:40,884 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 23:56:40,885 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 23:56:40,885 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 23:56:40,886 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 23:56:40,886 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 23:56:40,887 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-15 23:56:40,913 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 23:56:40,913 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 23:56:40,913 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 23:56:40,914 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 23:56:40,914 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 23:56:40,914 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 23:56:40,915 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 23:56:40,915 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 23:56:40,915 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 23:56:40,915 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 23:56:40,916 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 23:56:40,916 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 23:56:40,916 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 23:56:40,916 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 23:56:40,917 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-15 23:56:40,917 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 23:56:40,917 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-15 23:56:40,917 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 23:56:40,918 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 23:56:40,918 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 23:56:40,918 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-15 23:56:40,918 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 23:56:40,918 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 23:56:40,918 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 23:56:40,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 23:56:40,919 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 23:56:40,919 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 23:56:40,920 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-15 23:56:40,920 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 23:56:40,920 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 23:56:40,920 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-15 23:56:40,921 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-15 23:56:40,921 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-15 23:56:40,921 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 23:56:40,921 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 -> 46bbe683d8965e9a855fbd780578b958a816bbdd25bc1fa0d6151e1b826f8669 [2021-12-15 23:56:41,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 23:56:41,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 23:56:41,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 23:56:41,180 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 23:56:41,195 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 23:56:41,196 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i [2021-12-15 23:56:41,242 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4049a5d5/74bd5c3a96b746f8b9fed6e59c211e73/FLAG011f441f1 [2021-12-15 23:56:41,594 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 23:56:41,594 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_prepend_equal.i [2021-12-15 23:56:41,604 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4049a5d5/74bd5c3a96b746f8b9fed6e59c211e73/FLAG011f441f1 [2021-12-15 23:56:41,984 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4049a5d5/74bd5c3a96b746f8b9fed6e59c211e73 [2021-12-15 23:56:41,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 23:56:41,988 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 23:56:41,989 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 23:56:41,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 23:56:41,992 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 23:56:41,993 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:56:41" (1/1) ... [2021-12-15 23:56:41,994 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5834cd43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:41, skipping insertion in model container [2021-12-15 23:56:41,994 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:56:41" (1/1) ... [2021-12-15 23:56:42,004 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 23:56:42,033 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 23:56:42,357 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_equal.i[24361,24374] [2021-12-15 23:56:42,362 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 23:56:42,368 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 23:56:42,405 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_equal.i[24361,24374] [2021-12-15 23:56:42,408 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 23:56:42,428 INFO L208 MainTranslator]: Completed translation [2021-12-15 23:56:42,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:42 WrapperNode [2021-12-15 23:56:42,428 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 23:56:42,429 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 23:56:42,430 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 23:56:42,430 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 23:56:42,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:42" (1/1) ... [2021-12-15 23:56:42,457 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:42" (1/1) ... [2021-12-15 23:56:42,480 INFO L137 Inliner]: procedures = 127, calls = 38, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 114 [2021-12-15 23:56:42,480 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 23:56:42,481 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 23:56:42,481 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 23:56:42,481 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 23:56:42,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:42" (1/1) ... [2021-12-15 23:56:42,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:42" (1/1) ... [2021-12-15 23:56:42,494 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:42" (1/1) ... [2021-12-15 23:56:42,494 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:42" (1/1) ... [2021-12-15 23:56:42,498 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:42" (1/1) ... [2021-12-15 23:56:42,501 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:42" (1/1) ... [2021-12-15 23:56:42,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:42" (1/1) ... [2021-12-15 23:56:42,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 23:56:42,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 23:56:42,505 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 23:56:42,506 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 23:56:42,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:42" (1/1) ... [2021-12-15 23:56:42,525 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 23:56:42,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:56:42,552 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-15 23:56:42,569 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-15 23:56:42,580 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-12-15 23:56:42,580 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-12-15 23:56:42,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 23:56:42,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 23:56:42,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 23:56:42,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 23:56:42,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 23:56:42,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-15 23:56:42,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-15 23:56:42,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 23:56:42,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-15 23:56:42,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 23:56:42,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 23:56:42,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 23:56:42,691 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 23:56:42,692 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 23:56:42,719 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-12-15 23:56:42,806 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 23:56:42,810 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 23:56:42,810 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-15 23:56:42,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:56:42 BoogieIcfgContainer [2021-12-15 23:56:42,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 23:56:42,814 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 23:56:42,817 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 23:56:42,819 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 23:56:42,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 11:56:41" (1/3) ... [2021-12-15 23:56:42,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b55609 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:56:42, skipping insertion in model container [2021-12-15 23:56:42,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:56:42" (2/3) ... [2021-12-15 23:56:42,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b55609 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:56:42, skipping insertion in model container [2021-12-15 23:56:42,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:56:42" (3/3) ... [2021-12-15 23:56:42,821 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_equal.i [2021-12-15 23:56:42,825 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 23:56:42,825 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-15 23:56:42,864 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 23:56:42,870 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-15 23:56:42,870 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-15 23:56:42,891 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 25 states have (on average 1.52) internal successors, (38), 27 states have internal predecessors, (38), 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-15 23:56:42,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-15 23:56:42,894 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:56:42,894 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:56:42,894 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:56:42,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:56:42,898 INFO L85 PathProgramCache]: Analyzing trace with hash 692830707, now seen corresponding path program 1 times [2021-12-15 23:56:42,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:56:42,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873937713] [2021-12-15 23:56:42,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:42,904 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:56:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:43,050 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-15 23:56:43,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:56:43,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873937713] [2021-12-15 23:56:43,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873937713] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:56:43,052 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:56:43,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 23:56:43,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260461962] [2021-12-15 23:56:43,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:56:43,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-15 23:56:43,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:56:43,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-15 23:56:43,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 23:56:43,082 INFO L87 Difference]: Start difference. First operand has 29 states, 25 states have (on average 1.52) internal successors, (38), 27 states have internal predecessors, (38), 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 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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-15 23:56:43,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:56:43,096 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2021-12-15 23:56:43,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 23:56:43,097 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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 14 [2021-12-15 23:56:43,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:56:43,101 INFO L225 Difference]: With dead ends: 50 [2021-12-15 23:56:43,101 INFO L226 Difference]: Without dead ends: 20 [2021-12-15 23:56:43,106 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-15 23:56:43,108 INFO L933 BasicCegarLoop]: 36 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, 36 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-15 23:56:43,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:56:43,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-12-15 23:56:43,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-12-15 23:56:43,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 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-15 23:56:43,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2021-12-15 23:56:43,131 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 14 [2021-12-15 23:56:43,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:56:43,132 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2021-12-15 23:56:43,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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-15 23:56:43,132 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2021-12-15 23:56:43,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-15 23:56:43,134 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:56:43,134 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:56:43,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 23:56:43,135 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:56:43,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:56:43,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1759740954, now seen corresponding path program 1 times [2021-12-15 23:56:43,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:56:43,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217309459] [2021-12-15 23:56:43,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:43,137 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:56:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:43,207 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-15 23:56:43,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:56:43,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217309459] [2021-12-15 23:56:43,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217309459] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:56:43,208 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:56:43,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 23:56:43,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472642824] [2021-12-15 23:56:43,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:56:43,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 23:56:43,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:56:43,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 23:56:43,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 23:56:43,211 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-15 23:56:43,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:56:43,223 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2021-12-15 23:56:43,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 23:56:43,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2021-12-15 23:56:43,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:56:43,225 INFO L225 Difference]: With dead ends: 38 [2021-12-15 23:56:43,225 INFO L226 Difference]: Without dead ends: 25 [2021-12-15 23:56:43,226 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-15 23:56:43,229 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 42 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-15 23:56:43,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 42 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:56:43,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-15 23:56:43,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2021-12-15 23:56:43,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 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-15 23:56:43,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2021-12-15 23:56:43,238 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2021-12-15 23:56:43,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:56:43,239 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2021-12-15 23:56:43,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-15 23:56:43,240 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2021-12-15 23:56:43,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-15 23:56:43,244 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:56:43,244 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:56:43,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 23:56:43,244 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:56:43,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:56:43,245 INFO L85 PathProgramCache]: Analyzing trace with hash 675600054, now seen corresponding path program 1 times [2021-12-15 23:56:43,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:56:43,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427629686] [2021-12-15 23:56:43,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:43,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:56:43,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:43,325 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-15 23:56:43,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:56:43,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427629686] [2021-12-15 23:56:43,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427629686] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:56:43,326 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:56:43,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 23:56:43,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844822627] [2021-12-15 23:56:43,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:56:43,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 23:56:43,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:56:43,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 23:56:43,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 23:56:43,328 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-15 23:56:43,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:56:43,344 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2021-12-15 23:56:43,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 23:56:43,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2021-12-15 23:56:43,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:56:43,346 INFO L225 Difference]: With dead ends: 43 [2021-12-15 23:56:43,346 INFO L226 Difference]: Without dead ends: 25 [2021-12-15 23:56:43,346 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-15 23:56:43,351 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 40 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-15 23:56:43,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 40 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:56:43,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-15 23:56:43,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2021-12-15 23:56:43,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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-15 23:56:43,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2021-12-15 23:56:43,357 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 19 [2021-12-15 23:56:43,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:56:43,358 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2021-12-15 23:56:43,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-15 23:56:43,358 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2021-12-15 23:56:43,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-15 23:56:43,358 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:56:43,358 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:56:43,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-15 23:56:43,359 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:56:43,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:56:43,359 INFO L85 PathProgramCache]: Analyzing trace with hash -335517196, now seen corresponding path program 1 times [2021-12-15 23:56:43,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:56:43,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954223139] [2021-12-15 23:56:43,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:43,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:56:43,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:43,412 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-15 23:56:43,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:56:43,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954223139] [2021-12-15 23:56:43,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954223139] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:56:43,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582005581] [2021-12-15 23:56:43,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:43,413 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:56:43,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:56:43,414 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-15 23:56:43,415 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-15 23:56:43,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:43,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-15 23:56:43,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:56:43,555 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-15 23:56:43,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:56:43,594 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-15 23:56:43,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582005581] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 23:56:43,595 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 23:56:43,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-12-15 23:56:43,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708875967] [2021-12-15 23:56:43,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 23:56:43,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 23:56:43,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:56:43,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 23:56:43,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-15 23:56:43,596 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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-15 23:56:43,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:56:43,606 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2021-12-15 23:56:43,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 23:56:43,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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 19 [2021-12-15 23:56:43,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:56:43,607 INFO L225 Difference]: With dead ends: 39 [2021-12-15 23:56:43,607 INFO L226 Difference]: Without dead ends: 26 [2021-12-15 23:56:43,607 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 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-15 23:56:43,608 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 9 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:56:43,608 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 42 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:56:43,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-12-15 23:56:43,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-12-15 23:56:43,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 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-15 23:56:43,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2021-12-15 23:56:43,616 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 19 [2021-12-15 23:56:43,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:56:43,617 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2021-12-15 23:56:43,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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-15 23:56:43,617 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2021-12-15 23:56:43,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-15 23:56:43,617 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:56:43,618 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] [2021-12-15 23:56:43,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-15 23:56:43,835 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-15 23:56:43,835 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:56:43,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:56:43,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1568046744, now seen corresponding path program 1 times [2021-12-15 23:56:43,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:56:43,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326171591] [2021-12-15 23:56:43,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:43,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:56:43,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:44,125 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-15 23:56:44,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:56:44,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326171591] [2021-12-15 23:56:44,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326171591] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:56:44,126 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:56:44,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-15 23:56:44,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868974335] [2021-12-15 23:56:44,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:56:44,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-15 23:56:44,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:56:44,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-15 23:56:44,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-12-15 23:56:44,127 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 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-15 23:56:44,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:56:44,475 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2021-12-15 23:56:44,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-15 23:56:44,476 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 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 24 [2021-12-15 23:56:44,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:56:44,476 INFO L225 Difference]: With dead ends: 34 [2021-12-15 23:56:44,476 INFO L226 Difference]: Without dead ends: 32 [2021-12-15 23:56:44,477 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2021-12-15 23:56:44,477 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 78 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 23:56:44,477 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 38 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 23:56:44,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-12-15 23:56:44,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2021-12-15 23:56:44,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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-15 23:56:44,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2021-12-15 23:56:44,480 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 24 [2021-12-15 23:56:44,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:56:44,480 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2021-12-15 23:56:44,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 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-15 23:56:44,480 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2021-12-15 23:56:44,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-15 23:56:44,481 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:56:44,481 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] [2021-12-15 23:56:44,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-15 23:56:44,481 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:56:44,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:56:44,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1568048418, now seen corresponding path program 1 times [2021-12-15 23:56:44,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:56:44,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53211851] [2021-12-15 23:56:44,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:44,481 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:56:44,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:44,591 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-15 23:56:44,591 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:56:44,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53211851] [2021-12-15 23:56:44,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53211851] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:56:44,591 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:56:44,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 23:56:44,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102608166] [2021-12-15 23:56:44,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:56:44,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 23:56:44,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:56:44,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 23:56:44,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-15 23:56:44,593 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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-15 23:56:44,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:56:44,661 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2021-12-15 23:56:44,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 23:56:44,662 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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 24 [2021-12-15 23:56:44,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:56:44,662 INFO L225 Difference]: With dead ends: 31 [2021-12-15 23:56:44,662 INFO L226 Difference]: Without dead ends: 28 [2021-12-15 23:56:44,662 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-15 23:56:44,663 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 48 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:56:44,663 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 66 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:56:44,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-12-15 23:56:44,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-12-15 23:56:44,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 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-15 23:56:44,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-12-15 23:56:44,666 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 24 [2021-12-15 23:56:44,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:56:44,666 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-12-15 23:56:44,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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-15 23:56:44,667 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-12-15 23:56:44,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-15 23:56:44,667 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:56:44,667 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:56:44,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-15 23:56:44,668 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:56:44,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:56:44,668 INFO L85 PathProgramCache]: Analyzing trace with hash 640634787, now seen corresponding path program 1 times [2021-12-15 23:56:44,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:56:44,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064126876] [2021-12-15 23:56:44,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:44,669 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:56:44,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:45,154 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:56:45,154 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:56:45,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064126876] [2021-12-15 23:56:45,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064126876] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:56:45,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571700035] [2021-12-15 23:56:45,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:56:45,155 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:56:45,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:56:45,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-15 23:56:45,157 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-15 23:56:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:56:45,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 115 conjunts are in the unsatisfiable core [2021-12-15 23:56:45,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:56:45,326 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-15 23:56:45,369 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 23:56:45,369 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-15 23:56:45,517 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-12-15 23:56:45,518 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-15 23:56:45,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:45,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:45,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:45,624 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-15 23:56:45,697 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-15 23:56:45,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:45,921 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-15 23:56:45,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-15 23:56:46,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:46,018 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2021-12-15 23:56:46,022 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-15 23:56:46,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:46,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 32 [2021-12-15 23:56:46,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:46,109 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 23:56:46,109 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 35 [2021-12-15 23:56:46,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-15 23:56:46,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:46,153 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 23:56:46,154 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-12-15 23:56:46,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:46,258 INFO L354 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2021-12-15 23:56:46,259 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-15 23:56:46,274 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 23:56:46,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:46,276 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-15 23:56:46,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:46,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:46,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:46,283 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-15 23:56:46,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:46,362 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 50 treesize of output 33 [2021-12-15 23:56:46,366 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-15 23:56:46,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:46,370 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 34 treesize of output 25 [2021-12-15 23:56:46,497 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 23:56:46,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:46,500 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 23:56:46,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 50 [2021-12-15 23:56:46,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:56:46,508 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-15 23:56:46,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2021-12-15 23:56:46,574 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 23:56:46,606 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:56:46,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:56:46,910 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_569 (Array Int Int)) (v_ArrVal_572 (Array Int Int)) (v_ArrVal_568 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 ((.cse3 (let ((.cse8 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_569))) (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| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|)))) (.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_567))) (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_dll_prepend_~new_head~1#1.base|))))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse1 (select (select .cse6 .cse4) .cse5)) (.cse2 (select (select .cse3 .cse4) .cse5))) (or (= (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_568)) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_572) .cse1) .cse2) |c_ULTIMATE.start_main_~data~0#1|) (and (= .cse1 0) (= .cse2 0)))))))) is different from false [2021-12-15 23:56:47,012 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_569 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_572 (Array Int Int)) (v_ArrVal_568 Int)) (let ((.cse12 (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4))) (let ((.cse10 (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|) .cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse4 (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|) .cse12 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|)))) (.cse3 (select (select .cse10 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse5 (let ((.cse11 (store .cse4 .cse3 v_ArrVal_569))) (store .cse11 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse11 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_#res#1.offset|)))) (.cse8 (let ((.cse9 (store .cse10 .cse3 v_ArrVal_567))) (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| |c_ULTIMATE.start_node_create_#res#1.base|))))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse1 (select (select .cse8 .cse6) .cse7)) (.cse0 (select (select .cse5 .cse6) .cse7))) (or (and (= .cse0 0) (= .cse1 0)) (= (select (select (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_562))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (select (select .cse4 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|) 8) v_ArrVal_568))) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_572) .cse1) .cse0) |c_ULTIMATE.start_main_~data~0#1|))))))))) is different from false [2021-12-15 23:56:49,137 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_555 Int) (v_ArrVal_567 (Array Int Int)) (v_ArrVal_553 Int) (v_ArrVal_569 (Array Int Int)) (v_ArrVal_551 Int) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_572 (Array Int Int)) (v_ArrVal_568 Int) (v_ArrVal_556 Int)) (let ((.cse13 (+ |c_ULTIMATE.start_node_create_~temp~0#1.offset| 4)) (.cse14 (+ |c_ULTIMATE.start_node_create_~temp~0#1.offset| 8))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (let ((.cse15 (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse13 0) .cse14 v_ArrVal_556) |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_ArrVal_555))) (store .cse15 .cse13 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse15) |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| (let ((.cse12 (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse13 0) .cse14 v_ArrVal_553) |c_ULTIMATE.start_node_create_~temp~0#1.offset| v_ArrVal_551))) (store .cse12 .cse13 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse12) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (.cse1 (select (select .cse10 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse8 (let ((.cse11 (store .cse2 .cse1 v_ArrVal_569))) (store .cse11 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse11 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|)))) (.cse5 (let ((.cse9 (store .cse10 .cse1 v_ArrVal_567))) (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| |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse4 (select (select .cse8 .cse6) .cse7)) (.cse3 (select (select .cse5 .cse6) .cse7))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_562))) (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_568))) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_572) .cse3) .cse4) |c_ULTIMATE.start_main_~data~0#1|) (and (= .cse4 0) (= .cse3 0)))))))))) is different from false [2021-12-15 23:56:53,826 INFO L354 Elim1Store]: treesize reduction 465, result has 33.3 percent of original size [2021-12-15 23:56:53,828 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 16 case distinctions, treesize of input 2938579 treesize of output 2328374 [2021-12-15 23:57:44,986 WARN L227 SmtUtils]: Spent 47.83s on a formula simplification. DAG size of input: 125 DAG size of output: 85 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-12-15 23:57:44,987 INFO L354 Elim1Store]: treesize reduction 465, result has 33.3 percent of original size [2021-12-15 23:57:44,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 16 case distinctions, treesize of input 284876755 treesize of output 206623926