./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-optional-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/forester-heap/sll-optional-1.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 8b0f1d623fff7bbdf74e6250d2f53fb98e44ca7ba1aae1265f5b0871b427fba0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:52:02,734 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:52:02,735 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:52:02,765 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:52:02,765 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:52:02,768 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:52:02,769 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:52:02,774 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:52:02,775 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:52:02,778 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:52:02,779 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:52:02,780 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:52:02,780 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:52:02,782 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:52:02,783 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:52:02,785 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:52:02,785 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:52:02,786 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:52:02,789 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:52:02,794 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:52:02,795 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:52:02,796 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:52:02,797 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:52:02,798 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:52:02,802 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:52:02,802 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:52:02,802 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:52:02,804 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:52:02,804 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:52:02,804 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:52:02,805 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:52:02,805 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:52:02,806 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:52:02,807 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:52:02,808 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:52:02,808 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:52:02,809 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:52:02,809 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:52:02,809 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:52:02,810 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:52:02,811 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:52:02,811 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:52:02,834 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:52:02,836 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:52:02,836 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:52:02,836 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:52:02,837 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:52:02,837 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:52:02,838 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:52:02,838 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:52:02,838 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:52:02,838 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:52:02,839 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:52:02,839 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:52:02,839 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:52:02,839 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:52:02,840 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:52:02,840 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:52:02,840 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:52:02,840 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:52:02,840 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:52:02,840 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:52:02,840 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:52:02,840 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:52:02,841 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:52:02,841 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:52:02,841 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:52:02,841 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:52:02,841 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:52:02,841 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:52:02,841 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:52:02,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:52:02,842 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:52:02,842 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:52:02,842 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:52:02,842 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 -> 8b0f1d623fff7bbdf74e6250d2f53fb98e44ca7ba1aae1265f5b0871b427fba0 [2022-02-20 16:52:03,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:52:03,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:52:03,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:52:03,036 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:52:03,036 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:52:03,037 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-optional-1.i [2022-02-20 16:52:03,127 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/702617feb/f4ac840c6f4f4e048c69cf259876a448/FLAG9bc14840a [2022-02-20 16:52:03,511 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:52:03,511 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-optional-1.i [2022-02-20 16:52:03,523 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/702617feb/f4ac840c6f4f4e048c69cf259876a448/FLAG9bc14840a [2022-02-20 16:52:03,906 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/702617feb/f4ac840c6f4f4e048c69cf259876a448 [2022-02-20 16:52:03,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:52:03,911 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:52:03,914 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:52:03,914 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:52:03,916 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:52:03,917 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:52:03" (1/1) ... [2022-02-20 16:52:03,919 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26061065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:52:03, skipping insertion in model container [2022-02-20 16:52:03,919 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:52:03" (1/1) ... [2022-02-20 16:52:03,924 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:52:03,955 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:52:04,182 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/forester-heap/sll-optional-1.i[22688,22701] [2022-02-20 16:52:04,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:52:04,198 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:52:04,229 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/forester-heap/sll-optional-1.i[22688,22701] [2022-02-20 16:52:04,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:52:04,272 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:52:04,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:52:04 WrapperNode [2022-02-20 16:52:04,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:52:04,273 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:52:04,273 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:52:04,273 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:52:04,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:52:04" (1/1) ... [2022-02-20 16:52:04,295 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:52:04" (1/1) ... [2022-02-20 16:52:04,316 INFO L137 Inliner]: procedures = 119, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 130 [2022-02-20 16:52:04,317 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:52:04,317 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:52:04,317 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:52:04,318 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:52:04,323 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:52:04" (1/1) ... [2022-02-20 16:52:04,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:52:04" (1/1) ... [2022-02-20 16:52:04,326 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:52:04" (1/1) ... [2022-02-20 16:52:04,326 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:52:04" (1/1) ... [2022-02-20 16:52:04,338 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:52:04" (1/1) ... [2022-02-20 16:52:04,341 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:52:04" (1/1) ... [2022-02-20 16:52:04,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:52:04" (1/1) ... [2022-02-20 16:52:04,352 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:52:04,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:52:04,353 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:52:04,353 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:52:04,354 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:52:04" (1/1) ... [2022-02-20 16:52:04,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:52:04,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:52:04,374 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:52:04,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:52:04,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:52:04,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:52:04,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 16:52:04,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:52:04,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 16:52:04,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 16:52:04,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:52:04,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:52:04,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:52:04,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:52:04,488 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:52:04,489 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:52:04,720 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:52:04,725 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:52:04,725 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-02-20 16:52:04,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:52:04 BoogieIcfgContainer [2022-02-20 16:52:04,727 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:52:04,728 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:52:04,728 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:52:04,730 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:52:04,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:52:03" (1/3) ... [2022-02-20 16:52:04,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ce78846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:52:04, skipping insertion in model container [2022-02-20 16:52:04,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:52:04" (2/3) ... [2022-02-20 16:52:04,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ce78846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:52:04, skipping insertion in model container [2022-02-20 16:52:04,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:52:04" (3/3) ... [2022-02-20 16:52:04,733 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-optional-1.i [2022-02-20 16:52:04,736 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:52:04,736 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:52:04,776 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:52:04,782 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 [2022-02-20 16:52:04,783 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:52:04,794 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 29 states have internal predecessors, (46), 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) [2022-02-20 16:52:04,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:52:04,797 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:52:04,797 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:52:04,798 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:52:04,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:52:04,801 INFO L85 PathProgramCache]: Analyzing trace with hash 573386926, now seen corresponding path program 1 times [2022-02-20 16:52:04,807 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:52:04,808 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329587313] [2022-02-20 16:52:04,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:52:04,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:52:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:52:04,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {33#true} is VALID [2022-02-20 16:52:05,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~nondet6#1, main_#t~mem13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~short15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~short18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~short20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {33#true} is VALID [2022-02-20 16:52:05,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1;call write~int(2, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~head~0#1.base, 4 + main_~head~0#1.offset, 4);call write~$Pointer$(0, 0, main_#t~mem4#1.base, main_#t~mem4#1.offset, 4);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {33#true} is VALID [2022-02-20 16:52:05,001 INFO L290 TraceCheckUtils]: 3: Hoare triple {33#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {33#true} is VALID [2022-02-20 16:52:05,002 INFO L290 TraceCheckUtils]: 4: Hoare triple {33#true} assume !true; {34#false} is VALID [2022-02-20 16:52:05,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#false} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {34#false} is VALID [2022-02-20 16:52:05,003 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#false} assume !!(main_~x~0#1.base != 0 || main_~x~0#1.offset != 0); {34#false} is VALID [2022-02-20 16:52:05,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#false} call main_#t~mem13#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4);main_#t~short15#1 := 2 == main_#t~mem13#1; {34#false} is VALID [2022-02-20 16:52:05,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#false} assume main_#t~short15#1;call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~x~0#1.base, 4 + main_~x~0#1.offset, 4);main_#t~short15#1 := main_#t~mem14#1.base != main_~x~0#1.base || main_#t~mem14#1.offset != main_~x~0#1.offset; {34#false} is VALID [2022-02-20 16:52:05,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} main_#t~short18#1 := main_#t~short15#1; {34#false} is VALID [2022-02-20 16:52:05,004 INFO L290 TraceCheckUtils]: 10: Hoare triple {34#false} assume !main_#t~short18#1; {34#false} is VALID [2022-02-20 16:52:05,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {34#false} main_#t~short20#1 := main_#t~short18#1; {34#false} is VALID [2022-02-20 16:52:05,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#false} assume main_#t~short20#1; {34#false} is VALID [2022-02-20 16:52:05,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {34#false} assume !main_#t~short20#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1.base, main_#t~mem14#1.offset;havoc main_#t~short15#1;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~short18#1;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~short20#1; {34#false} is VALID [2022-02-20 16:52:05,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-02-20 16:52:05,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:52:05,007 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:52:05,007 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329587313] [2022-02-20 16:52:05,008 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329587313] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:52:05,008 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:52:05,008 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:52:05,010 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61822913] [2022-02-20 16:52:05,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:52:05,016 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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 15 [2022-02-20 16:52:05,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:52:05,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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) [2022-02-20 16:52:05,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:52:05,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:52:05,045 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:52:05,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:52:05,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:52:05,065 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 29 states have internal predecessors, (46), 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) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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) [2022-02-20 16:52:05,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:52:05,118 INFO L93 Difference]: Finished difference Result 51 states and 77 transitions. [2022-02-20 16:52:05,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:52:05,119 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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 15 [2022-02-20 16:52:05,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:52:05,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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) [2022-02-20 16:52:05,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 77 transitions. [2022-02-20 16:52:05,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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) [2022-02-20 16:52:05,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 77 transitions. [2022-02-20 16:52:05,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 77 transitions. [2022-02-20 16:52:05,206 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:52:05,214 INFO L225 Difference]: With dead ends: 51 [2022-02-20 16:52:05,214 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 16:52:05,216 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 [2022-02-20 16:52:05,218 INFO L933 BasicCegarLoop]: 40 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, 40 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:52:05,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:52:05,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 16:52:05,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 16:52:05,238 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:52:05,238 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 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) [2022-02-20 16:52:05,239 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 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) [2022-02-20 16:52:05,240 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 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) [2022-02-20 16:52:05,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:52:05,244 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2022-02-20 16:52:05,244 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2022-02-20 16:52:05,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:52:05,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:52:05,246 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 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) Second operand 22 states. [2022-02-20 16:52:05,246 INFO L87 Difference]: Start difference. First operand has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 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) Second operand 22 states. [2022-02-20 16:52:05,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:52:05,248 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2022-02-20 16:52:05,248 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2022-02-20 16:52:05,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:52:05,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:52:05,249 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:52:05,249 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:52:05,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 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) [2022-02-20 16:52:05,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2022-02-20 16:52:05,251 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 15 [2022-02-20 16:52:05,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:52:05,252 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2022-02-20 16:52:05,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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) [2022-02-20 16:52:05,254 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2022-02-20 16:52:05,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 16:52:05,255 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:52:05,255 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:52:05,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:52:05,256 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:52:05,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:52:05,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1170055612, now seen corresponding path program 1 times [2022-02-20 16:52:05,258 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:52:05,263 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963461569] [2022-02-20 16:52:05,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:52:05,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:52:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:52:05,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {166#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {166#true} is VALID [2022-02-20 16:52:05,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {166#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~nondet6#1, main_#t~mem13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~short15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~short18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~short20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {166#true} is VALID [2022-02-20 16:52:05,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {166#true} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1;call write~int(2, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~head~0#1.base, 4 + main_~head~0#1.offset, 4);call write~$Pointer$(0, 0, main_#t~mem4#1.base, main_#t~mem4#1.offset, 4);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {166#true} is VALID [2022-02-20 16:52:05,372 INFO L290 TraceCheckUtils]: 3: Hoare triple {166#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {166#true} is VALID [2022-02-20 16:52:05,373 INFO L290 TraceCheckUtils]: 4: Hoare triple {166#true} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {166#true} is VALID [2022-02-20 16:52:05,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {166#true} assume !(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1; {166#true} is VALID [2022-02-20 16:52:05,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {166#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {166#true} is VALID [2022-02-20 16:52:05,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {166#true} assume !!(main_~x~0#1.base != 0 || main_~x~0#1.offset != 0); {166#true} is VALID [2022-02-20 16:52:05,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {166#true} call main_#t~mem13#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4);main_#t~short15#1 := 2 == main_#t~mem13#1; {166#true} is VALID [2022-02-20 16:52:05,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {166#true} assume main_#t~short15#1;call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~x~0#1.base, 4 + main_~x~0#1.offset, 4);main_#t~short15#1 := main_#t~mem14#1.base != main_~x~0#1.base || main_#t~mem14#1.offset != main_~x~0#1.offset; {166#true} is VALID [2022-02-20 16:52:05,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {166#true} main_#t~short18#1 := main_#t~short15#1; {166#true} is VALID [2022-02-20 16:52:05,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {166#true} assume !main_#t~short18#1; {168#(not |ULTIMATE.start_main_#t~short18#1|)} is VALID [2022-02-20 16:52:05,376 INFO L290 TraceCheckUtils]: 12: Hoare triple {168#(not |ULTIMATE.start_main_#t~short18#1|)} main_#t~short20#1 := main_#t~short18#1; {169#(not |ULTIMATE.start_main_#t~short20#1|)} is VALID [2022-02-20 16:52:05,376 INFO L290 TraceCheckUtils]: 13: Hoare triple {169#(not |ULTIMATE.start_main_#t~short20#1|)} assume main_#t~short20#1; {167#false} is VALID [2022-02-20 16:52:05,376 INFO L290 TraceCheckUtils]: 14: Hoare triple {167#false} assume !main_#t~short20#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1.base, main_#t~mem14#1.offset;havoc main_#t~short15#1;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~short18#1;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~short20#1; {167#false} is VALID [2022-02-20 16:52:05,377 INFO L290 TraceCheckUtils]: 15: Hoare triple {167#false} assume !false; {167#false} is VALID [2022-02-20 16:52:05,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:52:05,377 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:52:05,377 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963461569] [2022-02-20 16:52:05,378 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963461569] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:52:05,378 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:52:05,378 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:52:05,378 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87532617] [2022-02-20 16:52:05,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:52:05,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2022-02-20 16:52:05,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:52:05,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) [2022-02-20 16:52:05,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:52:05,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:52:05,394 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:52:05,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:52:05,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:52:05,396 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) [2022-02-20 16:52:05,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:52:05,483 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2022-02-20 16:52:05,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:52:05,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2022-02-20 16:52:05,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:52:05,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) [2022-02-20 16:52:05,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-02-20 16:52:05,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) [2022-02-20 16:52:05,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-02-20 16:52:05,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2022-02-20 16:52:05,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:52:05,529 INFO L225 Difference]: With dead ends: 37 [2022-02-20 16:52:05,529 INFO L226 Difference]: Without dead ends: 25 [2022-02-20 16:52:05,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:52:05,537 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:52:05,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 75 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:52:05,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-20 16:52:05,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-02-20 16:52:05,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:52:05,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 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) [2022-02-20 16:52:05,540 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 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) [2022-02-20 16:52:05,540 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 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) [2022-02-20 16:52:05,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:52:05,542 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2022-02-20 16:52:05,542 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2022-02-20 16:52:05,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:52:05,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:52:05,544 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 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) Second operand 25 states. [2022-02-20 16:52:05,544 INFO L87 Difference]: Start difference. First operand has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 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) Second operand 25 states. [2022-02-20 16:52:05,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:52:05,546 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2022-02-20 16:52:05,546 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2022-02-20 16:52:05,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:52:05,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:52:05,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:52:05,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:52:05,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 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) [2022-02-20 16:52:05,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2022-02-20 16:52:05,548 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 16 [2022-02-20 16:52:05,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:52:05,549 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2022-02-20 16:52:05,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) [2022-02-20 16:52:05,550 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2022-02-20 16:52:05,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 16:52:05,550 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:52:05,550 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:52:05,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:52:05,551 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:52:05,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:52:05,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1170053690, now seen corresponding path program 1 times [2022-02-20 16:52:05,552 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:52:05,552 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300568568] [2022-02-20 16:52:05,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:52:05,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:52:05,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:52:05,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {293#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {293#true} is VALID [2022-02-20 16:52:05,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {293#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~nondet6#1, main_#t~mem13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~short15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~short18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~short20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {293#true} is VALID [2022-02-20 16:52:05,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {293#true} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1;call write~int(2, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~head~0#1.base, 4 + main_~head~0#1.offset, 4);call write~$Pointer$(0, 0, main_#t~mem4#1.base, main_#t~mem4#1.offset, 4);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {293#true} is VALID [2022-02-20 16:52:05,644 INFO L290 TraceCheckUtils]: 3: Hoare triple {293#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {293#true} is VALID [2022-02-20 16:52:05,644 INFO L290 TraceCheckUtils]: 4: Hoare triple {293#true} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {293#true} is VALID [2022-02-20 16:52:05,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {293#true} assume !(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1; {293#true} is VALID [2022-02-20 16:52:05,645 INFO L290 TraceCheckUtils]: 6: Hoare triple {293#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {293#true} is VALID [2022-02-20 16:52:05,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {293#true} assume !!(main_~x~0#1.base != 0 || main_~x~0#1.offset != 0); {293#true} is VALID [2022-02-20 16:52:05,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {293#true} call main_#t~mem13#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4);main_#t~short15#1 := 2 == main_#t~mem13#1; {293#true} is VALID [2022-02-20 16:52:05,646 INFO L290 TraceCheckUtils]: 9: Hoare triple {293#true} assume main_#t~short15#1;call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~x~0#1.base, 4 + main_~x~0#1.offset, 4);main_#t~short15#1 := main_#t~mem14#1.base != main_~x~0#1.base || main_#t~mem14#1.offset != main_~x~0#1.offset; {295#(or |ULTIMATE.start_main_#t~short15#1| (and (= |ULTIMATE.start_main_~x~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|)))} is VALID [2022-02-20 16:52:05,647 INFO L290 TraceCheckUtils]: 10: Hoare triple {295#(or |ULTIMATE.start_main_#t~short15#1| (and (= |ULTIMATE.start_main_~x~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|)))} main_#t~short18#1 := main_#t~short15#1; {296#(or |ULTIMATE.start_main_#t~short18#1| (and (= |ULTIMATE.start_main_~x~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|)))} is VALID [2022-02-20 16:52:05,647 INFO L290 TraceCheckUtils]: 11: Hoare triple {296#(or |ULTIMATE.start_main_#t~short18#1| (and (= |ULTIMATE.start_main_~x~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|)))} assume !main_#t~short18#1; {297#(and (= |ULTIMATE.start_main_~x~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|))} is VALID [2022-02-20 16:52:05,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {297#(and (= |ULTIMATE.start_main_~x~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|))} main_#t~short20#1 := main_#t~short18#1; {297#(and (= |ULTIMATE.start_main_~x~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|))} is VALID [2022-02-20 16:52:05,648 INFO L290 TraceCheckUtils]: 13: Hoare triple {297#(and (= |ULTIMATE.start_main_~x~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|))} assume !main_#t~short20#1;call main_#t~mem19#1.base, main_#t~mem19#1.offset := read~$Pointer$(main_~x~0#1.base, 4 + main_~x~0#1.offset, 4);main_#t~short20#1 := main_#t~mem19#1.base == main_~x~0#1.base && main_#t~mem19#1.offset == main_~x~0#1.offset; {298#|ULTIMATE.start_main_#t~short20#1|} is VALID [2022-02-20 16:52:05,649 INFO L290 TraceCheckUtils]: 14: Hoare triple {298#|ULTIMATE.start_main_#t~short20#1|} assume !main_#t~short20#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1.base, main_#t~mem14#1.offset;havoc main_#t~short15#1;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~short18#1;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~short20#1; {294#false} is VALID [2022-02-20 16:52:05,649 INFO L290 TraceCheckUtils]: 15: Hoare triple {294#false} assume !false; {294#false} is VALID [2022-02-20 16:52:05,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:52:05,649 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:52:05,650 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300568568] [2022-02-20 16:52:05,650 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300568568] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:52:05,650 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:52:05,650 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:52:05,651 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949417360] [2022-02-20 16:52:05,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:52:05,651 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 16 [2022-02-20 16:52:05,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:52:05,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) [2022-02-20 16:52:05,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:52:05,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:52:05,668 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:52:05,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:52:05,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:52:05,669 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) [2022-02-20 16:52:05,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:52:05,931 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-02-20 16:52:05,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 16:52:05,931 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 16 [2022-02-20 16:52:05,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:52:05,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) [2022-02-20 16:52:05,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-02-20 16:52:05,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) [2022-02-20 16:52:05,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-02-20 16:52:05,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 53 transitions. [2022-02-20 16:52:05,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:52:05,973 INFO L225 Difference]: With dead ends: 41 [2022-02-20 16:52:05,973 INFO L226 Difference]: Without dead ends: 39 [2022-02-20 16:52:05,973 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-20 16:52:05,974 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 12 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:52:05,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 81 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:52:05,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-20 16:52:05,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 29. [2022-02-20 16:52:05,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:52:05,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 29 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:52:05,977 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 29 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:52:05,978 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 29 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:52:05,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:52:05,979 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2022-02-20 16:52:05,979 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2022-02-20 16:52:05,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:52:05,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:52:05,980 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 39 states. [2022-02-20 16:52:05,980 INFO L87 Difference]: Start difference. First operand has 29 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 39 states. [2022-02-20 16:52:05,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:52:05,981 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2022-02-20 16:52:05,981 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2022-02-20 16:52:05,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:52:05,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:52:05,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:52:05,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:52:05,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:52:05,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2022-02-20 16:52:05,982 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 16 [2022-02-20 16:52:05,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:52:05,983 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2022-02-20 16:52:05,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) [2022-02-20 16:52:05,983 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2022-02-20 16:52:05,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 16:52:05,983 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:52:05,984 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:52:05,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:52:05,984 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:52:05,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:52:05,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1171900732, now seen corresponding path program 1 times [2022-02-20 16:52:05,984 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:52:05,985 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145904630] [2022-02-20 16:52:05,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:52:05,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:52:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:52:06,135 INFO L290 TraceCheckUtils]: 0: Hoare triple {462#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {462#true} is VALID [2022-02-20 16:52:06,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {462#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~nondet6#1, main_#t~mem13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~short15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~short18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~short20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {464#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 16:52:06,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {464#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1;call write~int(2, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~head~0#1.base, 4 + main_~head~0#1.offset, 4);call write~$Pointer$(0, 0, main_#t~mem4#1.base, main_#t~mem4#1.offset, 4);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {465#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= |ULTIMATE.start_main_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0))} is VALID [2022-02-20 16:52:06,140 INFO L290 TraceCheckUtils]: 3: Hoare triple {465#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= |ULTIMATE.start_main_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {465#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= |ULTIMATE.start_main_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0))} is VALID [2022-02-20 16:52:06,141 INFO L290 TraceCheckUtils]: 4: Hoare triple {465#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= |ULTIMATE.start_main_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0))} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {465#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= |ULTIMATE.start_main_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0))} is VALID [2022-02-20 16:52:06,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {465#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= |ULTIMATE.start_main_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0))} assume !(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1; {465#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= |ULTIMATE.start_main_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0))} is VALID [2022-02-20 16:52:06,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {465#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= |ULTIMATE.start_main_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {466#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0))} is VALID [2022-02-20 16:52:06,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {466#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0))} assume !!(main_~x~0#1.base != 0 || main_~x~0#1.offset != 0); {466#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0))} is VALID [2022-02-20 16:52:06,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {466#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0))} call main_#t~mem13#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4);main_#t~short15#1 := 2 == main_#t~mem13#1; {466#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0))} is VALID [2022-02-20 16:52:06,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {466#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0))} assume main_#t~short15#1;call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~x~0#1.base, 4 + main_~x~0#1.offset, 4);main_#t~short15#1 := main_#t~mem14#1.base != main_~x~0#1.base || main_#t~mem14#1.offset != main_~x~0#1.offset; {467#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} is VALID [2022-02-20 16:52:06,146 INFO L290 TraceCheckUtils]: 10: Hoare triple {467#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} main_#t~short18#1 := main_#t~short15#1; {467#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} is VALID [2022-02-20 16:52:06,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {467#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} assume main_#t~short18#1;call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~x~0#1.base, 4 + main_~x~0#1.offset, 4);call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_#t~mem16#1.base, main_#t~mem16#1.offset, 4);main_#t~short18#1 := main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0; {468#|ULTIMATE.start_main_#t~short18#1|} is VALID [2022-02-20 16:52:06,147 INFO L290 TraceCheckUtils]: 12: Hoare triple {468#|ULTIMATE.start_main_#t~short18#1|} main_#t~short20#1 := main_#t~short18#1; {469#|ULTIMATE.start_main_#t~short20#1|} is VALID [2022-02-20 16:52:06,148 INFO L290 TraceCheckUtils]: 13: Hoare triple {469#|ULTIMATE.start_main_#t~short20#1|} assume !main_#t~short20#1;call main_#t~mem19#1.base, main_#t~mem19#1.offset := read~$Pointer$(main_~x~0#1.base, 4 + main_~x~0#1.offset, 4);main_#t~short20#1 := main_#t~mem19#1.base == main_~x~0#1.base && main_#t~mem19#1.offset == main_~x~0#1.offset; {463#false} is VALID [2022-02-20 16:52:06,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {463#false} assume !main_#t~short20#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1.base, main_#t~mem14#1.offset;havoc main_#t~short15#1;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~short18#1;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~short20#1; {463#false} is VALID [2022-02-20 16:52:06,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {463#false} assume !false; {463#false} is VALID [2022-02-20 16:52:06,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:52:06,149 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:52:06,149 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145904630] [2022-02-20 16:52:06,149 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145904630] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:52:06,149 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:52:06,149 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 16:52:06,149 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065562484] [2022-02-20 16:52:06,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:52:06,149 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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 16 [2022-02-20 16:52:06,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:52:06,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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) [2022-02-20 16:52:06,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:52:06,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 16:52:06,165 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:52:06,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 16:52:06,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:52:06,166 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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) [2022-02-20 16:52:06,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:52:06,691 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2022-02-20 16:52:06,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 16:52:06,691 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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 16 [2022-02-20 16:52:06,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:52:06,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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) [2022-02-20 16:52:06,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 85 transitions. [2022-02-20 16:52:06,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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) [2022-02-20 16:52:06,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 85 transitions. [2022-02-20 16:52:06,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 85 transitions. [2022-02-20 16:52:06,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:52:06,776 INFO L225 Difference]: With dead ends: 93 [2022-02-20 16:52:06,776 INFO L226 Difference]: Without dead ends: 74 [2022-02-20 16:52:06,776 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-02-20 16:52:06,777 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 90 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 16:52:06,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 102 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 16:52:06,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-02-20 16:52:06,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 42. [2022-02-20 16:52:06,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:52:06,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 42 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 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) [2022-02-20 16:52:06,782 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 42 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 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) [2022-02-20 16:52:06,782 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 42 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 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) [2022-02-20 16:52:06,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:52:06,783 INFO L93 Difference]: Finished difference Result 74 states and 91 transitions. [2022-02-20 16:52:06,783 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2022-02-20 16:52:06,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:52:06,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:52:06,784 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 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) Second operand 74 states. [2022-02-20 16:52:06,784 INFO L87 Difference]: Start difference. First operand has 42 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 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) Second operand 74 states. [2022-02-20 16:52:06,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:52:06,786 INFO L93 Difference]: Finished difference Result 74 states and 91 transitions. [2022-02-20 16:52:06,786 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2022-02-20 16:52:06,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:52:06,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:52:06,786 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:52:06,786 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:52:06,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 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) [2022-02-20 16:52:06,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2022-02-20 16:52:06,787 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 16 [2022-02-20 16:52:06,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:52:06,788 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2022-02-20 16:52:06,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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) [2022-02-20 16:52:06,788 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2022-02-20 16:52:06,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 16:52:06,803 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:52:06,803 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:52:06,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 16:52:06,804 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:52:06,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:52:06,804 INFO L85 PathProgramCache]: Analyzing trace with hash 604953672, now seen corresponding path program 1 times [2022-02-20 16:52:06,804 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:52:06,804 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643439224] [2022-02-20 16:52:06,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:52:06,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:52:06,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:52:06,880 INFO L290 TraceCheckUtils]: 0: Hoare triple {783#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {783#true} is VALID [2022-02-20 16:52:06,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {783#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~nondet6#1, main_#t~mem13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~short15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~short18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~short20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {785#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 16:52:06,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {785#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1;call write~int(2, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~head~0#1.base, 4 + main_~head~0#1.offset, 4);call write~$Pointer$(0, 0, main_#t~mem4#1.base, main_#t~mem4#1.offset, 4);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {786#(= 2 (select (select |#memory_int| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 8)))} is VALID [2022-02-20 16:52:06,883 INFO L290 TraceCheckUtils]: 3: Hoare triple {786#(= 2 (select (select |#memory_int| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 8)))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {786#(= 2 (select (select |#memory_int| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 8)))} is VALID [2022-02-20 16:52:06,884 INFO L290 TraceCheckUtils]: 4: Hoare triple {786#(= 2 (select (select |#memory_int| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 8)))} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {786#(= 2 (select (select |#memory_int| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 8)))} is VALID [2022-02-20 16:52:06,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {786#(= 2 (select (select |#memory_int| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 8)))} assume !(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1; {786#(= 2 (select (select |#memory_int| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 8)))} is VALID [2022-02-20 16:52:06,884 INFO L290 TraceCheckUtils]: 6: Hoare triple {786#(= 2 (select (select |#memory_int| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 8)))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {787#(= 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-20 16:52:06,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {787#(= 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)))} assume !!(main_~x~0#1.base != 0 || main_~x~0#1.offset != 0); {787#(= 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-20 16:52:06,886 INFO L290 TraceCheckUtils]: 8: Hoare triple {787#(= 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)))} call main_#t~mem13#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4);main_#t~short15#1 := 2 == main_#t~mem13#1; {788#|ULTIMATE.start_main_#t~short15#1|} is VALID [2022-02-20 16:52:06,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {788#|ULTIMATE.start_main_#t~short15#1|} assume !main_#t~short15#1; {784#false} is VALID [2022-02-20 16:52:06,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {784#false} main_#t~short18#1 := main_#t~short15#1; {784#false} is VALID [2022-02-20 16:52:06,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {784#false} assume !main_#t~short18#1; {784#false} is VALID [2022-02-20 16:52:06,887 INFO L290 TraceCheckUtils]: 12: Hoare triple {784#false} main_#t~short20#1 := main_#t~short18#1; {784#false} is VALID [2022-02-20 16:52:06,887 INFO L290 TraceCheckUtils]: 13: Hoare triple {784#false} assume !main_#t~short20#1;call main_#t~mem19#1.base, main_#t~mem19#1.offset := read~$Pointer$(main_~x~0#1.base, 4 + main_~x~0#1.offset, 4);main_#t~short20#1 := main_#t~mem19#1.base == main_~x~0#1.base && main_#t~mem19#1.offset == main_~x~0#1.offset; {784#false} is VALID [2022-02-20 16:52:06,887 INFO L290 TraceCheckUtils]: 14: Hoare triple {784#false} assume !main_#t~short20#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1.base, main_#t~mem14#1.offset;havoc main_#t~short15#1;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~short18#1;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~short20#1; {784#false} is VALID [2022-02-20 16:52:06,887 INFO L290 TraceCheckUtils]: 15: Hoare triple {784#false} assume !false; {784#false} is VALID [2022-02-20 16:52:06,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:52:06,887 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:52:06,888 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643439224] [2022-02-20 16:52:06,888 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643439224] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:52:06,888 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:52:06,888 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:52:06,888 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62531920] [2022-02-20 16:52:06,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:52:06,889 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 16 [2022-02-20 16:52:06,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:52:06,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) [2022-02-20 16:52:06,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:52:06,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:52:06,901 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:52:06,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:52:06,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:52:06,902 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) [2022-02-20 16:52:07,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:52:07,119 INFO L93 Difference]: Finished difference Result 87 states and 108 transitions. [2022-02-20 16:52:07,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:52:07,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 16 [2022-02-20 16:52:07,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:52:07,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) [2022-02-20 16:52:07,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-02-20 16:52:07,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) [2022-02-20 16:52:07,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-02-20 16:52:07,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 78 transitions. [2022-02-20 16:52:07,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:52:07,178 INFO L225 Difference]: With dead ends: 87 [2022-02-20 16:52:07,178 INFO L226 Difference]: Without dead ends: 64 [2022-02-20 16:52:07,178 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 16:52:07,179 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 74 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:52:07,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 73 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:52:07,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-02-20 16:52:07,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 40. [2022-02-20 16:52:07,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:52:07,183 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 40 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 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) [2022-02-20 16:52:07,183 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 40 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 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) [2022-02-20 16:52:07,183 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 40 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 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) [2022-02-20 16:52:07,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:52:07,184 INFO L93 Difference]: Finished difference Result 64 states and 79 transitions. [2022-02-20 16:52:07,184 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2022-02-20 16:52:07,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:52:07,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:52:07,185 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 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) Second operand 64 states. [2022-02-20 16:52:07,185 INFO L87 Difference]: Start difference. First operand has 40 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 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) Second operand 64 states. [2022-02-20 16:52:07,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:52:07,186 INFO L93 Difference]: Finished difference Result 64 states and 79 transitions. [2022-02-20 16:52:07,186 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2022-02-20 16:52:07,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:52:07,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:52:07,187 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:52:07,187 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:52:07,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 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) [2022-02-20 16:52:07,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2022-02-20 16:52:07,188 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 16 [2022-02-20 16:52:07,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:52:07,188 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2022-02-20 16:52:07,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) [2022-02-20 16:52:07,189 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2022-02-20 16:52:07,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 16:52:07,189 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:52:07,189 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:52:07,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 16:52:07,189 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:52:07,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:52:07,190 INFO L85 PathProgramCache]: Analyzing trace with hash 466614784, now seen corresponding path program 1 times [2022-02-20 16:52:07,190 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:52:07,190 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314578268] [2022-02-20 16:52:07,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:52:07,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:52:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:52:07,233 INFO L290 TraceCheckUtils]: 0: Hoare triple {1068#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {1068#true} is VALID [2022-02-20 16:52:07,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {1068#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~nondet6#1, main_#t~mem13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~short15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~short18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~short20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1068#true} is VALID [2022-02-20 16:52:07,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {1068#true} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {1068#true} is VALID [2022-02-20 16:52:07,234 INFO L290 TraceCheckUtils]: 3: Hoare triple {1068#true} assume 0 != main_#t~nondet5#1;havoc main_#t~nondet5#1;call write~int(1, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4);call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); {1070#(and (= |ULTIMATE.start_main_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) |ULTIMATE.start_main_~head~0#1.base|))} is VALID [2022-02-20 16:52:07,235 INFO L290 TraceCheckUtils]: 4: Hoare triple {1070#(and (= |ULTIMATE.start_main_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) |ULTIMATE.start_main_~head~0#1.base|))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {1070#(and (= |ULTIMATE.start_main_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) |ULTIMATE.start_main_~head~0#1.base|))} is VALID [2022-02-20 16:52:07,235 INFO L290 TraceCheckUtils]: 5: Hoare triple {1070#(and (= |ULTIMATE.start_main_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) |ULTIMATE.start_main_~head~0#1.base|))} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {1070#(and (= |ULTIMATE.start_main_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) |ULTIMATE.start_main_~head~0#1.base|))} is VALID [2022-02-20 16:52:07,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {1070#(and (= |ULTIMATE.start_main_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) |ULTIMATE.start_main_~head~0#1.base|))} assume !(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1; {1070#(and (= |ULTIMATE.start_main_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) |ULTIMATE.start_main_~head~0#1.base|))} is VALID [2022-02-20 16:52:07,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {1070#(and (= |ULTIMATE.start_main_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) |ULTIMATE.start_main_~head~0#1.base|))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {1071#(and (= |ULTIMATE.start_main_~x~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|))} is VALID [2022-02-20 16:52:07,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {1071#(and (= |ULTIMATE.start_main_~x~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|))} assume !!(main_~x~0#1.base != 0 || main_~x~0#1.offset != 0); {1071#(and (= |ULTIMATE.start_main_~x~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|))} is VALID [2022-02-20 16:52:07,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {1071#(and (= |ULTIMATE.start_main_~x~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|))} call main_#t~mem13#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4);main_#t~short15#1 := 2 == main_#t~mem13#1; {1071#(and (= |ULTIMATE.start_main_~x~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|))} is VALID [2022-02-20 16:52:07,237 INFO L290 TraceCheckUtils]: 10: Hoare triple {1071#(and (= |ULTIMATE.start_main_~x~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|))} assume main_#t~short15#1;call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~x~0#1.base, 4 + main_~x~0#1.offset, 4);main_#t~short15#1 := main_#t~mem14#1.base != main_~x~0#1.base || main_#t~mem14#1.offset != main_~x~0#1.offset; {1071#(and (= |ULTIMATE.start_main_~x~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|))} is VALID [2022-02-20 16:52:07,238 INFO L290 TraceCheckUtils]: 11: Hoare triple {1071#(and (= |ULTIMATE.start_main_~x~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|))} main_#t~short18#1 := main_#t~short15#1; {1071#(and (= |ULTIMATE.start_main_~x~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|))} is VALID [2022-02-20 16:52:07,238 INFO L290 TraceCheckUtils]: 12: Hoare triple {1071#(and (= |ULTIMATE.start_main_~x~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|))} assume main_#t~short18#1;call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~x~0#1.base, 4 + main_~x~0#1.offset, 4);call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_#t~mem16#1.base, main_#t~mem16#1.offset, 4);main_#t~short18#1 := main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0; {1071#(and (= |ULTIMATE.start_main_~x~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|))} is VALID [2022-02-20 16:52:07,239 INFO L290 TraceCheckUtils]: 13: Hoare triple {1071#(and (= |ULTIMATE.start_main_~x~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|))} main_#t~short20#1 := main_#t~short18#1; {1071#(and (= |ULTIMATE.start_main_~x~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|))} is VALID [2022-02-20 16:52:07,239 INFO L290 TraceCheckUtils]: 14: Hoare triple {1071#(and (= |ULTIMATE.start_main_~x~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|))} assume !main_#t~short20#1;call main_#t~mem19#1.base, main_#t~mem19#1.offset := read~$Pointer$(main_~x~0#1.base, 4 + main_~x~0#1.offset, 4);main_#t~short20#1 := main_#t~mem19#1.base == main_~x~0#1.base && main_#t~mem19#1.offset == main_~x~0#1.offset; {1072#|ULTIMATE.start_main_#t~short20#1|} is VALID [2022-02-20 16:52:07,240 INFO L290 TraceCheckUtils]: 15: Hoare triple {1072#|ULTIMATE.start_main_#t~short20#1|} assume !main_#t~short20#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1.base, main_#t~mem14#1.offset;havoc main_#t~short15#1;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~short18#1;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~short20#1; {1069#false} is VALID [2022-02-20 16:52:07,240 INFO L290 TraceCheckUtils]: 16: Hoare triple {1069#false} assume !false; {1069#false} is VALID [2022-02-20 16:52:07,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:52:07,240 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:52:07,240 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314578268] [2022-02-20 16:52:07,240 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314578268] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:52:07,240 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:52:07,241 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:52:07,241 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497388537] [2022-02-20 16:52:07,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:52:07,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 17 [2022-02-20 16:52:07,241 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:52:07,241 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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) [2022-02-20 16:52:07,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:52:07,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:52:07,252 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:52:07,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:52:07,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:52:07,253 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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) [2022-02-20 16:52:07,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:52:07,481 INFO L93 Difference]: Finished difference Result 86 states and 107 transitions. [2022-02-20 16:52:07,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 16:52:07,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 17 [2022-02-20 16:52:07,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:52:07,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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) [2022-02-20 16:52:07,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 71 transitions. [2022-02-20 16:52:07,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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) [2022-02-20 16:52:07,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 71 transitions. [2022-02-20 16:52:07,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 71 transitions. [2022-02-20 16:52:07,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:52:07,537 INFO L225 Difference]: With dead ends: 86 [2022-02-20 16:52:07,537 INFO L226 Difference]: Without dead ends: 84 [2022-02-20 16:52:07,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:52:07,538 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 35 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:52:07,538 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 110 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:52:07,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-02-20 16:52:07,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 50. [2022-02-20 16:52:07,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:52:07,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 50 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 49 states have internal predecessors, (65), 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) [2022-02-20 16:52:07,543 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 50 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 49 states have internal predecessors, (65), 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) [2022-02-20 16:52:07,543 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 50 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 49 states have internal predecessors, (65), 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) [2022-02-20 16:52:07,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:52:07,545 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2022-02-20 16:52:07,545 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2022-02-20 16:52:07,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:52:07,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:52:07,545 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 49 states have internal predecessors, (65), 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) Second operand 84 states. [2022-02-20 16:52:07,546 INFO L87 Difference]: Start difference. First operand has 50 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 49 states have internal predecessors, (65), 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) Second operand 84 states. [2022-02-20 16:52:07,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:52:07,547 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2022-02-20 16:52:07,547 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2022-02-20 16:52:07,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:52:07,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:52:07,548 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:52:07,548 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:52:07,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 49 states have internal predecessors, (65), 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) [2022-02-20 16:52:07,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 65 transitions. [2022-02-20 16:52:07,549 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 65 transitions. Word has length 17 [2022-02-20 16:52:07,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:52:07,549 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 65 transitions. [2022-02-20 16:52:07,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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) [2022-02-20 16:52:07,550 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2022-02-20 16:52:07,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 16:52:07,550 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:52:07,550 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:52:07,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 16:52:07,550 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:52:07,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:52:07,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1690516158, now seen corresponding path program 1 times [2022-02-20 16:52:07,551 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:52:07,551 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617429926] [2022-02-20 16:52:07,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:52:07,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:52:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:52:07,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {1406#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {1406#true} is VALID [2022-02-20 16:52:07,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {1406#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~nondet6#1, main_#t~mem13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~short15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~short18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~short20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1408#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 16:52:07,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {1408#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1;call write~int(2, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~head~0#1.base, 4 + main_~head~0#1.offset, 4);call write~$Pointer$(0, 0, main_#t~mem4#1.base, main_#t~mem4#1.offset, 4);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {1409#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) |ULTIMATE.start_main_~head~0#1.base|)))} is VALID [2022-02-20 16:52:07,795 INFO L290 TraceCheckUtils]: 3: Hoare triple {1409#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) |ULTIMATE.start_main_~head~0#1.base|)))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {1410#(and (not (= (+ |ULTIMATE.start_main_~head~0#1.offset| 4) |ULTIMATE.start_main_~x~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 1) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|)))} is VALID [2022-02-20 16:52:07,795 INFO L290 TraceCheckUtils]: 4: Hoare triple {1410#(and (not (= (+ |ULTIMATE.start_main_~head~0#1.offset| 4) |ULTIMATE.start_main_~x~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 1) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|)))} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {1410#(and (not (= (+ |ULTIMATE.start_main_~head~0#1.offset| 4) |ULTIMATE.start_main_~x~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 1) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|)))} is VALID [2022-02-20 16:52:07,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {1410#(and (not (= (+ |ULTIMATE.start_main_~head~0#1.offset| 4) |ULTIMATE.start_main_~x~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 1) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|)))} assume !!(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;call write~$Pointer$(0, 0, main_~x~0#1.base, main_~x~0#1.offset, 4);assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647; {1411#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 0)))} is VALID [2022-02-20 16:52:07,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {1411#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 0)))} assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call write~int(2, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_~x~0#1.base, 4 + main_~x~0#1.offset, 4);havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~x~0#1.base, 4 + main_~x~0#1.offset, 4);call write~$Pointer$(0, 0, main_#t~mem11#1.base, main_#t~mem11#1.offset, 4);havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {1412#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0))} is VALID [2022-02-20 16:52:07,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {1412#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0))} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {1412#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0))} is VALID [2022-02-20 16:52:07,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {1412#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0))} assume !(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1; {1412#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0))} is VALID [2022-02-20 16:52:07,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {1412#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {1413#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} is VALID [2022-02-20 16:52:07,802 INFO L290 TraceCheckUtils]: 10: Hoare triple {1413#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} assume !!(main_~x~0#1.base != 0 || main_~x~0#1.offset != 0); {1413#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} is VALID [2022-02-20 16:52:07,803 INFO L290 TraceCheckUtils]: 11: Hoare triple {1413#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} call main_#t~mem13#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4);main_#t~short15#1 := 2 == main_#t~mem13#1; {1413#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} is VALID [2022-02-20 16:52:07,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {1413#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} assume main_#t~short15#1;call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~x~0#1.base, 4 + main_~x~0#1.offset, 4);main_#t~short15#1 := main_#t~mem14#1.base != main_~x~0#1.base || main_#t~mem14#1.offset != main_~x~0#1.offset; {1413#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} is VALID [2022-02-20 16:52:07,804 INFO L290 TraceCheckUtils]: 13: Hoare triple {1413#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} main_#t~short18#1 := main_#t~short15#1; {1413#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} is VALID [2022-02-20 16:52:07,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {1413#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} assume main_#t~short18#1;call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~x~0#1.base, 4 + main_~x~0#1.offset, 4);call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_#t~mem16#1.base, main_#t~mem16#1.offset, 4);main_#t~short18#1 := main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0; {1414#|ULTIMATE.start_main_#t~short18#1|} is VALID [2022-02-20 16:52:07,805 INFO L290 TraceCheckUtils]: 15: Hoare triple {1414#|ULTIMATE.start_main_#t~short18#1|} main_#t~short20#1 := main_#t~short18#1; {1415#|ULTIMATE.start_main_#t~short20#1|} is VALID [2022-02-20 16:52:07,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {1415#|ULTIMATE.start_main_#t~short20#1|} assume !main_#t~short20#1;call main_#t~mem19#1.base, main_#t~mem19#1.offset := read~$Pointer$(main_~x~0#1.base, 4 + main_~x~0#1.offset, 4);main_#t~short20#1 := main_#t~mem19#1.base == main_~x~0#1.base && main_#t~mem19#1.offset == main_~x~0#1.offset; {1407#false} is VALID [2022-02-20 16:52:07,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {1407#false} assume !main_#t~short20#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1.base, main_#t~mem14#1.offset;havoc main_#t~short15#1;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~short18#1;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~short20#1; {1407#false} is VALID [2022-02-20 16:52:07,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {1407#false} assume !false; {1407#false} is VALID [2022-02-20 16:52:07,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:52:07,805 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:52:07,805 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617429926] [2022-02-20 16:52:07,806 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617429926] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:52:07,806 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185092701] [2022-02-20 16:52:07,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:52:07,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:52:07,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:52:07,807 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 16:52:07,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 16:52:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:52:07,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 82 conjunts are in the unsatisfiable core [2022-02-20 16:52:07,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:52:07,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:52:08,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 16:52:08,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:52:08,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:52:08,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-02-20 16:52:08,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:52:08,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:52:08,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-02-20 16:52:08,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-02-20 16:52:08,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:52:08,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 42 [2022-02-20 16:52:08,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:52:08,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2022-02-20 16:52:08,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-02-20 16:52:08,155 INFO L356 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2022-02-20 16:52:08,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 33 [2022-02-20 16:52:08,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-02-20 16:52:08,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:52:08,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-02-20 16:52:08,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:52:08,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:52:08,402 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-02-20 16:52:08,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 52 [2022-02-20 16:52:08,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:52:08,439 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-02-20 16:52:08,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 61 [2022-02-20 16:52:08,486 INFO L356 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2022-02-20 16:52:08,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 45 [2022-02-20 16:52:08,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 39 [2022-02-20 16:52:08,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:52:08,845 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-02-20 16:52:08,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 108 treesize of output 103 [2022-02-20 16:52:08,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:52:08,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:52:08,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:52:08,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 51 [2022-02-20 16:52:08,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-02-20 16:52:09,009 INFO L356 Elim1Store]: treesize reduction 12, result has 65.7 percent of original size [2022-02-20 16:52:09,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 35 [2022-02-20 16:52:10,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {1406#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {1406#true} is VALID [2022-02-20 16:52:10,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {1406#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~nondet6#1, main_#t~mem13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~short15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~short18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~short20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1408#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 16:52:10,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {1408#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1;call write~int(2, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~head~0#1.base, 4 + main_~head~0#1.offset, 4);call write~$Pointer$(0, 0, main_#t~mem4#1.base, main_#t~mem4#1.offset, 4);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {1409#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) |ULTIMATE.start_main_~head~0#1.base|)))} is VALID [2022-02-20 16:52:10,056 INFO L290 TraceCheckUtils]: 3: Hoare triple {1409#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) |ULTIMATE.start_main_~head~0#1.base|)))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {1428#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 1) (<= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) |ULTIMATE.start_main_~head~0#1.base|)))} is VALID [2022-02-20 16:52:10,057 INFO L290 TraceCheckUtils]: 4: Hoare triple {1428#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 1) (<= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) |ULTIMATE.start_main_~head~0#1.base|)))} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {1428#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 1) (<= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) |ULTIMATE.start_main_~head~0#1.base|)))} is VALID [2022-02-20 16:52:10,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {1428#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 1) (<= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) |ULTIMATE.start_main_~head~0#1.base|)))} assume !!(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;call write~$Pointer$(0, 0, main_~x~0#1.base, main_~x~0#1.offset, 4);assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647; {1435#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 1) (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_21| Int)) (and (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|) |ULTIMATE.start_main_~x~0#1.offset|) (<= |v_ULTIMATE.start_main_~x~0#1.offset_21| |ULTIMATE.start_main_~head~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) |ULTIMATE.start_main_~head~0#1.base|)))} is VALID [2022-02-20 16:52:10,071 INFO L290 TraceCheckUtils]: 6: Hoare triple {1435#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 1) (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_21| Int)) (and (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|) |ULTIMATE.start_main_~x~0#1.offset|) (<= |v_ULTIMATE.start_main_~x~0#1.offset_21| |ULTIMATE.start_main_~head~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) |ULTIMATE.start_main_~head~0#1.base|)))} assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1;call write~int(2, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_~x~0#1.base, 4 + main_~x~0#1.offset, 4);havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~x~0#1.base, 4 + main_~x~0#1.offset, 4);call write~$Pointer$(0, 0, main_#t~mem11#1.base, main_#t~mem11#1.offset, 4);havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {1439#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_21| Int)) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|)) 4) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|) |ULTIMATE.start_main_~head~0#1.base|)) (<= |v_ULTIMATE.start_main_~x~0#1.offset_21| |ULTIMATE.start_main_~head~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) |ULTIMATE.start_main_~head~0#1.base|)))} is VALID [2022-02-20 16:52:10,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {1439#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_21| Int)) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|)) 4) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|) |ULTIMATE.start_main_~head~0#1.base|)) (<= |v_ULTIMATE.start_main_~x~0#1.offset_21| |ULTIMATE.start_main_~head~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) |ULTIMATE.start_main_~head~0#1.base|)))} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {1439#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_21| Int)) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|)) 4) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|) |ULTIMATE.start_main_~head~0#1.base|)) (<= |v_ULTIMATE.start_main_~x~0#1.offset_21| |ULTIMATE.start_main_~head~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) |ULTIMATE.start_main_~head~0#1.base|)))} is VALID [2022-02-20 16:52:10,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {1439#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_21| Int)) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|)) 4) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|) |ULTIMATE.start_main_~head~0#1.base|)) (<= |v_ULTIMATE.start_main_~x~0#1.offset_21| |ULTIMATE.start_main_~head~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) |ULTIMATE.start_main_~head~0#1.base|)))} assume !(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1; {1439#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_21| Int)) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|)) 4) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|) |ULTIMATE.start_main_~head~0#1.base|)) (<= |v_ULTIMATE.start_main_~x~0#1.offset_21| |ULTIMATE.start_main_~head~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) |ULTIMATE.start_main_~head~0#1.base|)))} is VALID [2022-02-20 16:52:10,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {1439#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 0) 0) (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_21| Int)) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|)) 4) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|) |ULTIMATE.start_main_~head~0#1.base|)) (<= |v_ULTIMATE.start_main_~x~0#1.offset_21| |ULTIMATE.start_main_~head~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) |ULTIMATE.start_main_~head~0#1.base|)))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {1449#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_21| Int)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|)) 4) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|) |ULTIMATE.start_main_~x~0#1.base|)) (<= |v_ULTIMATE.start_main_~x~0#1.offset_21| |ULTIMATE.start_main_~x~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} is VALID [2022-02-20 16:52:10,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {1449#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_21| Int)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|)) 4) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|) |ULTIMATE.start_main_~x~0#1.base|)) (<= |v_ULTIMATE.start_main_~x~0#1.offset_21| |ULTIMATE.start_main_~x~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} assume !!(main_~x~0#1.base != 0 || main_~x~0#1.offset != 0); {1449#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_21| Int)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|)) 4) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|) |ULTIMATE.start_main_~x~0#1.base|)) (<= |v_ULTIMATE.start_main_~x~0#1.offset_21| |ULTIMATE.start_main_~x~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} is VALID [2022-02-20 16:52:10,089 INFO L290 TraceCheckUtils]: 11: Hoare triple {1449#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_21| Int)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|)) 4) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|) |ULTIMATE.start_main_~x~0#1.base|)) (<= |v_ULTIMATE.start_main_~x~0#1.offset_21| |ULTIMATE.start_main_~x~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} call main_#t~mem13#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4);main_#t~short15#1 := 2 == main_#t~mem13#1; {1449#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_21| Int)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|)) 4) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|) |ULTIMATE.start_main_~x~0#1.base|)) (<= |v_ULTIMATE.start_main_~x~0#1.offset_21| |ULTIMATE.start_main_~x~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} is VALID [2022-02-20 16:52:10,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {1449#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_21| Int)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|)) 4) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|) |ULTIMATE.start_main_~x~0#1.base|)) (<= |v_ULTIMATE.start_main_~x~0#1.offset_21| |ULTIMATE.start_main_~x~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} assume main_#t~short15#1;call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~x~0#1.base, 4 + main_~x~0#1.offset, 4);main_#t~short15#1 := main_#t~mem14#1.base != main_~x~0#1.base || main_#t~mem14#1.offset != main_~x~0#1.offset; {1449#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_21| Int)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|)) 4) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|) |ULTIMATE.start_main_~x~0#1.base|)) (<= |v_ULTIMATE.start_main_~x~0#1.offset_21| |ULTIMATE.start_main_~x~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} is VALID [2022-02-20 16:52:10,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {1449#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_21| Int)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|)) 4) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|) |ULTIMATE.start_main_~x~0#1.base|)) (<= |v_ULTIMATE.start_main_~x~0#1.offset_21| |ULTIMATE.start_main_~x~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} main_#t~short18#1 := main_#t~short15#1; {1449#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_21| Int)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|)) 4) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|) |ULTIMATE.start_main_~x~0#1.base|)) (<= |v_ULTIMATE.start_main_~x~0#1.offset_21| |ULTIMATE.start_main_~x~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} is VALID [2022-02-20 16:52:10,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {1449#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_21| Int)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|)) 4) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|) |ULTIMATE.start_main_~x~0#1.base|)) (<= |v_ULTIMATE.start_main_~x~0#1.offset_21| |ULTIMATE.start_main_~x~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} assume main_#t~short18#1;call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~x~0#1.base, 4 + main_~x~0#1.offset, 4);call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_#t~mem16#1.base, main_#t~mem16#1.offset, 4);main_#t~short18#1 := main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0; {1465#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|)) |ULTIMATE.start_main_#t~short18#1| (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_21| Int)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|)) 4) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|) |ULTIMATE.start_main_~x~0#1.base|)) (<= |v_ULTIMATE.start_main_~x~0#1.offset_21| |ULTIMATE.start_main_~x~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} is VALID [2022-02-20 16:52:10,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {1465#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|)) |ULTIMATE.start_main_#t~short18#1| (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_21| Int)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|)) 4) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|) |ULTIMATE.start_main_~x~0#1.base|)) (<= |v_ULTIMATE.start_main_~x~0#1.offset_21| |ULTIMATE.start_main_~x~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} main_#t~short20#1 := main_#t~short18#1; {1469#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|)) |ULTIMATE.start_main_#t~short20#1| (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_21| Int)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|)) 4) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|) |ULTIMATE.start_main_~x~0#1.base|)) (<= |v_ULTIMATE.start_main_~x~0#1.offset_21| |ULTIMATE.start_main_~x~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} is VALID [2022-02-20 16:52:10,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {1469#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) |ULTIMATE.start_main_~x~0#1.base|)) |ULTIMATE.start_main_#t~short20#1| (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_21| Int)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|)) 4) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|) |ULTIMATE.start_main_~x~0#1.base|)) (<= |v_ULTIMATE.start_main_~x~0#1.offset_21| |ULTIMATE.start_main_~x~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_21|)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~x~0#1.offset| 4))))} assume !main_#t~short20#1;call main_#t~mem19#1.base, main_#t~mem19#1.offset := read~$Pointer$(main_~x~0#1.base, 4 + main_~x~0#1.offset, 4);main_#t~short20#1 := main_#t~mem19#1.base == main_~x~0#1.base && main_#t~mem19#1.offset == main_~x~0#1.offset; {1407#false} is VALID [2022-02-20 16:52:10,094 INFO L290 TraceCheckUtils]: 17: Hoare triple {1407#false} assume !main_#t~short20#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1.base, main_#t~mem14#1.offset;havoc main_#t~short15#1;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~short18#1;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~short20#1; {1407#false} is VALID [2022-02-20 16:52:10,094 INFO L290 TraceCheckUtils]: 18: Hoare triple {1407#false} assume !false; {1407#false} is VALID [2022-02-20 16:52:10,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:52:10,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:52:10,351 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:52:10,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 115 [2022-02-20 16:52:11,513 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_348 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_7| Int) (v_ArrVal_342 (Array Int Int)) (v_ArrVal_344 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_5) |v_ULTIMATE.start_main_#t~malloc10#1.base_7| v_ArrVal_342)) (.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_344) |v_ULTIMATE.start_main_#t~malloc10#1.base_7| v_ArrVal_348)) (.cse4 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) (.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (not (= (select v_arrayElimArr_5 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_7|) 0)) (and (= (select (select .cse0 .cse1) .cse2) 0) (= (select (select .cse3 .cse1) .cse2) 0)) (and (= |c_ULTIMATE.start_main_~head~0#1.base| .cse1) (= .cse2 |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2022-02-20 16:52:21,823 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_348 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_7| Int) (v_ArrVal_342 (Array Int Int)) (v_ArrVal_339 Int) (v_ArrVal_344 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_24| Int)) (let ((.cse3 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_24| 0)) v_ArrVal_339 v_arrayElimArr_5) |v_ULTIMATE.start_main_#t~malloc10#1.base_7| v_ArrVal_342)) (.cse2 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_24| v_ArrVal_339)) v_ArrVal_339 v_ArrVal_344) |v_ULTIMATE.start_main_#t~malloc10#1.base_7| v_ArrVal_348)) (.cse4 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) (.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (or (not (= (select (store |c_#valid| v_ArrVal_339 1) |v_ULTIMATE.start_main_#t~malloc10#1.base_7|) 0)) (and (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) (= .cse1 |c_ULTIMATE.start_main_~head~0#1.offset|)) (and (= (select (select .cse2 .cse0) .cse1) 0) (= (select (select .cse3 .cse0) .cse1) 0)) (not (= (select |c_#valid| v_ArrVal_339) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_24| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select v_arrayElimArr_5 4) 0)))))) is different from false [2022-02-20 16:52:22,066 INFO L356 Elim1Store]: treesize reduction 15, result has 67.4 percent of original size [2022-02-20 16:52:22,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 912 treesize of output 766 [2022-02-20 16:52:22,866 INFO L356 Elim1Store]: treesize reduction 72, result has 78.6 percent of original size [2022-02-20 16:52:22,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 256536 treesize of output 252335 [2022-02-20 16:52:23,640 INFO L356 Elim1Store]: treesize reduction 15, result has 67.4 percent of original size [2022-02-20 16:52:23,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 422453 treesize of output 306807 [2022-02-20 16:52:25,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:52:25,103 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:52:25,104 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:52:27,038 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:52:27,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 4268797 treesize of output 4194873 [2022-02-20 16:52:36,604 WARN L228 SmtUtils]: Spent 9.55s on a formula simplification that was a NOOP. DAG size: 9652 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-02-20 16:52:46,016 WARN L228 SmtUtils]: Spent 9.38s on a formula simplification that was a NOOP. DAG size: 9649 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-02-20 16:52:47,589 INFO L356 Elim1Store]: treesize reduction 22, result has 92.9 percent of original size [2022-02-20 16:52:47,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 4272045 treesize of output 3703017 [2022-02-20 16:52:57,597 WARN L228 SmtUtils]: Spent 9.99s on a formula simplification that was a NOOP. DAG size: 9707 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-02-20 16:53:07,337 WARN L228 SmtUtils]: Spent 9.70s on a formula simplification that was a NOOP. DAG size: 9704 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-02-20 16:53:07,592 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:53:07,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:53:09,009 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:53:09,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 3928142 treesize of output 3889274