./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/sll-sorted-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-sorted-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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 valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e45b14428dafe2f20aeac8c38d2592befc15b6791b0365935474ded4fd47d0f2 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:36:50,597 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:36:50,598 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:36:50,617 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:36:50,617 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:36:50,618 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:36:50,619 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:36:50,620 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:36:50,621 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:36:50,622 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:36:50,623 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:36:50,624 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:36:50,624 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:36:50,625 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:36:50,625 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:36:50,626 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:36:50,627 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:36:50,627 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:36:50,628 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:36:50,630 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:36:50,631 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:36:50,631 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:36:50,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:36:50,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:36:50,635 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:36:50,635 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:36:50,635 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:36:50,636 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:36:50,636 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:36:50,637 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:36:50,637 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:36:50,637 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:36:50,638 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:36:50,638 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:36:50,639 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:36:50,639 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:36:50,640 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:36:50,640 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:36:50,640 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:36:50,641 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:36:50,641 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:36:50,655 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-02-20 23:36:50,686 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:36:50,687 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:36:50,687 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:36:50,687 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:36:50,688 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:36:50,688 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:36:50,689 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:36:50,689 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:36:50,689 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:36:50,689 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:36:50,690 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:36:50,690 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:36:50,690 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:36:50,690 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:36:50,690 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:36:50,690 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:36:50,690 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:36:50,691 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:36:50,691 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:36:50,691 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:36:50,691 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:36:50,691 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:36:50,691 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:36:50,692 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:36:50,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:36:50,692 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:36:50,692 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:36:50,692 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:36:50,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:36:50,692 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 valid-memcleanup) ) 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 -> e45b14428dafe2f20aeac8c38d2592befc15b6791b0365935474ded4fd47d0f2 [2022-02-20 23:36:50,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:36:50,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:36:50,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:36:50,912 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:36:50,913 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:36:50,914 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-sorted-1.i [2022-02-20 23:36:50,970 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccbdc8818/d8731000c6a9440db2cbcc8fa440838f/FLAG43cf3d099 [2022-02-20 23:36:51,309 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:36:51,310 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-1.i [2022-02-20 23:36:51,318 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccbdc8818/d8731000c6a9440db2cbcc8fa440838f/FLAG43cf3d099 [2022-02-20 23:36:51,709 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccbdc8818/d8731000c6a9440db2cbcc8fa440838f [2022-02-20 23:36:51,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:36:51,712 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:36:51,713 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:36:51,713 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:36:51,715 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:36:51,716 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:36:51" (1/1) ... [2022-02-20 23:36:51,717 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@82c6be6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:51, skipping insertion in model container [2022-02-20 23:36:51,717 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:36:51" (1/1) ... [2022-02-20 23:36:51,721 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:36:51,739 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:36:51,937 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-sorted-1.i[22317,22330] [2022-02-20 23:36:51,941 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-sorted-1.i[22547,22560] [2022-02-20 23:36:51,943 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-sorted-1.i[22877,22890] [2022-02-20 23:36:51,944 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-sorted-1.i[22941,22954] [2022-02-20 23:36:51,945 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-sorted-1.i[23072,23085] [2022-02-20 23:36:51,945 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-sorted-1.i[23136,23149] [2022-02-20 23:36:51,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:36:51,952 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:36:51,979 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-sorted-1.i[22317,22330] [2022-02-20 23:36:51,980 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-sorted-1.i[22547,22560] [2022-02-20 23:36:51,982 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-sorted-1.i[22877,22890] [2022-02-20 23:36:51,983 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-sorted-1.i[22941,22954] [2022-02-20 23:36:51,984 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-sorted-1.i[23072,23085] [2022-02-20 23:36:51,984 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-sorted-1.i[23136,23149] [2022-02-20 23:36:51,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:36:52,002 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:36:52,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:52 WrapperNode [2022-02-20 23:36:52,003 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:36:52,003 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:36:52,003 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:36:52,004 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:36:52,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:52" (1/1) ... [2022-02-20 23:36:52,033 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:52" (1/1) ... [2022-02-20 23:36:52,065 INFO L137 Inliner]: procedures = 119, calls = 39, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 189 [2022-02-20 23:36:52,067 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:36:52,067 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:36:52,067 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:36:52,068 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:36:52,073 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:52" (1/1) ... [2022-02-20 23:36:52,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:52" (1/1) ... [2022-02-20 23:36:52,079 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:52" (1/1) ... [2022-02-20 23:36:52,080 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:52" (1/1) ... [2022-02-20 23:36:52,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:52" (1/1) ... [2022-02-20 23:36:52,095 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:52" (1/1) ... [2022-02-20 23:36:52,098 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:52" (1/1) ... [2022-02-20 23:36:52,104 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:36:52,109 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:36:52,110 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:36:52,110 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:36:52,111 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:52" (1/1) ... [2022-02-20 23:36:52,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:36:52,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:36:52,134 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 23:36:52,140 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 23:36:52,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:36:52,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:36:52,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:36:52,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:36:52,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:36:52,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:36:52,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:36:52,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:36:52,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:36:52,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:36:52,240 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:36:52,241 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:36:52,739 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:36:52,745 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:36:52,745 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2022-02-20 23:36:52,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:36:52 BoogieIcfgContainer [2022-02-20 23:36:52,747 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:36:52,748 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:36:52,748 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:36:52,751 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:36:52,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:36:51" (1/3) ... [2022-02-20 23:36:52,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23d5a465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:36:52, skipping insertion in model container [2022-02-20 23:36:52,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:52" (2/3) ... [2022-02-20 23:36:52,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23d5a465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:36:52, skipping insertion in model container [2022-02-20 23:36:52,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:36:52" (3/3) ... [2022-02-20 23:36:52,753 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-sorted-1.i [2022-02-20 23:36:52,756 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:36:52,756 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 68 error locations. [2022-02-20 23:36:52,781 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:36:52,785 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 23:36:52,786 INFO L340 AbstractCegarLoop]: Starting to check reachability of 68 error locations. [2022-02-20 23:36:52,798 INFO L276 IsEmpty]: Start isEmpty. Operand has 159 states, 90 states have (on average 2.1555555555555554) internal successors, (194), 158 states have internal predecessors, (194), 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 23:36:52,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:36:52,802 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:52,802 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:36:52,802 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 64 more)] === [2022-02-20 23:36:52,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:52,806 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-02-20 23:36:52,811 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:52,812 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788562843] [2022-02-20 23:36:52,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:52,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:52,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:52,922 INFO L290 TraceCheckUtils]: 0: Hoare triple {162#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(15, 2); {162#true} is VALID [2022-02-20 23:36:52,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {162#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, 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~nondet2#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1, main_#t~short9#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem19#1, main_#t~short20#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(8);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; {164#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:36:52,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {164#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} assume !(1 == #valid[main_~head~0#1.base]); {163#false} is VALID [2022-02-20 23:36:52,925 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 23:36:52,926 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:52,926 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788562843] [2022-02-20 23:36:52,927 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788562843] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:52,927 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:52,927 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:36:52,930 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845933166] [2022-02-20 23:36:52,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:52,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-02-20 23:36:52,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:52,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 23:36:52,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:52,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:36:52,945 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:52,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:36:52,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:36:52,970 INFO L87 Difference]: Start difference. First operand has 159 states, 90 states have (on average 2.1555555555555554) internal successors, (194), 158 states have internal predecessors, (194), 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 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 23:36:53,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:53,234 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2022-02-20 23:36:53,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:36:53,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-02-20 23:36:53,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:53,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 23:36:53,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2022-02-20 23:36:53,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 23:36:53,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2022-02-20 23:36:53,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 201 transitions. [2022-02-20 23:36:53,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:53,403 INFO L225 Difference]: With dead ends: 163 [2022-02-20 23:36:53,404 INFO L226 Difference]: Without dead ends: 159 [2022-02-20 23:36:53,405 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:36:53,409 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 153 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:53,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 111 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:53,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-02-20 23:36:53,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 155. [2022-02-20 23:36:53,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:53,442 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand has 155 states, 89 states have (on average 1.8651685393258426) internal successors, (166), 154 states have internal predecessors, (166), 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 23:36:53,442 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand has 155 states, 89 states have (on average 1.8651685393258426) internal successors, (166), 154 states have internal predecessors, (166), 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 23:36:53,443 INFO L87 Difference]: Start difference. First operand 159 states. Second operand has 155 states, 89 states have (on average 1.8651685393258426) internal successors, (166), 154 states have internal predecessors, (166), 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 23:36:53,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:53,455 INFO L93 Difference]: Finished difference Result 159 states and 170 transitions. [2022-02-20 23:36:53,455 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 170 transitions. [2022-02-20 23:36:53,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:53,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:53,456 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 89 states have (on average 1.8651685393258426) internal successors, (166), 154 states have internal predecessors, (166), 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 159 states. [2022-02-20 23:36:53,457 INFO L87 Difference]: Start difference. First operand has 155 states, 89 states have (on average 1.8651685393258426) internal successors, (166), 154 states have internal predecessors, (166), 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 159 states. [2022-02-20 23:36:53,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:53,464 INFO L93 Difference]: Finished difference Result 159 states and 170 transitions. [2022-02-20 23:36:53,465 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 170 transitions. [2022-02-20 23:36:53,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:53,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:53,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:53,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:53,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 89 states have (on average 1.8651685393258426) internal successors, (166), 154 states have internal predecessors, (166), 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 23:36:53,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 166 transitions. [2022-02-20 23:36:53,475 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 166 transitions. Word has length 3 [2022-02-20 23:36:53,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:53,475 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 166 transitions. [2022-02-20 23:36:53,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 23:36:53,475 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 166 transitions. [2022-02-20 23:36:53,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:36:53,476 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:53,476 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:36:53,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:36:53,477 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 64 more)] === [2022-02-20 23:36:53,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:53,480 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-20 23:36:53,481 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:53,481 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271207028] [2022-02-20 23:36:53,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:53,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:53,539 INFO L290 TraceCheckUtils]: 0: Hoare triple {803#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(15, 2); {803#true} is VALID [2022-02-20 23:36:53,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {803#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, 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~nondet2#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1, main_#t~short9#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem19#1, main_#t~short20#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(8);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; {805#(and (<= 8 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:36:53,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {805#(and (<= 8 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} assume !(4 + main_~head~0#1.offset <= #length[main_~head~0#1.base] && 0 <= main_~head~0#1.offset); {804#false} is VALID [2022-02-20 23:36:53,544 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 23:36:53,545 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:53,545 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271207028] [2022-02-20 23:36:53,545 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271207028] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:53,545 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:53,546 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:36:53,546 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449123230] [2022-02-20 23:36:53,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:53,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-02-20 23:36:53,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:53,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 23:36:53,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:53,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:36:53,552 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:53,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:36:53,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:36:53,552 INFO L87 Difference]: Start difference. First operand 155 states and 166 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 23:36:53,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:53,759 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2022-02-20 23:36:53,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:36:53,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-02-20 23:36:53,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:53,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 23:36:53,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2022-02-20 23:36:53,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 23:36:53,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2022-02-20 23:36:53,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 170 transitions. [2022-02-20 23:36:53,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:53,896 INFO L225 Difference]: With dead ends: 157 [2022-02-20 23:36:53,896 INFO L226 Difference]: Without dead ends: 157 [2022-02-20 23:36:53,896 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:36:53,898 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 149 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:53,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 109 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:36:53,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-02-20 23:36:53,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2022-02-20 23:36:53,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:53,915 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand has 153 states, 89 states have (on average 1.8426966292134832) internal successors, (164), 152 states have internal predecessors, (164), 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 23:36:53,916 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand has 153 states, 89 states have (on average 1.8426966292134832) internal successors, (164), 152 states have internal predecessors, (164), 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 23:36:53,916 INFO L87 Difference]: Start difference. First operand 157 states. Second operand has 153 states, 89 states have (on average 1.8426966292134832) internal successors, (164), 152 states have internal predecessors, (164), 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 23:36:53,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:53,921 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2022-02-20 23:36:53,921 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 168 transitions. [2022-02-20 23:36:53,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:53,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:53,923 INFO L74 IsIncluded]: Start isIncluded. First operand has 153 states, 89 states have (on average 1.8426966292134832) internal successors, (164), 152 states have internal predecessors, (164), 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 157 states. [2022-02-20 23:36:53,923 INFO L87 Difference]: Start difference. First operand has 153 states, 89 states have (on average 1.8426966292134832) internal successors, (164), 152 states have internal predecessors, (164), 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 157 states. [2022-02-20 23:36:53,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:53,927 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2022-02-20 23:36:53,927 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 168 transitions. [2022-02-20 23:36:53,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:53,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:53,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:53,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:53,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 89 states have (on average 1.8426966292134832) internal successors, (164), 152 states have internal predecessors, (164), 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 23:36:53,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 164 transitions. [2022-02-20 23:36:53,931 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 164 transitions. Word has length 3 [2022-02-20 23:36:53,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:53,932 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 164 transitions. [2022-02-20 23:36:53,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 23:36:53,932 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 164 transitions. [2022-02-20 23:36:53,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:36:53,933 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:53,933 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:53,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:36:53,934 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 64 more)] === [2022-02-20 23:36:53,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:53,935 INFO L85 PathProgramCache]: Analyzing trace with hash 59263661, now seen corresponding path program 1 times [2022-02-20 23:36:53,935 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:53,935 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685118425] [2022-02-20 23:36:53,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:53,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:54,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {1432#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(15, 2); {1432#true} is VALID [2022-02-20 23:36:54,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {1432#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, 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~nondet2#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1, main_#t~short9#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem19#1, main_#t~short20#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(8);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; {1434#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:36:54,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {1434#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L997 {1434#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:36:54,027 INFO L290 TraceCheckUtils]: 3: Hoare triple {1434#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} SUMMARY for call write~int(0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {1434#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:36:54,028 INFO L290 TraceCheckUtils]: 4: Hoare triple {1434#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~marked~0#1 := 0; {1435#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:36:54,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {1435#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1435#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:36:54,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {1435#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !!(0 != main_#t~nondet2#1 || 0 == main_~marked~0#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8); {1435#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:36:54,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {1435#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !(1 == #valid[main_~x~0#1.base]); {1433#false} is VALID [2022-02-20 23:36:54,029 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 23:36:54,029 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:54,030 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685118425] [2022-02-20 23:36:54,030 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685118425] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:54,030 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:54,030 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:36:54,032 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126619683] [2022-02-20 23:36:54,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:54,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2022-02-20 23:36:54,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:54,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 23:36:54,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:54,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:36:54,039 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:54,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:36:54,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:36:54,040 INFO L87 Difference]: Start difference. First operand 153 states and 164 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 23:36:54,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:54,303 INFO L93 Difference]: Finished difference Result 162 states and 176 transitions. [2022-02-20 23:36:54,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:36:54,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2022-02-20 23:36:54,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:54,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 23:36:54,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 198 transitions. [2022-02-20 23:36:54,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 23:36:54,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 198 transitions. [2022-02-20 23:36:54,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 198 transitions. [2022-02-20 23:36:54,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:54,454 INFO L225 Difference]: With dead ends: 162 [2022-02-20 23:36:54,455 INFO L226 Difference]: Without dead ends: 162 [2022-02-20 23:36:54,455 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 23:36:54,457 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 264 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:54,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 84 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:54,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-02-20 23:36:54,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 151. [2022-02-20 23:36:54,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:54,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand has 151 states, 103 states have (on average 1.6796116504854368) internal successors, (173), 150 states have internal predecessors, (173), 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 23:36:54,466 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand has 151 states, 103 states have (on average 1.6796116504854368) internal successors, (173), 150 states have internal predecessors, (173), 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 23:36:54,467 INFO L87 Difference]: Start difference. First operand 162 states. Second operand has 151 states, 103 states have (on average 1.6796116504854368) internal successors, (173), 150 states have internal predecessors, (173), 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 23:36:54,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:54,470 INFO L93 Difference]: Finished difference Result 162 states and 176 transitions. [2022-02-20 23:36:54,470 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 176 transitions. [2022-02-20 23:36:54,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:54,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:54,471 INFO L74 IsIncluded]: Start isIncluded. First operand has 151 states, 103 states have (on average 1.6796116504854368) internal successors, (173), 150 states have internal predecessors, (173), 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 162 states. [2022-02-20 23:36:54,471 INFO L87 Difference]: Start difference. First operand has 151 states, 103 states have (on average 1.6796116504854368) internal successors, (173), 150 states have internal predecessors, (173), 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 162 states. [2022-02-20 23:36:54,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:54,483 INFO L93 Difference]: Finished difference Result 162 states and 176 transitions. [2022-02-20 23:36:54,483 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 176 transitions. [2022-02-20 23:36:54,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:54,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:54,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:54,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:54,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 103 states have (on average 1.6796116504854368) internal successors, (173), 150 states have internal predecessors, (173), 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 23:36:54,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 173 transitions. [2022-02-20 23:36:54,488 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 173 transitions. Word has length 8 [2022-02-20 23:36:54,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:54,488 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 173 transitions. [2022-02-20 23:36:54,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 23:36:54,488 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 173 transitions. [2022-02-20 23:36:54,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:36:54,489 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:54,489 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:54,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:36:54,489 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 64 more)] === [2022-02-20 23:36:54,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:54,490 INFO L85 PathProgramCache]: Analyzing trace with hash 59263662, now seen corresponding path program 1 times [2022-02-20 23:36:54,490 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:54,490 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150993662] [2022-02-20 23:36:54,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:54,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:54,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {2077#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(15, 2); {2077#true} is VALID [2022-02-20 23:36:54,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {2077#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, 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~nondet2#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1, main_#t~short9#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem19#1, main_#t~short20#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(8);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; {2079#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 8))} is VALID [2022-02-20 23:36:54,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {2079#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 8))} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L997 {2079#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 8))} is VALID [2022-02-20 23:36:54,570 INFO L290 TraceCheckUtils]: 3: Hoare triple {2079#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 8))} SUMMARY for call write~int(0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {2079#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 8))} is VALID [2022-02-20 23:36:54,571 INFO L290 TraceCheckUtils]: 4: Hoare triple {2079#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 8))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~marked~0#1 := 0; {2080#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)))} is VALID [2022-02-20 23:36:54,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {2080#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {2080#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)))} is VALID [2022-02-20 23:36:54,572 INFO L290 TraceCheckUtils]: 6: Hoare triple {2080#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)))} assume !!(0 != main_#t~nondet2#1 || 0 == main_~marked~0#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8); {2080#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)))} is VALID [2022-02-20 23:36:54,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {2080#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)))} assume !(4 + main_~x~0#1.offset <= #length[main_~x~0#1.base] && 0 <= main_~x~0#1.offset); {2078#false} is VALID [2022-02-20 23:36:54,573 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 23:36:54,573 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:54,573 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150993662] [2022-02-20 23:36:54,573 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150993662] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:54,573 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:54,574 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:36:54,574 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475402368] [2022-02-20 23:36:54,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:54,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2022-02-20 23:36:54,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:54,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 23:36:54,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:54,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:36:54,580 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:54,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:36:54,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:36:54,581 INFO L87 Difference]: Start difference. First operand 151 states and 173 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 23:36:55,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:55,006 INFO L93 Difference]: Finished difference Result 229 states and 253 transitions. [2022-02-20 23:36:55,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:36:55,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2022-02-20 23:36:55,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:55,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 23:36:55,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 265 transitions. [2022-02-20 23:36:55,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 23:36:55,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 265 transitions. [2022-02-20 23:36:55,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 265 transitions. [2022-02-20 23:36:55,211 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 265 edges. 265 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:55,213 INFO L225 Difference]: With dead ends: 229 [2022-02-20 23:36:55,213 INFO L226 Difference]: Without dead ends: 229 [2022-02-20 23:36:55,214 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 23:36:55,214 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 299 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:55,215 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 138 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:55,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-02-20 23:36:55,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 197. [2022-02-20 23:36:55,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:55,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 229 states. Second operand has 197 states, 149 states have (on average 1.5771812080536913) internal successors, (235), 196 states have internal predecessors, (235), 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 23:36:55,218 INFO L74 IsIncluded]: Start isIncluded. First operand 229 states. Second operand has 197 states, 149 states have (on average 1.5771812080536913) internal successors, (235), 196 states have internal predecessors, (235), 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 23:36:55,219 INFO L87 Difference]: Start difference. First operand 229 states. Second operand has 197 states, 149 states have (on average 1.5771812080536913) internal successors, (235), 196 states have internal predecessors, (235), 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 23:36:55,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:55,223 INFO L93 Difference]: Finished difference Result 229 states and 253 transitions. [2022-02-20 23:36:55,223 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 253 transitions. [2022-02-20 23:36:55,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:55,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:55,224 INFO L74 IsIncluded]: Start isIncluded. First operand has 197 states, 149 states have (on average 1.5771812080536913) internal successors, (235), 196 states have internal predecessors, (235), 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 229 states. [2022-02-20 23:36:55,224 INFO L87 Difference]: Start difference. First operand has 197 states, 149 states have (on average 1.5771812080536913) internal successors, (235), 196 states have internal predecessors, (235), 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 229 states. [2022-02-20 23:36:55,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:55,228 INFO L93 Difference]: Finished difference Result 229 states and 253 transitions. [2022-02-20 23:36:55,228 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 253 transitions. [2022-02-20 23:36:55,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:55,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:55,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:55,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:55,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 149 states have (on average 1.5771812080536913) internal successors, (235), 196 states have internal predecessors, (235), 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 23:36:55,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 235 transitions. [2022-02-20 23:36:55,233 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 235 transitions. Word has length 8 [2022-02-20 23:36:55,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:55,233 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 235 transitions. [2022-02-20 23:36:55,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 23:36:55,233 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 235 transitions. [2022-02-20 23:36:55,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 23:36:55,233 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:55,234 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:55,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:36:55,234 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 64 more)] === [2022-02-20 23:36:55,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:55,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1117776432, now seen corresponding path program 1 times [2022-02-20 23:36:55,234 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:55,235 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222084711] [2022-02-20 23:36:55,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:55,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:55,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {2969#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(15, 2); {2969#true} is VALID [2022-02-20 23:36:55,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {2969#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, 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~nondet2#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1, main_#t~short9#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem19#1, main_#t~short20#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(8);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; {2969#true} is VALID [2022-02-20 23:36:55,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {2969#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L997 {2969#true} is VALID [2022-02-20 23:36:55,256 INFO L290 TraceCheckUtils]: 3: Hoare triple {2969#true} SUMMARY for call write~int(0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {2969#true} is VALID [2022-02-20 23:36:55,256 INFO L290 TraceCheckUtils]: 4: Hoare triple {2969#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~marked~0#1 := 0; {2971#(= |ULTIMATE.start_main_~marked~0#1| 0)} is VALID [2022-02-20 23:36:55,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {2971#(= |ULTIMATE.start_main_~marked~0#1| 0)} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {2971#(= |ULTIMATE.start_main_~marked~0#1| 0)} is VALID [2022-02-20 23:36:55,257 INFO L290 TraceCheckUtils]: 6: Hoare triple {2971#(= |ULTIMATE.start_main_~marked~0#1| 0)} assume !(0 != main_#t~nondet2#1 || 0 == main_~marked~0#1);havoc main_#t~nondet2#1; {2970#false} is VALID [2022-02-20 23:36:55,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {2970#false} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {2970#false} is VALID [2022-02-20 23:36:55,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {2970#false} assume !(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {2970#false} is VALID [2022-02-20 23:36:55,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {2970#false} assume !false; {2970#false} is VALID [2022-02-20 23:36:55,258 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 23:36:55,258 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:55,258 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222084711] [2022-02-20 23:36:55,258 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222084711] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:55,258 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:55,258 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:36:55,258 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723052879] [2022-02-20 23:36:55,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:55,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2022-02-20 23:36:55,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:55,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 23:36:55,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:55,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:36:55,265 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:55,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:36:55,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:36:55,265 INFO L87 Difference]: Start difference. First operand 197 states and 235 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 23:36:55,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:55,383 INFO L93 Difference]: Finished difference Result 237 states and 278 transitions. [2022-02-20 23:36:55,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:36:55,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2022-02-20 23:36:55,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:55,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 23:36:55,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2022-02-20 23:36:55,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 23:36:55,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2022-02-20 23:36:55,387 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 186 transitions. [2022-02-20 23:36:55,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:55,505 INFO L225 Difference]: With dead ends: 237 [2022-02-20 23:36:55,505 INFO L226 Difference]: Without dead ends: 237 [2022-02-20 23:36:55,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:36:55,506 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 105 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:55,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 211 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:36:55,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-02-20 23:36:55,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 207. [2022-02-20 23:36:55,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:55,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 237 states. Second operand has 207 states, 159 states have (on average 1.5660377358490567) internal successors, (249), 206 states have internal predecessors, (249), 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 23:36:55,511 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand has 207 states, 159 states have (on average 1.5660377358490567) internal successors, (249), 206 states have internal predecessors, (249), 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 23:36:55,512 INFO L87 Difference]: Start difference. First operand 237 states. Second operand has 207 states, 159 states have (on average 1.5660377358490567) internal successors, (249), 206 states have internal predecessors, (249), 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 23:36:55,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:55,516 INFO L93 Difference]: Finished difference Result 237 states and 278 transitions. [2022-02-20 23:36:55,516 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 278 transitions. [2022-02-20 23:36:55,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:55,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:55,517 INFO L74 IsIncluded]: Start isIncluded. First operand has 207 states, 159 states have (on average 1.5660377358490567) internal successors, (249), 206 states have internal predecessors, (249), 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 237 states. [2022-02-20 23:36:55,517 INFO L87 Difference]: Start difference. First operand has 207 states, 159 states have (on average 1.5660377358490567) internal successors, (249), 206 states have internal predecessors, (249), 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 237 states. [2022-02-20 23:36:55,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:55,522 INFO L93 Difference]: Finished difference Result 237 states and 278 transitions. [2022-02-20 23:36:55,522 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 278 transitions. [2022-02-20 23:36:55,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:55,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:55,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:55,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:55,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 159 states have (on average 1.5660377358490567) internal successors, (249), 206 states have internal predecessors, (249), 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 23:36:55,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 249 transitions. [2022-02-20 23:36:55,526 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 249 transitions. Word has length 10 [2022-02-20 23:36:55,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:55,527 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 249 transitions. [2022-02-20 23:36:55,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 23:36:55,527 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 249 transitions. [2022-02-20 23:36:55,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:36:55,527 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:55,527 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:55,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:36:55,530 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 64 more)] === [2022-02-20 23:36:55,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:55,531 INFO L85 PathProgramCache]: Analyzing trace with hash 467003055, now seen corresponding path program 1 times [2022-02-20 23:36:55,531 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:55,531 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207414399] [2022-02-20 23:36:55,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:55,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:55,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:55,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {3892#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(15, 2); {3892#true} is VALID [2022-02-20 23:36:55,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {3892#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, 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~nondet2#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1, main_#t~short9#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem19#1, main_#t~short20#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(8);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; {3892#true} is VALID [2022-02-20 23:36:55,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {3892#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L997 {3892#true} is VALID [2022-02-20 23:36:55,593 INFO L290 TraceCheckUtils]: 3: Hoare triple {3892#true} SUMMARY for call write~int(0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {3892#true} is VALID [2022-02-20 23:36:55,593 INFO L290 TraceCheckUtils]: 4: Hoare triple {3892#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~marked~0#1 := 0; {3892#true} is VALID [2022-02-20 23:36:55,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {3892#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {3892#true} is VALID [2022-02-20 23:36:55,594 INFO L290 TraceCheckUtils]: 6: Hoare triple {3892#true} assume !!(0 != main_#t~nondet2#1 || 0 == main_~marked~0#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8); {3894#(= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1)} is VALID [2022-02-20 23:36:55,594 INFO L290 TraceCheckUtils]: 7: Hoare triple {3894#(= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1)} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1007 {3895#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:36:55,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {3895#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {3895#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:36:55,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {3895#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1008 {3896#(= (select |#valid| |ULTIMATE.start_main_#t~mem4#1.base|) 1)} is VALID [2022-02-20 23:36:55,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {3896#(= (select |#valid| |ULTIMATE.start_main_#t~mem4#1.base|) 1)} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem4#1.base, main_#t~mem4#1.offset;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {3897#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:36:55,596 INFO L290 TraceCheckUtils]: 11: Hoare triple {3897#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !(1 == #valid[main_~x~0#1.base]); {3893#false} is VALID [2022-02-20 23:36:55,597 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 23:36:55,597 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:55,597 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207414399] [2022-02-20 23:36:55,597 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207414399] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:55,597 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:55,597 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:36:55,597 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091452194] [2022-02-20 23:36:55,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:55,598 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 12 [2022-02-20 23:36:55,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:55,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 23:36:55,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:55,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:36:55,605 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:55,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:36:55,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:36:55,606 INFO L87 Difference]: Start difference. First operand 207 states and 249 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 23:36:56,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:56,228 INFO L93 Difference]: Finished difference Result 213 states and 254 transitions. [2022-02-20 23:36:56,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:36:56,228 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 12 [2022-02-20 23:36:56,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:56,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 23:36:56,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions. [2022-02-20 23:36:56,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 23:36:56,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions. [2022-02-20 23:36:56,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 160 transitions. [2022-02-20 23:36:56,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:56,350 INFO L225 Difference]: With dead ends: 213 [2022-02-20 23:36:56,350 INFO L226 Difference]: Without dead ends: 213 [2022-02-20 23:36:56,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:36:56,353 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 100 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:56,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 356 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:36:56,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-02-20 23:36:56,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 206. [2022-02-20 23:36:56,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:56,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 213 states. Second operand has 206 states, 159 states have (on average 1.5534591194968554) internal successors, (247), 205 states have internal predecessors, (247), 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 23:36:56,358 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand has 206 states, 159 states have (on average 1.5534591194968554) internal successors, (247), 205 states have internal predecessors, (247), 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 23:36:56,358 INFO L87 Difference]: Start difference. First operand 213 states. Second operand has 206 states, 159 states have (on average 1.5534591194968554) internal successors, (247), 205 states have internal predecessors, (247), 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 23:36:56,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:56,370 INFO L93 Difference]: Finished difference Result 213 states and 254 transitions. [2022-02-20 23:36:56,370 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 254 transitions. [2022-02-20 23:36:56,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:56,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:56,371 INFO L74 IsIncluded]: Start isIncluded. First operand has 206 states, 159 states have (on average 1.5534591194968554) internal successors, (247), 205 states have internal predecessors, (247), 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 213 states. [2022-02-20 23:36:56,371 INFO L87 Difference]: Start difference. First operand has 206 states, 159 states have (on average 1.5534591194968554) internal successors, (247), 205 states have internal predecessors, (247), 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 213 states. [2022-02-20 23:36:56,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:56,374 INFO L93 Difference]: Finished difference Result 213 states and 254 transitions. [2022-02-20 23:36:56,375 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 254 transitions. [2022-02-20 23:36:56,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:56,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:56,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:56,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:56,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 159 states have (on average 1.5534591194968554) internal successors, (247), 205 states have internal predecessors, (247), 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 23:36:56,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 247 transitions. [2022-02-20 23:36:56,378 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 247 transitions. Word has length 12 [2022-02-20 23:36:56,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:56,378 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 247 transitions. [2022-02-20 23:36:56,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 23:36:56,379 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 247 transitions. [2022-02-20 23:36:56,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:36:56,379 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:56,379 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:56,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:36:56,379 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 64 more)] === [2022-02-20 23:36:56,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:56,380 INFO L85 PathProgramCache]: Analyzing trace with hash 467003056, now seen corresponding path program 1 times [2022-02-20 23:36:56,380 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:56,380 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037747325] [2022-02-20 23:36:56,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:56,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:56,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:56,442 INFO L290 TraceCheckUtils]: 0: Hoare triple {4753#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(15, 2); {4753#true} is VALID [2022-02-20 23:36:56,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {4753#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, 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~nondet2#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1, main_#t~short9#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem19#1, main_#t~short20#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(8);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; {4753#true} is VALID [2022-02-20 23:36:56,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {4753#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L997 {4753#true} is VALID [2022-02-20 23:36:56,443 INFO L290 TraceCheckUtils]: 3: Hoare triple {4753#true} SUMMARY for call write~int(0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {4753#true} is VALID [2022-02-20 23:36:56,443 INFO L290 TraceCheckUtils]: 4: Hoare triple {4753#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~marked~0#1 := 0; {4753#true} is VALID [2022-02-20 23:36:56,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {4753#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {4753#true} is VALID [2022-02-20 23:36:56,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {4753#true} assume !!(0 != main_#t~nondet2#1 || 0 == main_~marked~0#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8); {4755#(and (= |ULTIMATE.start_main_#t~malloc3#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|)))} is VALID [2022-02-20 23:36:56,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {4755#(and (= |ULTIMATE.start_main_#t~malloc3#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1007 {4756#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |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|) 0))} is VALID [2022-02-20 23:36:56,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {4756#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |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|) 0))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {4756#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |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|) 0))} is VALID [2022-02-20 23:36:56,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {4756#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |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|) 0))} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1008 {4757#(and (= |ULTIMATE.start_main_#t~mem4#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_#t~mem4#1.base|)))} is VALID [2022-02-20 23:36:56,446 INFO L290 TraceCheckUtils]: 10: Hoare triple {4757#(and (= |ULTIMATE.start_main_#t~mem4#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_#t~mem4#1.base|)))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem4#1.base, main_#t~mem4#1.offset;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {4758#(and (<= 8 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} is VALID [2022-02-20 23:36:56,446 INFO L290 TraceCheckUtils]: 11: Hoare triple {4758#(and (<= 8 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} assume !(4 + main_~x~0#1.offset <= #length[main_~x~0#1.base] && 0 <= main_~x~0#1.offset); {4754#false} is VALID [2022-02-20 23:36:56,446 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 23:36:56,447 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:56,447 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037747325] [2022-02-20 23:36:56,447 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037747325] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:56,447 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:56,447 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:36:56,447 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721346628] [2022-02-20 23:36:56,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:56,448 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 12 [2022-02-20 23:36:56,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:56,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 23:36:56,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:56,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:36:56,456 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:56,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:36:56,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:36:56,456 INFO L87 Difference]: Start difference. First operand 206 states and 247 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 23:36:57,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:57,045 INFO L93 Difference]: Finished difference Result 202 states and 240 transitions. [2022-02-20 23:36:57,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:36:57,045 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 12 [2022-02-20 23:36:57,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:57,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 23:36:57,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 153 transitions. [2022-02-20 23:36:57,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 23:36:57,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 153 transitions. [2022-02-20 23:36:57,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 153 transitions. [2022-02-20 23:36:57,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:57,145 INFO L225 Difference]: With dead ends: 202 [2022-02-20 23:36:57,145 INFO L226 Difference]: Without dead ends: 202 [2022-02-20 23:36:57,146 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:36:57,146 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 15 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:57,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 434 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:36:57,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-02-20 23:36:57,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 196. [2022-02-20 23:36:57,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:57,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 202 states. Second operand has 196 states, 154 states have (on average 1.5194805194805194) internal successors, (234), 195 states have internal predecessors, (234), 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 23:36:57,149 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand has 196 states, 154 states have (on average 1.5194805194805194) internal successors, (234), 195 states have internal predecessors, (234), 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 23:36:57,149 INFO L87 Difference]: Start difference. First operand 202 states. Second operand has 196 states, 154 states have (on average 1.5194805194805194) internal successors, (234), 195 states have internal predecessors, (234), 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 23:36:57,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:57,152 INFO L93 Difference]: Finished difference Result 202 states and 240 transitions. [2022-02-20 23:36:57,152 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 240 transitions. [2022-02-20 23:36:57,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:57,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:57,152 INFO L74 IsIncluded]: Start isIncluded. First operand has 196 states, 154 states have (on average 1.5194805194805194) internal successors, (234), 195 states have internal predecessors, (234), 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 202 states. [2022-02-20 23:36:57,153 INFO L87 Difference]: Start difference. First operand has 196 states, 154 states have (on average 1.5194805194805194) internal successors, (234), 195 states have internal predecessors, (234), 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 202 states. [2022-02-20 23:36:57,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:57,155 INFO L93 Difference]: Finished difference Result 202 states and 240 transitions. [2022-02-20 23:36:57,155 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 240 transitions. [2022-02-20 23:36:57,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:57,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:57,156 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:57,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:57,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 154 states have (on average 1.5194805194805194) internal successors, (234), 195 states have internal predecessors, (234), 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 23:36:57,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 234 transitions. [2022-02-20 23:36:57,158 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 234 transitions. Word has length 12 [2022-02-20 23:36:57,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:57,159 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 234 transitions. [2022-02-20 23:36:57,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 23:36:57,159 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 234 transitions. [2022-02-20 23:36:57,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 23:36:57,159 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:57,159 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:57,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 23:36:57,160 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 64 more)] === [2022-02-20 23:36:57,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:57,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1270421215, now seen corresponding path program 1 times [2022-02-20 23:36:57,160 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:57,160 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251124845] [2022-02-20 23:36:57,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:57,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:57,205 INFO L290 TraceCheckUtils]: 0: Hoare triple {5575#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(15, 2); {5575#true} is VALID [2022-02-20 23:36:57,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {5575#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, 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~nondet2#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1, main_#t~short9#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem19#1, main_#t~short20#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(8);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; {5577#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:57,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {5577#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L997 {5577#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:57,206 INFO L290 TraceCheckUtils]: 3: Hoare triple {5577#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} SUMMARY for call write~int(0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {5577#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:57,206 INFO L290 TraceCheckUtils]: 4: Hoare triple {5577#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~marked~0#1 := 0; {5577#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:57,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {5577#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {5577#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:57,207 INFO L290 TraceCheckUtils]: 6: Hoare triple {5577#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} assume !!(0 != main_#t~nondet2#1 || 0 == main_~marked~0#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8); {5577#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:57,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {5577#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1007 {5577#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:57,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {5577#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {5577#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:57,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {5577#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1008 {5577#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:57,208 INFO L290 TraceCheckUtils]: 10: Hoare triple {5577#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem4#1.base, main_#t~mem4#1.offset;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {5577#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:57,208 INFO L290 TraceCheckUtils]: 11: Hoare triple {5577#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1009 {5577#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:57,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {5577#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {5577#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:57,209 INFO L290 TraceCheckUtils]: 13: Hoare triple {5577#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} assume 0 != main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~marked~0#1 := 1; {5577#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:57,209 INFO L290 TraceCheckUtils]: 14: Hoare triple {5577#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} assume 0 != main_~marked~0#1; {5577#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:57,210 INFO L290 TraceCheckUtils]: 15: Hoare triple {5577#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} SUMMARY for call write~int(1, main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1017 {5577#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:57,210 INFO L290 TraceCheckUtils]: 16: Hoare triple {5577#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {5577#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:57,210 INFO L290 TraceCheckUtils]: 17: Hoare triple {5577#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} assume !(0 != main_#t~nondet2#1 || 0 == main_~marked~0#1);havoc main_#t~nondet2#1; {5577#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:57,211 INFO L290 TraceCheckUtils]: 18: Hoare triple {5577#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {5578#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} is VALID [2022-02-20 23:36:57,211 INFO L290 TraceCheckUtils]: 19: Hoare triple {5578#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} assume !(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {5576#false} is VALID [2022-02-20 23:36:57,211 INFO L290 TraceCheckUtils]: 20: Hoare triple {5576#false} assume !false; {5576#false} is VALID [2022-02-20 23:36:57,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:36:57,212 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:57,212 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251124845] [2022-02-20 23:36:57,212 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251124845] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:57,212 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:57,212 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:36:57,212 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581612558] [2022-02-20 23:36:57,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:57,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 23:36:57,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:57,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:57,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:57,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:36:57,225 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:57,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:36:57,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:36:57,226 INFO L87 Difference]: Start difference. First operand 196 states and 234 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:57,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:57,565 INFO L93 Difference]: Finished difference Result 226 states and 249 transitions. [2022-02-20 23:36:57,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:36:57,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 23:36:57,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:57,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:57,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 233 transitions. [2022-02-20 23:36:57,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:57,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 233 transitions. [2022-02-20 23:36:57,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 233 transitions. [2022-02-20 23:36:57,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 233 edges. 233 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:57,662 INFO L225 Difference]: With dead ends: 226 [2022-02-20 23:36:57,662 INFO L226 Difference]: Without dead ends: 226 [2022-02-20 23:36:57,663 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 23:36:57,663 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 267 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:57,663 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 187 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:57,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-02-20 23:36:57,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 194. [2022-02-20 23:36:57,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:57,666 INFO L82 GeneralOperation]: Start isEquivalent. First operand 226 states. Second operand has 194 states, 153 states have (on average 1.5032679738562091) internal successors, (230), 193 states have internal predecessors, (230), 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 23:36:57,666 INFO L74 IsIncluded]: Start isIncluded. First operand 226 states. Second operand has 194 states, 153 states have (on average 1.5032679738562091) internal successors, (230), 193 states have internal predecessors, (230), 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 23:36:57,666 INFO L87 Difference]: Start difference. First operand 226 states. Second operand has 194 states, 153 states have (on average 1.5032679738562091) internal successors, (230), 193 states have internal predecessors, (230), 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 23:36:57,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:57,673 INFO L93 Difference]: Finished difference Result 226 states and 249 transitions. [2022-02-20 23:36:57,673 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 249 transitions. [2022-02-20 23:36:57,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:57,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:57,678 INFO L74 IsIncluded]: Start isIncluded. First operand has 194 states, 153 states have (on average 1.5032679738562091) internal successors, (230), 193 states have internal predecessors, (230), 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 226 states. [2022-02-20 23:36:57,679 INFO L87 Difference]: Start difference. First operand has 194 states, 153 states have (on average 1.5032679738562091) internal successors, (230), 193 states have internal predecessors, (230), 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 226 states. [2022-02-20 23:36:57,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:57,682 INFO L93 Difference]: Finished difference Result 226 states and 249 transitions. [2022-02-20 23:36:57,683 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 249 transitions. [2022-02-20 23:36:57,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:57,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:57,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:57,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:57,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 153 states have (on average 1.5032679738562091) internal successors, (230), 193 states have internal predecessors, (230), 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 23:36:57,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 230 transitions. [2022-02-20 23:36:57,686 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 230 transitions. Word has length 21 [2022-02-20 23:36:57,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:57,686 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 230 transitions. [2022-02-20 23:36:57,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:57,686 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 230 transitions. [2022-02-20 23:36:57,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:36:57,687 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:57,687 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:57,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 23:36:57,687 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 64 more)] === [2022-02-20 23:36:57,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:57,688 INFO L85 PathProgramCache]: Analyzing trace with hash -697189136, now seen corresponding path program 1 times [2022-02-20 23:36:57,688 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:57,688 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458471604] [2022-02-20 23:36:57,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:57,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:57,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {6455#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(15, 2); {6455#true} is VALID [2022-02-20 23:36:57,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {6455#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, 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~nondet2#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1, main_#t~short9#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem19#1, main_#t~short20#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(8);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; {6455#true} is VALID [2022-02-20 23:36:57,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {6455#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L997 {6457#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:36:57,879 INFO L290 TraceCheckUtils]: 3: Hoare triple {6457#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} SUMMARY for call write~int(0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {6457#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:36:57,880 INFO L290 TraceCheckUtils]: 4: Hoare triple {6457#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~marked~0#1 := 0; {6458#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:36:57,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {6458#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {6458#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:36:57,881 INFO L290 TraceCheckUtils]: 6: Hoare triple {6458#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} assume !!(0 != main_#t~nondet2#1 || 0 == main_~marked~0#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8); {6459#(and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|))} is VALID [2022-02-20 23:36:57,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {6459#(and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1007 {6460#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1))} is VALID [2022-02-20 23:36:57,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {6460#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {6460#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1))} is VALID [2022-02-20 23:36:57,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {6460#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1))} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1008 {6461#(and (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:36:57,884 INFO L290 TraceCheckUtils]: 10: Hoare triple {6461#(and (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem4#1.base, main_#t~mem4#1.offset;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {6462#(and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:36:57,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {6462#(and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} SUMMARY for call write~$Pointer$(0, 0, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1009 {6462#(and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:36:57,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {6462#(and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {6462#(and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:36:57,886 INFO L290 TraceCheckUtils]: 13: Hoare triple {6462#(and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} assume 0 != main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~marked~0#1 := 1; {6463#(or (and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)) (= |ULTIMATE.start_main_~marked~0#1| 0))} is VALID [2022-02-20 23:36:57,886 INFO L290 TraceCheckUtils]: 14: Hoare triple {6463#(or (and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)) (= |ULTIMATE.start_main_~marked~0#1| 0))} assume 0 != main_~marked~0#1; {6462#(and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:36:57,887 INFO L290 TraceCheckUtils]: 15: Hoare triple {6462#(and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} SUMMARY for call write~int(1, main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1017 {6464#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)} is VALID [2022-02-20 23:36:57,887 INFO L290 TraceCheckUtils]: 16: Hoare triple {6464#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {6464#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)} is VALID [2022-02-20 23:36:57,888 INFO L290 TraceCheckUtils]: 17: Hoare triple {6464#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)} assume !(0 != main_#t~nondet2#1 || 0 == main_~marked~0#1);havoc main_#t~nondet2#1; {6464#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)} is VALID [2022-02-20 23:36:57,888 INFO L290 TraceCheckUtils]: 18: Hoare triple {6464#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {6465#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:36:57,889 INFO L290 TraceCheckUtils]: 19: Hoare triple {6465#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {6465#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:36:57,889 INFO L290 TraceCheckUtils]: 20: Hoare triple {6465#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} goto; {6465#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:36:57,889 INFO L290 TraceCheckUtils]: 21: Hoare triple {6465#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} main_~marked~0#1 := 0; {6465#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:36:57,890 INFO L290 TraceCheckUtils]: 22: Hoare triple {6465#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1027-9 {6465#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:36:57,890 INFO L290 TraceCheckUtils]: 23: Hoare triple {6465#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} main_#t~short9#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {6465#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:36:57,891 INFO L290 TraceCheckUtils]: 24: Hoare triple {6465#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} assume main_#t~short9#1; {6465#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:36:57,891 INFO L290 TraceCheckUtils]: 25: Hoare triple {6465#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1027-3 {6466#(= (select |#valid| |ULTIMATE.start_main_#t~mem7#1.base|) 1)} is VALID [2022-02-20 23:36:57,892 INFO L290 TraceCheckUtils]: 26: Hoare triple {6466#(= (select |#valid| |ULTIMATE.start_main_#t~mem7#1.base|) 1)} assume !(1 == #valid[main_#t~mem7#1.base]); {6456#false} is VALID [2022-02-20 23:36:57,892 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 23:36:57,892 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:57,892 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458471604] [2022-02-20 23:36:57,892 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458471604] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:36:57,893 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176145411] [2022-02-20 23:36:57,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:57,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:36:57,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:36:57,894 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 23:36:57,895 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 23:36:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:57,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 33 conjunts are in the unsatisfiable core [2022-02-20 23:36:57,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:57,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:36:58,062 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 23:36:58,212 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-20 23:36:58,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-02-20 23:36:58,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:36:58,437 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:36:58,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-02-20 23:36:58,513 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:36:58,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-02-20 23:36:58,777 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:36:58,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-02-20 23:36:58,828 INFO L290 TraceCheckUtils]: 0: Hoare triple {6455#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(15, 2); {6455#true} is VALID [2022-02-20 23:36:58,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {6455#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, 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~nondet2#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1, main_#t~short9#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem19#1, main_#t~short20#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(8);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; {6473#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:36:58,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {6473#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L997 {6473#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:36:58,830 INFO L290 TraceCheckUtils]: 3: Hoare triple {6473#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} SUMMARY for call write~int(0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {6473#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:36:58,830 INFO L290 TraceCheckUtils]: 4: Hoare triple {6473#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~marked~0#1 := 0; {6483#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:36:58,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {6483#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {6483#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:36:58,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {6483#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} assume !!(0 != main_#t~nondet2#1 || 0 == main_~marked~0#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8); {6490#(and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:36:58,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {6490#(and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1007 {6494#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1))} is VALID [2022-02-20 23:36:58,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {6494#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {6494#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1))} is VALID [2022-02-20 23:36:58,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {6494#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1))} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1008 {6501#(and (= |ULTIMATE.start_main_#t~mem4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |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|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:36:58,834 INFO L290 TraceCheckUtils]: 10: Hoare triple {6501#(and (= |ULTIMATE.start_main_#t~mem4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |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|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem4#1.base, main_#t~mem4#1.offset;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {6505#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:36:58,835 INFO L290 TraceCheckUtils]: 11: Hoare triple {6505#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} SUMMARY for call write~$Pointer$(0, 0, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1009 {6505#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:36:58,835 INFO L290 TraceCheckUtils]: 12: Hoare triple {6505#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {6505#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:36:58,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {6505#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} assume 0 != main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~marked~0#1 := 1; {6505#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:36:58,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {6505#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} assume 0 != main_~marked~0#1; {6505#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:36:58,837 INFO L290 TraceCheckUtils]: 15: Hoare triple {6505#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} SUMMARY for call write~int(1, main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1017 {6521#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:36:58,837 INFO L290 TraceCheckUtils]: 16: Hoare triple {6521#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {6521#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:36:58,838 INFO L290 TraceCheckUtils]: 17: Hoare triple {6521#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} assume !(0 != main_#t~nondet2#1 || 0 == main_~marked~0#1);havoc main_#t~nondet2#1; {6521#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:36:58,838 INFO L290 TraceCheckUtils]: 18: Hoare triple {6521#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {6531#(and (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} is VALID [2022-02-20 23:36:58,839 INFO L290 TraceCheckUtils]: 19: Hoare triple {6531#(and (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {6531#(and (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} is VALID [2022-02-20 23:36:58,839 INFO L290 TraceCheckUtils]: 20: Hoare triple {6531#(and (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} goto; {6531#(and (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} is VALID [2022-02-20 23:36:58,840 INFO L290 TraceCheckUtils]: 21: Hoare triple {6531#(and (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} main_~marked~0#1 := 0; {6531#(and (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} is VALID [2022-02-20 23:36:58,840 INFO L290 TraceCheckUtils]: 22: Hoare triple {6531#(and (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1027-9 {6544#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} is VALID [2022-02-20 23:36:58,841 INFO L290 TraceCheckUtils]: 23: Hoare triple {6544#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} main_#t~short9#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {6544#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} is VALID [2022-02-20 23:36:58,841 INFO L290 TraceCheckUtils]: 24: Hoare triple {6544#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} assume main_#t~short9#1; {6544#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} is VALID [2022-02-20 23:36:58,842 INFO L290 TraceCheckUtils]: 25: Hoare triple {6544#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1027-3 {6554#(and (= (select |#valid| |ULTIMATE.start_main_#t~mem7#1.base|) 1) (exists ((|ULTIMATE.start_main_~x~0#1.base| Int)) (and (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (not (= |ULTIMATE.start_main_#t~mem7#1.base| |ULTIMATE.start_main_~x~0#1.base|)))))} is VALID [2022-02-20 23:36:58,842 INFO L290 TraceCheckUtils]: 26: Hoare triple {6554#(and (= (select |#valid| |ULTIMATE.start_main_#t~mem7#1.base|) 1) (exists ((|ULTIMATE.start_main_~x~0#1.base| Int)) (and (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (not (= |ULTIMATE.start_main_#t~mem7#1.base| |ULTIMATE.start_main_~x~0#1.base|)))))} assume !(1 == #valid[main_#t~mem7#1.base]); {6456#false} is VALID [2022-02-20 23:36:58,843 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 23:36:58,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:36:59,805 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:36:59,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-02-20 23:36:59,828 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:36:59,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2022-02-20 23:36:59,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-02-20 23:37:01,442 INFO L290 TraceCheckUtils]: 26: Hoare triple {6466#(= (select |#valid| |ULTIMATE.start_main_#t~mem7#1.base|) 1)} assume !(1 == #valid[main_#t~mem7#1.base]); {6456#false} is VALID [2022-02-20 23:37:01,443 INFO L290 TraceCheckUtils]: 25: Hoare triple {6465#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1027-3 {6466#(= (select |#valid| |ULTIMATE.start_main_#t~mem7#1.base|) 1)} is VALID [2022-02-20 23:37:01,443 INFO L290 TraceCheckUtils]: 24: Hoare triple {6465#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} assume main_#t~short9#1; {6465#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:37:01,443 INFO L290 TraceCheckUtils]: 23: Hoare triple {6465#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} main_#t~short9#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {6465#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:37:01,444 INFO L290 TraceCheckUtils]: 22: Hoare triple {6570#(or (< |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1027-9 {6465#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:37:01,444 INFO L290 TraceCheckUtils]: 21: Hoare triple {6570#(or (< |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1))} main_~marked~0#1 := 0; {6570#(or (< |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1))} is VALID [2022-02-20 23:37:01,444 INFO L290 TraceCheckUtils]: 20: Hoare triple {6570#(or (< |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1))} goto; {6570#(or (< |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1))} is VALID [2022-02-20 23:37:01,445 INFO L290 TraceCheckUtils]: 19: Hoare triple {6570#(or (< |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1))} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {6570#(or (< |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1))} is VALID [2022-02-20 23:37:01,445 INFO L290 TraceCheckUtils]: 18: Hoare triple {6583#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_65| Int)) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_65|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_65| |ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_65| 0)))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {6570#(or (< |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1))} is VALID [2022-02-20 23:37:01,446 INFO L290 TraceCheckUtils]: 17: Hoare triple {6583#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_65| Int)) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_65|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_65| |ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_65| 0)))} assume !(0 != main_#t~nondet2#1 || 0 == main_~marked~0#1);havoc main_#t~nondet2#1; {6583#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_65| Int)) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_65|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_65| |ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_65| 0)))} is VALID [2022-02-20 23:37:01,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {6583#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_65| Int)) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_65|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_65| |ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_65| 0)))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {6583#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_65| Int)) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_65|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_65| |ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_65| 0)))} is VALID [2022-02-20 23:37:01,447 INFO L290 TraceCheckUtils]: 15: Hoare triple {6593#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_65| Int) (v_ArrVal_202 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_65| |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_202) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_65|)) 1) (< |v_ULTIMATE.start_main_~x~0#1.offset_65| 0)))} SUMMARY for call write~int(1, main_~x~0#1.base, 4 + main_~x~0#1.offset, 4); srcloc: L1017 {6583#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_65| Int)) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_65|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_65| |ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_65| 0)))} is VALID [2022-02-20 23:37:01,448 INFO L290 TraceCheckUtils]: 14: Hoare triple {6593#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_65| Int) (v_ArrVal_202 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_65| |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_202) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_65|)) 1) (< |v_ULTIMATE.start_main_~x~0#1.offset_65| 0)))} assume 0 != main_~marked~0#1; {6593#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_65| Int) (v_ArrVal_202 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_65| |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_202) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_65|)) 1) (< |v_ULTIMATE.start_main_~x~0#1.offset_65| 0)))} is VALID [2022-02-20 23:37:01,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {6593#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_65| Int) (v_ArrVal_202 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_65| |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_202) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_65|)) 1) (< |v_ULTIMATE.start_main_~x~0#1.offset_65| 0)))} assume 0 != main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~marked~0#1 := 1; {6593#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_65| Int) (v_ArrVal_202 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_65| |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_202) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_65|)) 1) (< |v_ULTIMATE.start_main_~x~0#1.offset_65| 0)))} is VALID [2022-02-20 23:37:01,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {6593#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_65| Int) (v_ArrVal_202 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_65| |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_202) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_65|)) 1) (< |v_ULTIMATE.start_main_~x~0#1.offset_65| 0)))} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {6593#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_65| Int) (v_ArrVal_202 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_65| |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_202) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_65|)) 1) (< |v_ULTIMATE.start_main_~x~0#1.offset_65| 0)))} is VALID [2022-02-20 23:37:01,451 WARN L290 TraceCheckUtils]: 11: Hoare triple {6593#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_65| Int) (v_ArrVal_202 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_65| |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_202) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_65|)) 1) (< |v_ULTIMATE.start_main_~x~0#1.offset_65| 0)))} SUMMARY for call write~$Pointer$(0, 0, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1009 {6593#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_65| Int) (v_ArrVal_202 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_65| |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_202) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_65|)) 1) (< |v_ULTIMATE.start_main_~x~0#1.offset_65| 0)))} is UNKNOWN [2022-02-20 23:37:01,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {6609#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_65| Int) (v_ArrVal_202 (Array Int Int))) (or (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_202) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_65|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_65| |ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_65| 0)))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem4#1.base, main_#t~mem4#1.offset;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {6593#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_65| Int) (v_ArrVal_202 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_65| |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_202) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_65|)) 1) (< |v_ULTIMATE.start_main_~x~0#1.offset_65| 0)))} is VALID [2022-02-20 23:37:01,452 INFO L290 TraceCheckUtils]: 9: Hoare triple {6613#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_65| Int) (v_ArrVal_202 (Array Int Int))) (or (= (select |#valid| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_202) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_65|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_65| |ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_65| 0)))} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1008 {6609#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_65| Int) (v_ArrVal_202 (Array Int Int))) (or (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_202) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_65|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_65| |ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_65| 0)))} is VALID [2022-02-20 23:37:01,453 INFO L290 TraceCheckUtils]: 8: Hoare triple {6613#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_65| Int) (v_ArrVal_202 (Array Int Int))) (or (= (select |#valid| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_202) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_65|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_65| |ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_65| 0)))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {6613#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_65| Int) (v_ArrVal_202 (Array Int Int))) (or (= (select |#valid| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_202) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_65|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_65| |ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_65| 0)))} is VALID [2022-02-20 23:37:01,454 INFO L290 TraceCheckUtils]: 7: Hoare triple {6620#(or (forall ((v_arrayElimCell_8 Int)) (= (select |#valid| v_arrayElimCell_8) 1)) (forall ((v_arrayElimCell_7 Int)) (or (and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| v_arrayElimCell_7) 1)) (and (or (<= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (< |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_7))) (or (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (< |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|))))))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1007 {6613#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_65| Int) (v_ArrVal_202 (Array Int Int))) (or (= (select |#valid| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_202) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_65|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_65| |ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_65| 0)))} is VALID [2022-02-20 23:37:01,502 INFO L290 TraceCheckUtils]: 6: Hoare triple {6624#(forall ((v_arrayElimCell_8 Int) (v_arrayElimCell_7 Int) (|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (or (and (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_7) 1) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~head~0#1.base|))) (and (or (<= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (< |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= v_arrayElimCell_7 |v_ULTIMATE.start_main_#t~malloc3#1.base_6|))) (or (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (< |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|))) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_8) 1) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6|) 0))))} assume !!(0 != main_#t~nondet2#1 || 0 == main_~marked~0#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8); {6620#(or (forall ((v_arrayElimCell_8 Int)) (= (select |#valid| v_arrayElimCell_8) 1)) (forall ((v_arrayElimCell_7 Int)) (or (and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| v_arrayElimCell_7) 1)) (and (or (<= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (< |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_7))) (or (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (< |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|))))))} is VALID [2022-02-20 23:37:01,507 INFO L290 TraceCheckUtils]: 5: Hoare triple {6624#(forall ((v_arrayElimCell_8 Int) (v_arrayElimCell_7 Int) (|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (or (and (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_7) 1) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~head~0#1.base|))) (and (or (<= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (< |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= v_arrayElimCell_7 |v_ULTIMATE.start_main_#t~malloc3#1.base_6|))) (or (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (< |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|))) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_8) 1) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6|) 0))))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {6624#(forall ((v_arrayElimCell_8 Int) (v_arrayElimCell_7 Int) (|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (or (and (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_7) 1) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~head~0#1.base|))) (and (or (<= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (< |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= v_arrayElimCell_7 |v_ULTIMATE.start_main_#t~malloc3#1.base_6|))) (or (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (< |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|))) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_8) 1) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6|) 0))))} is VALID [2022-02-20 23:37:01,535 INFO L290 TraceCheckUtils]: 4: Hoare triple {6631#(forall ((v_arrayElimCell_8 Int) (v_arrayElimCell_7 Int) (|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (or (and (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= v_arrayElimCell_7 |v_ULTIMATE.start_main_#t~malloc3#1.base_6|))) (<= |ULTIMATE.start_main_~head~0#1.offset| 0)) (and (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_7) 1) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~head~0#1.base|))) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_8) 1) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6|) 0))))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~marked~0#1 := 0; {6624#(forall ((v_arrayElimCell_8 Int) (v_arrayElimCell_7 Int) (|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (or (and (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_7) 1) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~head~0#1.base|))) (and (or (<= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (< |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= v_arrayElimCell_7 |v_ULTIMATE.start_main_#t~malloc3#1.base_6|))) (or (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (< |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|))) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_8) 1) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6|) 0))))} is VALID [2022-02-20 23:37:01,543 INFO L290 TraceCheckUtils]: 3: Hoare triple {6631#(forall ((v_arrayElimCell_8 Int) (v_arrayElimCell_7 Int) (|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (or (and (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= v_arrayElimCell_7 |v_ULTIMATE.start_main_#t~malloc3#1.base_6|))) (<= |ULTIMATE.start_main_~head~0#1.offset| 0)) (and (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_7) 1) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~head~0#1.base|))) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_8) 1) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6|) 0))))} SUMMARY for call write~int(0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {6631#(forall ((v_arrayElimCell_8 Int) (v_arrayElimCell_7 Int) (|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (or (and (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= v_arrayElimCell_7 |v_ULTIMATE.start_main_#t~malloc3#1.base_6|))) (<= |ULTIMATE.start_main_~head~0#1.offset| 0)) (and (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_7) 1) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~head~0#1.base|))) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_8) 1) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6|) 0))))} is VALID [2022-02-20 23:37:01,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {6631#(forall ((v_arrayElimCell_8 Int) (v_arrayElimCell_7 Int) (|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (or (and (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= v_arrayElimCell_7 |v_ULTIMATE.start_main_#t~malloc3#1.base_6|))) (<= |ULTIMATE.start_main_~head~0#1.offset| 0)) (and (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_7) 1) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~head~0#1.base|))) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_8) 1) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6|) 0))))} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L997 {6631#(forall ((v_arrayElimCell_8 Int) (v_arrayElimCell_7 Int) (|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (or (and (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= v_arrayElimCell_7 |v_ULTIMATE.start_main_#t~malloc3#1.base_6|))) (<= |ULTIMATE.start_main_~head~0#1.offset| 0)) (and (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_7) 1) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~head~0#1.base|))) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_8) 1) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6|) 0))))} is VALID [2022-02-20 23:37:01,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {6455#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, 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~nondet2#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1, main_#t~short9#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem19#1, main_#t~short20#1, main_#t~mem24#1, main_#t~mem25#1, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(8);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; {6631#(forall ((v_arrayElimCell_8 Int) (v_arrayElimCell_7 Int) (|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (or (and (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= v_arrayElimCell_7 |v_ULTIMATE.start_main_#t~malloc3#1.base_6|))) (<= |ULTIMATE.start_main_~head~0#1.offset| 0)) (and (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_7) 1) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~head~0#1.base|))) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_8) 1) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6|) 0))))} is VALID [2022-02-20 23:37:01,546 INFO L290 TraceCheckUtils]: 0: Hoare triple {6455#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(15, 2); {6455#true} is VALID [2022-02-20 23:37:01,546 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 23:37:01,546 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176145411] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:37:01,546 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:37:01,546 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-02-20 23:37:01,547 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918815187] [2022-02-20 23:37:01,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:37:01,547 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 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 27 [2022-02-20 23:37:01,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:01,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 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 23:37:09,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 70 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:09,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-02-20 23:37:09,754 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:37:09,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-02-20 23:37:09,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=739, Unknown=8, NotChecked=0, Total=870 [2022-02-20 23:37:09,754 INFO L87 Difference]: Start difference. First operand 194 states and 230 transitions. Second operand has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 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 23:37:13,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:13,265 INFO L93 Difference]: Finished difference Result 500 states and 593 transitions. [2022-02-20 23:37:13,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-20 23:37:13,265 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 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 27 [2022-02-20 23:37:13,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:13,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 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 23:37:13,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 544 transitions. [2022-02-20 23:37:13,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 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 23:37:13,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 544 transitions. [2022-02-20 23:37:13,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 544 transitions.