./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/dll-sorted-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/dll-sorted-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:51:31,289 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:51:31,290 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:51:31,336 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:51:31,336 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:51:31,340 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:51:31,341 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:51:31,343 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:51:31,345 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:51:31,346 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:51:31,347 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:51:31,348 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:51:31,349 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:51:31,354 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:51:31,356 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:51:31,359 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:51:31,361 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:51:31,362 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:51:31,364 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:51:31,367 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:51:31,370 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:51:31,371 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:51:31,373 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:51:31,373 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:51:31,380 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:51:31,380 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:51:31,381 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:51:31,382 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:51:31,382 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:51:31,383 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:51:31,383 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:51:31,384 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:51:31,384 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:51:31,385 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:51:31,386 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:51:31,387 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:51:31,387 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:51:31,387 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:51:31,388 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:51:31,388 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:51:31,389 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:51:31,390 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:51:31,418 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:51:31,419 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:51:31,419 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:51:31,420 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:51:31,420 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:51:31,421 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:51:31,421 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:51:31,421 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:51:31,422 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:51:31,422 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:51:31,423 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:51:31,423 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:51:31,423 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:51:31,423 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:51:31,424 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:51:31,424 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:51:31,424 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:51:31,424 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:51:31,424 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:51:31,424 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:51:31,425 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:51:31,425 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:51:31,425 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:51:31,425 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:51:31,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:51:31,426 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:51:31,426 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:51:31,427 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:51:31,427 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:51:31,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:51:31,428 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:51:31,428 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:51:31,428 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:51:31,429 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 [2022-02-20 16:51:31,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:51:31,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:51:31,685 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:51:31,686 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:51:31,687 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:51:31,688 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-sorted-2.i [2022-02-20 16:51:31,751 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0669010f/c7e22d5ab4244cb8898226251a762a54/FLAGcb6826ff3 [2022-02-20 16:51:32,177 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:51:32,178 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i [2022-02-20 16:51:32,201 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0669010f/c7e22d5ab4244cb8898226251a762a54/FLAGcb6826ff3 [2022-02-20 16:51:32,214 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0669010f/c7e22d5ab4244cb8898226251a762a54 [2022-02-20 16:51:32,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:51:32,218 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:51:32,221 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:51:32,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:51:32,224 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:51:32,225 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:51:32" (1/1) ... [2022-02-20 16:51:32,226 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45d17099 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:32, skipping insertion in model container [2022-02-20 16:51:32,226 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:51:32" (1/1) ... [2022-02-20 16:51:32,230 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:51:32,258 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:51:32,478 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/dll-sorted-2.i[22384,22397] [2022-02-20 16:51:32,493 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/dll-sorted-2.i[22614,22627] [2022-02-20 16:51:32,498 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/dll-sorted-2.i[22989,23002] [2022-02-20 16:51:32,501 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/dll-sorted-2.i[23053,23066] [2022-02-20 16:51:32,503 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/dll-sorted-2.i[23184,23197] [2022-02-20 16:51:32,505 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/dll-sorted-2.i[23248,23261] [2022-02-20 16:51:32,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:51:32,521 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:51:32,572 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/dll-sorted-2.i[22384,22397] [2022-02-20 16:51:32,584 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/dll-sorted-2.i[22614,22627] [2022-02-20 16:51:32,589 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/dll-sorted-2.i[22989,23002] [2022-02-20 16:51:32,594 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/dll-sorted-2.i[23053,23066] [2022-02-20 16:51:32,601 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/dll-sorted-2.i[23184,23197] [2022-02-20 16:51:32,602 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/dll-sorted-2.i[23248,23261] [2022-02-20 16:51:32,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:51:32,629 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:51:32,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:32 WrapperNode [2022-02-20 16:51:32,630 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:51:32,631 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:51:32,631 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:51:32,631 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:51:32,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:32" (1/1) ... [2022-02-20 16:51:32,648 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:32" (1/1) ... [2022-02-20 16:51:32,698 INFO L137 Inliner]: procedures = 119, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 194 [2022-02-20 16:51:32,698 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:51:32,699 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:51:32,699 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:51:32,699 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:51:32,710 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:32" (1/1) ... [2022-02-20 16:51:32,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:32" (1/1) ... [2022-02-20 16:51:32,716 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:32" (1/1) ... [2022-02-20 16:51:32,717 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:32" (1/1) ... [2022-02-20 16:51:32,729 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:32" (1/1) ... [2022-02-20 16:51:32,734 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:32" (1/1) ... [2022-02-20 16:51:32,740 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:32" (1/1) ... [2022-02-20 16:51:32,743 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:51:32,744 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:51:32,744 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:51:32,744 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:51:32,746 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:32" (1/1) ... [2022-02-20 16:51:32,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:51:32,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:51:32,775 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:51:32,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:51:32,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:51:32,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:51:32,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 16:51:32,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:51:32,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 16:51:32,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 16:51:32,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:51:32,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:51:32,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:51:32,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:51:32,916 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:51:32,918 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:51:33,294 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:51:33,300 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:51:33,300 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2022-02-20 16:51:33,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:51:33 BoogieIcfgContainer [2022-02-20 16:51:33,302 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:51:33,304 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:51:33,304 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:51:33,307 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:51:33,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:51:32" (1/3) ... [2022-02-20 16:51:33,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd6ef76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:51:33, skipping insertion in model container [2022-02-20 16:51:33,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:51:32" (2/3) ... [2022-02-20 16:51:33,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd6ef76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:51:33, skipping insertion in model container [2022-02-20 16:51:33,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:51:33" (3/3) ... [2022-02-20 16:51:33,309 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-sorted-2.i [2022-02-20 16:51:33,315 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:51:33,315 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-02-20 16:51:33,353 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:51:33,366 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:51:33,366 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-02-20 16:51:33,383 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 55 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:33,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 16:51:33,388 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:51:33,388 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 16:51:33,389 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-02-20 16:51:33,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:51:33,397 INFO L85 PathProgramCache]: Analyzing trace with hash 890153286, now seen corresponding path program 1 times [2022-02-20 16:51:33,405 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:51:33,405 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324256711] [2022-02-20 16:51:33,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:51:33,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:51:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:51:33,546 INFO L290 TraceCheckUtils]: 0: Hoare triple {59#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); {59#true} is VALID [2022-02-20 16:51:33,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {59#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~short14#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem21#1, main_#t~short22#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#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(12);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4);call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4);call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4);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; {59#true} is VALID [2022-02-20 16:51:33,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {59#true} assume !true; {60#false} is VALID [2022-02-20 16:51:33,548 INFO L290 TraceCheckUtils]: 3: Hoare triple {60#false} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {60#false} is VALID [2022-02-20 16:51:33,548 INFO L290 TraceCheckUtils]: 4: Hoare triple {60#false} assume !(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {60#false} is VALID [2022-02-20 16:51:33,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {60#false} assume !false; {60#false} is VALID [2022-02-20 16:51:33,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:51:33,551 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:51:33,552 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324256711] [2022-02-20 16:51:33,552 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324256711] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:51:33,553 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:51:33,553 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:51:33,556 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667808549] [2022-02-20 16:51:33,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:51:33,561 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2022-02-20 16:51:33,564 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:51:33,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:33,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:51:33,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:51:33,576 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:51:33,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:51:33,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:51:33,598 INFO L87 Difference]: Start difference. First operand has 56 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 55 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:33,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:51:33,700 INFO L93 Difference]: Finished difference Result 106 states and 172 transitions. [2022-02-20 16:51:33,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:51:33,700 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2022-02-20 16:51:33,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:51:33,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:33,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 172 transitions. [2022-02-20 16:51:33,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:33,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 172 transitions. [2022-02-20 16:51:33,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 172 transitions. [2022-02-20 16:51:33,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:51:33,893 INFO L225 Difference]: With dead ends: 106 [2022-02-20 16:51:33,894 INFO L226 Difference]: Without dead ends: 50 [2022-02-20 16:51:33,898 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:51:33,902 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:51:33,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:51:33,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-20 16:51:33,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-02-20 16:51:33,930 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:51:33,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 49 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:33,933 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 49 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:33,935 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 49 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:33,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:51:33,941 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2022-02-20 16:51:33,941 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2022-02-20 16:51:33,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:51:33,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:51:33,943 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 49 states have internal predecessors, (60), 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 50 states. [2022-02-20 16:51:33,944 INFO L87 Difference]: Start difference. First operand has 50 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 49 states have internal predecessors, (60), 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 50 states. [2022-02-20 16:51:33,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:51:33,948 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2022-02-20 16:51:33,949 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2022-02-20 16:51:33,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:51:33,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:51:33,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:51:33,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:51:33,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 49 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:33,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2022-02-20 16:51:33,961 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 6 [2022-02-20 16:51:33,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:51:33,962 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2022-02-20 16:51:33,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:33,965 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2022-02-20 16:51:33,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 16:51:33,965 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:51:33,966 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:51:33,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:51:33,966 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-02-20 16:51:33,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:51:33,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1806859191, now seen corresponding path program 1 times [2022-02-20 16:51:33,973 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:51:33,973 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025290725] [2022-02-20 16:51:33,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:51:33,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:51:34,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:51:34,072 INFO L290 TraceCheckUtils]: 0: Hoare triple {343#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); {343#true} is VALID [2022-02-20 16:51:34,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {343#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~short14#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem21#1, main_#t~short22#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#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(12);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4);call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4);call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4);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; {345#(= |ULTIMATE.start_main_~marked~0#1| 0)} is VALID [2022-02-20 16:51:34,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {345#(= |ULTIMATE.start_main_~marked~0#1| 0)} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {345#(= |ULTIMATE.start_main_~marked~0#1| 0)} is VALID [2022-02-20 16:51:34,075 INFO L290 TraceCheckUtils]: 3: Hoare triple {345#(= |ULTIMATE.start_main_~marked~0#1| 0)} assume !(0 != main_#t~nondet2#1 || 0 == main_~marked~0#1);havoc main_#t~nondet2#1; {344#false} is VALID [2022-02-20 16:51:34,075 INFO L290 TraceCheckUtils]: 4: Hoare triple {344#false} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {344#false} is VALID [2022-02-20 16:51:34,075 INFO L290 TraceCheckUtils]: 5: Hoare triple {344#false} assume !(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {344#false} is VALID [2022-02-20 16:51:34,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {344#false} assume !false; {344#false} is VALID [2022-02-20 16:51:34,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:51:34,076 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:51:34,076 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025290725] [2022-02-20 16:51:34,076 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025290725] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:51:34,077 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:51:34,077 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:51:34,077 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904694034] [2022-02-20 16:51:34,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:51:34,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2022-02-20 16:51:34,080 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:51:34,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:34,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:51:34,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:51:34,088 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:51:34,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:51:34,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:51:34,090 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:34,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:51:34,197 INFO L93 Difference]: Finished difference Result 103 states and 126 transitions. [2022-02-20 16:51:34,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:51:34,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2022-02-20 16:51:34,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:51:34,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:34,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2022-02-20 16:51:34,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:34,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2022-02-20 16:51:34,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 126 transitions. [2022-02-20 16:51:34,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:51:34,318 INFO L225 Difference]: With dead ends: 103 [2022-02-20 16:51:34,319 INFO L226 Difference]: Without dead ends: 55 [2022-02-20 16:51:34,319 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 16:51:34,320 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 27 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:51:34,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 80 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:51:34,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-02-20 16:51:34,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-02-20 16:51:34,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:51:34,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 54 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 53 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:34,326 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 54 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 53 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:34,326 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 54 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 53 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:34,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:51:34,328 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2022-02-20 16:51:34,328 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-02-20 16:51:34,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:51:34,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:51:34,329 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 53 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 55 states. [2022-02-20 16:51:34,329 INFO L87 Difference]: Start difference. First operand has 54 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 53 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 55 states. [2022-02-20 16:51:34,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:51:34,331 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2022-02-20 16:51:34,331 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-02-20 16:51:34,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:51:34,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:51:34,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:51:34,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:51:34,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 53 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:34,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2022-02-20 16:51:34,334 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 7 [2022-02-20 16:51:34,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:51:34,334 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-02-20 16:51:34,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:34,335 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-02-20 16:51:34,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:51:34,335 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:51:34,336 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:51:34,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:51:34,336 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-02-20 16:51:34,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:51:34,337 INFO L85 PathProgramCache]: Analyzing trace with hash 443319948, now seen corresponding path program 1 times [2022-02-20 16:51:34,337 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:51:34,337 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483731022] [2022-02-20 16:51:34,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:51:34,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:51:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:51:34,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {638#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); {638#true} is VALID [2022-02-20 16:51:34,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {638#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~short14#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem21#1, main_#t~short22#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#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(12);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4);call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4);call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4);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; {640#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 16:51:34,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {640#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {640#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 16:51:34,459 INFO L290 TraceCheckUtils]: 3: Hoare triple {640#(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(12);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, main_#t~mem4#1.base, 4 + main_#t~mem4#1.offset, 4);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset;call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;call write~$Pointer$(0, 0, main_~x~0#1.base, main_~x~0#1.offset, 4);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {640#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 16:51:34,459 INFO L290 TraceCheckUtils]: 4: Hoare triple {640#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~marked~0#1 := 1; {640#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 16:51:34,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {640#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} assume 0 != main_~marked~0#1;call write~int(1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); {640#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 16:51:34,460 INFO L290 TraceCheckUtils]: 6: Hoare triple {640#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {640#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 16:51:34,461 INFO L290 TraceCheckUtils]: 7: Hoare triple {640#(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; {640#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 16:51:34,461 INFO L290 TraceCheckUtils]: 8: Hoare triple {640#(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; {641#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} is VALID [2022-02-20 16:51:34,462 INFO L290 TraceCheckUtils]: 9: Hoare triple {641#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} assume !(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {639#false} is VALID [2022-02-20 16:51:34,462 INFO L290 TraceCheckUtils]: 10: Hoare triple {639#false} assume !false; {639#false} is VALID [2022-02-20 16:51:34,463 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 16:51:34,463 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:51:34,463 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483731022] [2022-02-20 16:51:34,463 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483731022] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:51:34,463 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:51:34,464 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:51:34,464 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583196149] [2022-02-20 16:51:34,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:51:34,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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 11 [2022-02-20 16:51:34,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:51:34,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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 16:51:34,475 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 16:51:34,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:51:34,475 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:51:34,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:51:34,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:51:34,476 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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 16:51:34,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:51:34,687 INFO L93 Difference]: Finished difference Result 87 states and 105 transitions. [2022-02-20 16:51:34,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:51:34,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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 11 [2022-02-20 16:51:34,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:51:34,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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 16:51:34,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-02-20 16:51:34,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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 16:51:34,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-02-20 16:51:34,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 100 transitions. [2022-02-20 16:51:34,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:51:34,806 INFO L225 Difference]: With dead ends: 87 [2022-02-20 16:51:34,806 INFO L226 Difference]: Without dead ends: 85 [2022-02-20 16:51:34,806 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:51:34,807 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 129 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:51:34,807 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 65 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:51:34,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-02-20 16:51:34,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 52. [2022-02-20 16:51:34,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:51:34,812 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 52 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 51 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:34,812 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 52 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 51 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:34,812 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 52 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 51 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:34,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:51:34,815 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2022-02-20 16:51:34,815 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-02-20 16:51:34,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:51:34,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:51:34,816 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 51 states have internal predecessors, (63), 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 85 states. [2022-02-20 16:51:34,816 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 51 states have internal predecessors, (63), 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 85 states. [2022-02-20 16:51:34,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:51:34,819 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2022-02-20 16:51:34,819 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-02-20 16:51:34,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:51:34,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:51:34,820 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:51:34,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:51:34,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 51 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:34,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2022-02-20 16:51:34,822 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 11 [2022-02-20 16:51:34,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:51:34,822 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2022-02-20 16:51:34,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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 16:51:34,823 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2022-02-20 16:51:34,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 16:51:34,823 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:51:34,823 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 16:51:34,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:51:34,824 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-02-20 16:51:34,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:51:34,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1236050174, now seen corresponding path program 1 times [2022-02-20 16:51:34,825 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:51:34,825 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667739442] [2022-02-20 16:51:34,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:51:34,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:51:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:51:35,254 INFO L290 TraceCheckUtils]: 0: Hoare triple {975#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); {975#true} is VALID [2022-02-20 16:51:35,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {975#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~short14#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem21#1, main_#t~short22#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#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(12);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4);call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4);call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4);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; {977#(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) (<= |ULTIMATE.start_main_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 16:51:35,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {977#(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) (<= |ULTIMATE.start_main_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {977#(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) (<= |ULTIMATE.start_main_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 16:51:35,259 INFO L290 TraceCheckUtils]: 3: Hoare triple {977#(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) (<= |ULTIMATE.start_main_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|))} 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(12);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, main_#t~mem4#1.base, 4 + main_#t~mem4#1.offset, 4);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset;call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;call write~$Pointer$(0, 0, main_~x~0#1.base, main_~x~0#1.offset, 4);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {978#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (<= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |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|)) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 16:51:35,260 INFO L290 TraceCheckUtils]: 4: Hoare triple {978#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (<= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |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|)) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~marked~0#1 := 1; {979#(or (= |ULTIMATE.start_main_~marked~0#1| 0) (and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (<= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |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|)) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} is VALID [2022-02-20 16:51:35,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {979#(or (= |ULTIMATE.start_main_~marked~0#1| 0) (and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (<= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |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|)) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} assume 0 != main_~marked~0#1;call write~int(1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); {980#(and (= (select (select |#memory_int| (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.offset| 8)) 1) (<= |ULTIMATE.start_main_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 16:51:35,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {980#(and (= (select (select |#memory_int| (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.offset| 8)) 1) (<= |ULTIMATE.start_main_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {980#(and (= (select (select |#memory_int| (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.offset| 8)) 1) (<= |ULTIMATE.start_main_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 16:51:35,262 INFO L290 TraceCheckUtils]: 7: Hoare triple {980#(and (= (select (select |#memory_int| (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.offset| 8)) 1) (<= |ULTIMATE.start_main_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} assume !(0 != main_#t~nondet2#1 || 0 == main_~marked~0#1);havoc main_#t~nondet2#1; {980#(and (= (select (select |#memory_int| (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.offset| 8)) 1) (<= |ULTIMATE.start_main_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 16:51:35,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {980#(and (= (select (select |#memory_int| (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.offset| 8)) 1) (<= |ULTIMATE.start_main_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {981#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8) 1) (= (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 16:51:35,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {981#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {981#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8) 1) (= (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 16:51:35,265 INFO L290 TraceCheckUtils]: 10: Hoare triple {981#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} goto; {981#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8) 1) (= (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 16:51:35,265 INFO L290 TraceCheckUtils]: 11: Hoare triple {981#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} main_~marked~0#1 := 0; {981#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8) 1) (= (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 16:51:35,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {981#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short10#1 := main_#t~mem7#1.base != 0 || main_#t~mem7#1.offset != 0; {981#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8) 1) (= (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 16:51:35,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {981#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} assume main_#t~short10#1;call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_#t~mem8#1.base, 8 + main_#t~mem8#1.offset, 4);main_#t~short10#1 := 0 == main_#t~mem9#1; {981#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8) 1) (= (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 16:51:35,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {981#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} assume !main_#t~short10#1;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem9#1;havoc main_#t~short10#1; {981#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8) 1) (= (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 16:51:35,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {981#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short14#1 := main_#t~mem12#1.base != 0 || main_#t~mem12#1.offset != 0; {981#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8) 1) (= (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 16:51:35,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {981#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} assume main_#t~short14#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_#t~short14#1 := 0 != main_#t~nondet13#1; {981#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8) 1) (= (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 16:51:35,278 INFO L290 TraceCheckUtils]: 17: Hoare triple {981#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} assume !!main_#t~short14#1;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~nondet13#1;havoc main_#t~short14#1;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset; {982#(= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 16:51:35,279 INFO L290 TraceCheckUtils]: 18: Hoare triple {982#(= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) 1)} call main_#t~mem16#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); {983#(= |ULTIMATE.start_main_#t~mem16#1| 1)} is VALID [2022-02-20 16:51:35,279 INFO L290 TraceCheckUtils]: 19: Hoare triple {983#(= |ULTIMATE.start_main_#t~mem16#1| 1)} assume !(1 == main_#t~mem16#1);havoc main_#t~mem16#1; {976#false} is VALID [2022-02-20 16:51:35,279 INFO L290 TraceCheckUtils]: 20: Hoare triple {976#false} assume !false; {976#false} is VALID [2022-02-20 16:51:35,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:51:35,280 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:51:35,280 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667739442] [2022-02-20 16:51:35,281 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667739442] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:51:35,281 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568559373] [2022-02-20 16:51:35,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:51:35,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:51:35,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:51:35,287 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 16:51:35,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 16:51:35,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:51:35,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 57 conjunts are in the unsatisfiable core [2022-02-20 16:51:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:51:35,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:51:35,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 16:51:35,676 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 0 case distinctions, treesize of input 36 treesize of output 27 [2022-02-20 16:51:35,691 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 0 case distinctions, treesize of input 44 treesize of output 35 [2022-02-20 16:51:35,720 INFO L356 Elim1Store]: treesize reduction 50, result has 9.1 percent of original size [2022-02-20 16:51:35,720 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 2 case distinctions, treesize of input 80 treesize of output 70 [2022-02-20 16:51:35,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:51:35,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:51:35,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:51:35,732 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:51:35,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2022-02-20 16:51:35,740 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 30 treesize of output 28 [2022-02-20 16:51:35,756 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-02-20 16:51:35,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-02-20 16:51:35,858 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 16:51:35,859 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 48 treesize of output 45 [2022-02-20 16:51:35,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-20 16:51:35,876 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 19 treesize of output 11 [2022-02-20 16:51:36,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-02-20 16:51:36,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 16:51:36,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 16:51:36,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {975#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); {975#true} is VALID [2022-02-20 16:51:36,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {975#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~short14#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem21#1, main_#t~short22#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#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(12);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4);call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4);call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4);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; {977#(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) (<= |ULTIMATE.start_main_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 16:51:36,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {977#(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) (<= |ULTIMATE.start_main_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {977#(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) (<= |ULTIMATE.start_main_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 16:51:36,499 INFO L290 TraceCheckUtils]: 3: Hoare triple {977#(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) (<= |ULTIMATE.start_main_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|))} 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(12);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, main_#t~mem4#1.base, 4 + main_#t~mem4#1.offset, 4);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset;call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;call write~$Pointer$(0, 0, main_~x~0#1.base, main_~x~0#1.offset, 4);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {978#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (<= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |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|)) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 16:51:36,499 INFO L290 TraceCheckUtils]: 4: Hoare triple {978#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (<= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |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|)) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~marked~0#1 := 1; {978#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (<= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |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|)) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 16:51:36,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {978#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (<= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |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|)) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} assume 0 != main_~marked~0#1;call write~int(1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); {1002#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 8) 1) (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) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 16:51:36,504 INFO L290 TraceCheckUtils]: 6: Hoare triple {1002#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 8) 1) (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) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1002#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 8) 1) (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) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 16:51:36,505 INFO L290 TraceCheckUtils]: 7: Hoare triple {1002#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 8) 1) (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) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} assume !(0 != main_#t~nondet2#1 || 0 == main_~marked~0#1);havoc main_#t~nondet2#1; {1002#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 8) 1) (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) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 16:51:36,506 INFO L290 TraceCheckUtils]: 8: Hoare triple {1002#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 8) 1) (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) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {1012#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8) 1) (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 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 16:51:36,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {1012#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8) 1) (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 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {1012#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8) 1) (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 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 16:51:36,507 INFO L290 TraceCheckUtils]: 10: Hoare triple {1012#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8) 1) (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 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} goto; {1012#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8) 1) (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 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 16:51:36,509 INFO L290 TraceCheckUtils]: 11: Hoare triple {1012#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8) 1) (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 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} main_~marked~0#1 := 0; {1012#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8) 1) (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 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 16:51:36,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {1012#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8) 1) (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 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short10#1 := main_#t~mem7#1.base != 0 || main_#t~mem7#1.offset != 0; {1012#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8) 1) (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 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 16:51:36,511 INFO L290 TraceCheckUtils]: 13: Hoare triple {1012#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8) 1) (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 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} assume main_#t~short10#1;call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_#t~mem8#1.base, 8 + main_#t~mem8#1.offset, 4);main_#t~short10#1 := 0 == main_#t~mem9#1; {1012#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8) 1) (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 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 16:51:36,512 INFO L290 TraceCheckUtils]: 14: Hoare triple {1012#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8) 1) (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 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} assume !main_#t~short10#1;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem9#1;havoc main_#t~short10#1; {1012#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8) 1) (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 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 16:51:36,512 INFO L290 TraceCheckUtils]: 15: Hoare triple {1012#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8) 1) (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 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short14#1 := main_#t~mem12#1.base != 0 || main_#t~mem12#1.offset != 0; {1012#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8) 1) (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 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 16:51:36,513 INFO L290 TraceCheckUtils]: 16: Hoare triple {1012#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8) 1) (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 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} assume main_#t~short14#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_#t~short14#1 := 0 != main_#t~nondet13#1; {1012#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8) 1) (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 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 16:51:36,514 INFO L290 TraceCheckUtils]: 17: Hoare triple {1012#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 8) 1) (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 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} assume !!main_#t~short14#1;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~nondet13#1;havoc main_#t~short14#1;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset; {1040#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) 8) 1) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} is VALID [2022-02-20 16:51:36,514 INFO L290 TraceCheckUtils]: 18: Hoare triple {1040#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) 8) 1) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} call main_#t~mem16#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); {983#(= |ULTIMATE.start_main_#t~mem16#1| 1)} is VALID [2022-02-20 16:51:36,515 INFO L290 TraceCheckUtils]: 19: Hoare triple {983#(= |ULTIMATE.start_main_#t~mem16#1| 1)} assume !(1 == main_#t~mem16#1);havoc main_#t~mem16#1; {976#false} is VALID [2022-02-20 16:51:36,515 INFO L290 TraceCheckUtils]: 20: Hoare triple {976#false} assume !false; {976#false} is VALID [2022-02-20 16:51:36,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:51:36,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:51:36,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 57 [2022-02-20 16:51:36,645 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_260 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)) (forall ((v_ArrVal_262 (Array Int Int))) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-02-20 16:51:36,702 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:51:36,703 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 103 treesize of output 96 [2022-02-20 16:51:36,711 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:51:36,711 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 96 treesize of output 72 [2022-02-20 16:51:36,737 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:51:36,737 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 310 treesize of output 269 [2022-02-20 16:51:36,785 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:51:36,786 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 667 treesize of output 602 [2022-02-20 16:51:36,806 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 602 treesize of output 558 [2022-02-20 16:51:36,830 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 558 treesize of output 534 [2022-02-20 16:51:36,852 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 534 treesize of output 522 [2022-02-20 16:51:36,877 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 522 treesize of output 516 [2022-02-20 16:51:36,919 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 485 treesize of output 461 [2022-02-20 16:51:36,944 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 461 treesize of output 449 [2022-02-20 16:51:37,970 INFO L290 TraceCheckUtils]: 20: Hoare triple {976#false} assume !false; {976#false} is VALID [2022-02-20 16:51:37,970 INFO L290 TraceCheckUtils]: 19: Hoare triple {983#(= |ULTIMATE.start_main_#t~mem16#1| 1)} assume !(1 == main_#t~mem16#1);havoc main_#t~mem16#1; {976#false} is VALID [2022-02-20 16:51:37,971 INFO L290 TraceCheckUtils]: 18: Hoare triple {982#(= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) 1)} call main_#t~mem16#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); {983#(= |ULTIMATE.start_main_#t~mem16#1| 1)} is VALID [2022-02-20 16:51:37,972 INFO L290 TraceCheckUtils]: 17: Hoare triple {1059#(= (select (select |#memory_int| (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|) 8)) 1)} assume !!main_#t~short14#1;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~nondet13#1;havoc main_#t~short14#1;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset; {982#(= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 16:51:37,972 INFO L290 TraceCheckUtils]: 16: Hoare triple {1059#(= (select (select |#memory_int| (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|) 8)) 1)} assume main_#t~short14#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_#t~short14#1 := 0 != main_#t~nondet13#1; {1059#(= (select (select |#memory_int| (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|) 8)) 1)} is VALID [2022-02-20 16:51:37,973 INFO L290 TraceCheckUtils]: 15: Hoare triple {1059#(= (select (select |#memory_int| (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|) 8)) 1)} call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short14#1 := main_#t~mem12#1.base != 0 || main_#t~mem12#1.offset != 0; {1059#(= (select (select |#memory_int| (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|) 8)) 1)} is VALID [2022-02-20 16:51:37,973 INFO L290 TraceCheckUtils]: 14: Hoare triple {1059#(= (select (select |#memory_int| (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|) 8)) 1)} assume !main_#t~short10#1;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem9#1;havoc main_#t~short10#1; {1059#(= (select (select |#memory_int| (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|) 8)) 1)} is VALID [2022-02-20 16:51:37,974 INFO L290 TraceCheckUtils]: 13: Hoare triple {1059#(= (select (select |#memory_int| (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|) 8)) 1)} assume main_#t~short10#1;call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_#t~mem8#1.base, 8 + main_#t~mem8#1.offset, 4);main_#t~short10#1 := 0 == main_#t~mem9#1; {1059#(= (select (select |#memory_int| (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|) 8)) 1)} is VALID [2022-02-20 16:51:37,974 INFO L290 TraceCheckUtils]: 12: Hoare triple {1059#(= (select (select |#memory_int| (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|) 8)) 1)} call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short10#1 := main_#t~mem7#1.base != 0 || main_#t~mem7#1.offset != 0; {1059#(= (select (select |#memory_int| (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|) 8)) 1)} is VALID [2022-02-20 16:51:37,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {1059#(= (select (select |#memory_int| (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|) 8)) 1)} main_~marked~0#1 := 0; {1059#(= (select (select |#memory_int| (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|) 8)) 1)} is VALID [2022-02-20 16:51:37,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {1059#(= (select (select |#memory_int| (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|) 8)) 1)} goto; {1059#(= (select (select |#memory_int| (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|) 8)) 1)} is VALID [2022-02-20 16:51:37,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {1059#(= (select (select |#memory_int| (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|) 8)) 1)} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {1059#(= (select (select |#memory_int| (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|) 8)) 1)} is VALID [2022-02-20 16:51:37,977 INFO L290 TraceCheckUtils]: 8: Hoare triple {1087#(= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 8)) 1)} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {1059#(= (select (select |#memory_int| (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|) 8)) 1)} is VALID [2022-02-20 16:51:37,977 INFO L290 TraceCheckUtils]: 7: Hoare triple {1087#(= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 8)) 1)} assume !(0 != main_#t~nondet2#1 || 0 == main_~marked~0#1);havoc main_#t~nondet2#1; {1087#(= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 8)) 1)} is VALID [2022-02-20 16:51:37,978 INFO L290 TraceCheckUtils]: 6: Hoare triple {1087#(= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 8)) 1)} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1087#(= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 8)) 1)} is VALID [2022-02-20 16:51:37,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {1097#(and (forall ((v_ArrVal_262 (Array Int Int))) (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_262) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.offset|)) (forall ((v_ArrVal_260 (Array Int Int))) (= |ULTIMATE.start_main_~x~0#1.base| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_260) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))))} assume 0 != main_~marked~0#1;call write~int(1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); {1087#(= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 8)) 1)} is VALID [2022-02-20 16:51:37,980 INFO L290 TraceCheckUtils]: 4: Hoare triple {1097#(and (forall ((v_ArrVal_262 (Array Int Int))) (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_262) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.offset|)) (forall ((v_ArrVal_260 (Array Int Int))) (= |ULTIMATE.start_main_~x~0#1.base| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_260) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))))} assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~marked~0#1 := 1; {1097#(and (forall ((v_ArrVal_262 (Array Int Int))) (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_262) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.offset|)) (forall ((v_ArrVal_260 (Array Int Int))) (= |ULTIMATE.start_main_~x~0#1.base| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_260) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))))} is VALID [2022-02-20 16:51:37,982 INFO L290 TraceCheckUtils]: 3: Hoare triple {1104#(forall ((v_arrayElimCell_12 Int)) (or (and (not (= |ULTIMATE.start_main_~x~0#1.base| v_arrayElimCell_12)) (= |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 (= (select |#valid| v_arrayElimCell_12) 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(12);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, main_#t~mem4#1.base, 4 + main_#t~mem4#1.offset, 4);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset;call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;call write~$Pointer$(0, 0, main_~x~0#1.base, main_~x~0#1.offset, 4);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {1097#(and (forall ((v_ArrVal_262 (Array Int Int))) (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_262) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.offset|)) (forall ((v_ArrVal_260 (Array Int Int))) (= |ULTIMATE.start_main_~x~0#1.base| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_260) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))))} is VALID [2022-02-20 16:51:37,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {1104#(forall ((v_arrayElimCell_12 Int)) (or (and (not (= |ULTIMATE.start_main_~x~0#1.base| v_arrayElimCell_12)) (= |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 (= (select |#valid| v_arrayElimCell_12) 0))))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1104#(forall ((v_arrayElimCell_12 Int)) (or (and (not (= |ULTIMATE.start_main_~x~0#1.base| v_arrayElimCell_12)) (= |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 (= (select |#valid| v_arrayElimCell_12) 0))))} is VALID [2022-02-20 16:51:37,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {975#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~short14#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem21#1, main_#t~short22#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#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(12);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4);call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4);call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4);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; {1104#(forall ((v_arrayElimCell_12 Int)) (or (and (not (= |ULTIMATE.start_main_~x~0#1.base| v_arrayElimCell_12)) (= |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 (= (select |#valid| v_arrayElimCell_12) 0))))} is VALID [2022-02-20 16:51:37,984 INFO L290 TraceCheckUtils]: 0: Hoare triple {975#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); {975#true} is VALID [2022-02-20 16:51:37,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:51:37,985 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568559373] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:51:37,985 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:51:37,985 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-02-20 16:51:37,986 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584561706] [2022-02-20 16:51:37,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:51:37,986 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 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 16:51:37,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:51:37,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:38,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:51:38,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-20 16:51:38,048 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:51:38,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-20 16:51:38,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=175, Unknown=1, NotChecked=26, Total=240 [2022-02-20 16:51:38,050 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:39,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:51:39,551 INFO L93 Difference]: Finished difference Result 109 states and 142 transitions. [2022-02-20 16:51:39,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 16:51:39,551 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 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 16:51:39,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:51:39,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:39,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 138 transitions. [2022-02-20 16:51:39,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:39,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 138 transitions. [2022-02-20 16:51:39,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 138 transitions. [2022-02-20 16:51:39,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:51:39,691 INFO L225 Difference]: With dead ends: 109 [2022-02-20 16:51:39,691 INFO L226 Difference]: Without dead ends: 107 [2022-02-20 16:51:39,691 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=336, Unknown=1, NotChecked=38, Total=462 [2022-02-20 16:51:39,692 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 130 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 16:51:39,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 413 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 301 Invalid, 0 Unknown, 106 Unchecked, 0.5s Time] [2022-02-20 16:51:39,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-02-20 16:51:39,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 70. [2022-02-20 16:51:39,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:51:39,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 70 states, 65 states have (on average 1.353846153846154) internal successors, (88), 69 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:39,714 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 70 states, 65 states have (on average 1.353846153846154) internal successors, (88), 69 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:39,714 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 70 states, 65 states have (on average 1.353846153846154) internal successors, (88), 69 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:39,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:51:39,717 INFO L93 Difference]: Finished difference Result 107 states and 140 transitions. [2022-02-20 16:51:39,717 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 140 transitions. [2022-02-20 16:51:39,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:51:39,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:51:39,718 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 65 states have (on average 1.353846153846154) internal successors, (88), 69 states have internal predecessors, (88), 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 107 states. [2022-02-20 16:51:39,718 INFO L87 Difference]: Start difference. First operand has 70 states, 65 states have (on average 1.353846153846154) internal successors, (88), 69 states have internal predecessors, (88), 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 107 states. [2022-02-20 16:51:39,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:51:39,721 INFO L93 Difference]: Finished difference Result 107 states and 140 transitions. [2022-02-20 16:51:39,721 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 140 transitions. [2022-02-20 16:51:39,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:51:39,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:51:39,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:51:39,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:51:39,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 65 states have (on average 1.353846153846154) internal successors, (88), 69 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:39,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2022-02-20 16:51:39,724 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 21 [2022-02-20 16:51:39,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:51:39,725 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2022-02-20 16:51:39,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:51:39,725 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2022-02-20 16:51:39,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 16:51:39,726 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:51:39,726 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:51:39,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 16:51:39,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:51:39,950 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-02-20 16:51:39,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:51:39,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1635781222, now seen corresponding path program 1 times [2022-02-20 16:51:39,951 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:51:39,951 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496652250] [2022-02-20 16:51:39,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:51:39,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:51:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:51:40,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {1551#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); {1551#true} is VALID [2022-02-20 16:51:40,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {1551#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~short14#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem21#1, main_#t~short22#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#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(12);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4);call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4);call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4);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; {1553#(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 16:51:40,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {1553#(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; {1553#(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 16:51:40,159 INFO L290 TraceCheckUtils]: 3: Hoare triple {1553#(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(12);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, main_#t~mem4#1.base, 4 + main_#t~mem4#1.offset, 4);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset;call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;call write~$Pointer$(0, 0, main_~x~0#1.base, main_~x~0#1.offset, 4);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {1554#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.offset|) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= |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 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 16:51:40,160 INFO L290 TraceCheckUtils]: 4: Hoare triple {1554#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.offset|) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= |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 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~marked~0#1 := 1; {1555#(or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.offset|) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= |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 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)) (= |ULTIMATE.start_main_~marked~0#1| 0))} is VALID [2022-02-20 16:51:40,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {1555#(or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.offset|) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= |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 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)) (= |ULTIMATE.start_main_~marked~0#1| 0))} assume 0 != main_~marked~0#1;call write~int(1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); {1556#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 0))} is VALID [2022-02-20 16:51:40,162 INFO L290 TraceCheckUtils]: 6: Hoare triple {1556#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1556#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 0))} is VALID [2022-02-20 16:51:40,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {1556#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 0))} assume !(0 != main_#t~nondet2#1 || 0 == main_~marked~0#1);havoc main_#t~nondet2#1; {1556#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 0))} is VALID [2022-02-20 16:51:40,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {1556#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 0))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {1557#(and (= (select (select |#memory_$Pointer$.offset| (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) (= (select (select |#memory_$Pointer$.base| (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 16:51:40,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {1557#(and (= (select (select |#memory_$Pointer$.offset| (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) (= (select (select |#memory_$Pointer$.base| (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))} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {1557#(and (= (select (select |#memory_$Pointer$.offset| (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) (= (select (select |#memory_$Pointer$.base| (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 16:51:40,164 INFO L290 TraceCheckUtils]: 10: Hoare triple {1557#(and (= (select (select |#memory_$Pointer$.offset| (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) (= (select (select |#memory_$Pointer$.base| (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))} goto; {1557#(and (= (select (select |#memory_$Pointer$.offset| (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) (= (select (select |#memory_$Pointer$.base| (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 16:51:40,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {1557#(and (= (select (select |#memory_$Pointer$.offset| (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) (= (select (select |#memory_$Pointer$.base| (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))} main_~marked~0#1 := 0; {1557#(and (= (select (select |#memory_$Pointer$.offset| (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) (= (select (select |#memory_$Pointer$.base| (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 16:51:40,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {1557#(and (= (select (select |#memory_$Pointer$.offset| (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) (= (select (select |#memory_$Pointer$.base| (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))} call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short10#1 := main_#t~mem7#1.base != 0 || main_#t~mem7#1.offset != 0; {1557#(and (= (select (select |#memory_$Pointer$.offset| (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) (= (select (select |#memory_$Pointer$.base| (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 16:51:40,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {1557#(and (= (select (select |#memory_$Pointer$.offset| (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) (= (select (select |#memory_$Pointer$.base| (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))} assume main_#t~short10#1;call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_#t~mem8#1.base, 8 + main_#t~mem8#1.offset, 4);main_#t~short10#1 := 0 == main_#t~mem9#1; {1557#(and (= (select (select |#memory_$Pointer$.offset| (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) (= (select (select |#memory_$Pointer$.base| (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 16:51:40,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {1557#(and (= (select (select |#memory_$Pointer$.offset| (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) (= (select (select |#memory_$Pointer$.base| (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))} assume !!main_#t~short10#1;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem9#1;havoc main_#t~short10#1;call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {1558#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (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 16:51:40,167 INFO L290 TraceCheckUtils]: 15: Hoare triple {1558#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short10#1 := main_#t~mem7#1.base != 0 || main_#t~mem7#1.offset != 0; {1559#(not |ULTIMATE.start_main_#t~short10#1|)} is VALID [2022-02-20 16:51:40,168 INFO L290 TraceCheckUtils]: 16: Hoare triple {1559#(not |ULTIMATE.start_main_#t~short10#1|)} assume main_#t~short10#1;call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_#t~mem8#1.base, 8 + main_#t~mem8#1.offset, 4);main_#t~short10#1 := 0 == main_#t~mem9#1; {1552#false} is VALID [2022-02-20 16:51:40,168 INFO L290 TraceCheckUtils]: 17: Hoare triple {1552#false} assume !main_#t~short10#1;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem9#1;havoc main_#t~short10#1; {1552#false} is VALID [2022-02-20 16:51:40,171 INFO L290 TraceCheckUtils]: 18: Hoare triple {1552#false} call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short14#1 := main_#t~mem12#1.base != 0 || main_#t~mem12#1.offset != 0; {1552#false} is VALID [2022-02-20 16:51:40,171 INFO L290 TraceCheckUtils]: 19: Hoare triple {1552#false} assume main_#t~short14#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_#t~short14#1 := 0 != main_#t~nondet13#1; {1552#false} is VALID [2022-02-20 16:51:40,171 INFO L290 TraceCheckUtils]: 20: Hoare triple {1552#false} assume !!main_#t~short14#1;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~nondet13#1;havoc main_#t~short14#1;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset; {1552#false} is VALID [2022-02-20 16:51:40,172 INFO L290 TraceCheckUtils]: 21: Hoare triple {1552#false} call main_#t~mem16#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); {1552#false} is VALID [2022-02-20 16:51:40,172 INFO L290 TraceCheckUtils]: 22: Hoare triple {1552#false} assume !(1 == main_#t~mem16#1);havoc main_#t~mem16#1; {1552#false} is VALID [2022-02-20 16:51:40,172 INFO L290 TraceCheckUtils]: 23: Hoare triple {1552#false} assume !false; {1552#false} is VALID [2022-02-20 16:51:40,172 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:51:40,173 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:51:40,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496652250] [2022-02-20 16:51:40,173 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496652250] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:51:40,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438319091] [2022-02-20 16:51:40,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:51:40,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:51:40,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:51:40,175 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 16:51:40,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 16:51:40,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:51:40,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 62 conjunts are in the unsatisfiable core [2022-02-20 16:51:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:51:40,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:51:40,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 16:51:40,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:51:40,415 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:51:40,420 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 0 case distinctions, treesize of input 39 treesize of output 30 [2022-02-20 16:51:40,448 INFO L356 Elim1Store]: treesize reduction 26, result has 16.1 percent of original size [2022-02-20 16:51:40,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 253 treesize of output 190 [2022-02-20 16:51:40,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:51:40,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:51:40,497 INFO L356 Elim1Store]: treesize reduction 136, result has 3.5 percent of original size [2022-02-20 16:51:40,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 186 treesize of output 204 [2022-02-20 16:51:40,519 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 8 treesize of output 7 [2022-02-20 16:51:40,537 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 8 treesize of output 7 [2022-02-20 16:51:40,560 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 16:51:40,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 16:51:40,588 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 8 treesize of output 7 [2022-02-20 16:51:40,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:51:40,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:51:40,612 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:51:40,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2022-02-20 16:51:40,638 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 8 treesize of output 7 [2022-02-20 16:51:40,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7